Simple and Flexible Detection of Contiguous Repeats Using a Suffix Tree (Preliminary Version)

Simple and flexible detection of contiguous repeats using a suffix tree

Theoretical Computer Science

Computing the Quartet Distance between Evolutionary Trees in Time O(n log2 n)

ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation

Finding Maximal Quasiperiodicities in Strings

COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching

Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its Applications

CPM '01 Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching

Finding Maximal Pairs with Bounded Gap

CPM '99 Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching

On Maximal Repetitions in Words

FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory

String pattern matching for a deluge survival kit

Handbook of massive data sets

Finding Maximal Repetitions in a Word in Linear Time

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science

Computing quasi suffix arrays

Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the 13th Australasian workshop on combinatorial algorithms

Locating All Tandem Repeat Families in a Sequence

CSB '04 Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference

The Weighted Suffix Tree: An Efficient Data Structure for Handling Molecular Weighted Sequences and its Applications

Fundamenta Informaticae

Maximal repetitions in strings

Journal of Computer and System Sciences

Discovering regularities in biosequences: Challenges and applications

Journal of Computational Methods in Sciences and Engineering

Application of the Burrows-Wheeler Transform for searching for tandem repeats in DNA sequences

International Journal of Bioinformatics Research and Applications

A minimal periods algorithm with applications

CPM'10 Proceedings of the 21st annual conference on Combinatorial pattern matching

On the maximal sum of exponents of runs in a string

IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms

On the maximal sum of exponents of runs in a string

Journal of Discrete Algorithms

The Weighted Suffix Tree: An Efficient Data Structure for Handling Molecular Weighted Sequences and its Applications

Fundamenta Informaticae

Analysis of maximal repetitions in strings

MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science