

...rep(eats)seeker algorithm for repeats recognition based on the adaptive ukkonen algorithm for a suffix tree construction. the repseeker algorithm uses the lowest frequency limit to...positions of the substring. the improvement is noticeable for the repeats recognition. comparisons between before and after improvements of the suffix tree construction show that improvements greatly reduce the running time...


...to postconstruction
operations on suffix trees. therefore, we investigate the effects of improved spatial locality on certain postconstruction
operations on suffix trees. we used a maximal exact repeat finding algorithm, merf, on which...

...algorithm to find all tandem repeats, and then modify it to become a time and spaceoptimal algorithm for finding only the primitive tandem repeats. both of these algorithms are...and implementations based on a suffix tree, using only standard tree traversal techniques....

...a new method suggested which uses suffix trees for the vector query improvement. this method treats with documents...

...string matches, and find ing repeat patterns. however, methods for constructing suf fix trees are often very timeconsuming, especially for suffix trees that are large and do...mem ory. even when the suffix tree fits in memory, it turns out that the processor cache behavior of theoretically optimal suffix tree construction methods is poor, resulting...

...the ondisk construction of suffix trees through a careful choice of buffering policy and physical representation of suffix tree nodes. in this paper, we...search algorithms that exploit the suffix link feature of suffix trees. these results are encouragingwith regard...

...and analyzing these massive data. suffix trees are widely used to solve many sequencebased...space, provided the re sulting tree fits in mainmemory. to index larger sequences, several external suffix tree algorithms have been proposed in...

...the suffix tree is one of the most...show how every algorithm that uses a suffix tree as data structure can systematically be replaced with an algo rithm that uses an enhanced suffix array and solves the same...