Longest repeats with a block of k don't cares

Authors:
Maxime Crochemore;Costas S. Iliopoulos;Manal Mohamed;Marie-France Sagot
Affiliations:
Institut Gaspard-Monge, University of Marne-la-Vallée, Marne-la-Vallée CEDEX, France and Department of Computer Science, King's College London, London, UK;Department of Computer Science, King's College London, London, UK;Department of Computer Science, King's College London, London, UK;Inria Rhône-Alpes, Laboratoire de Biométrie et Biologie Évolutive, Université Claude Bernard, Villeurbanne cedex, France
Venue:
Theoretical Computer Science
Year:
2006

Citing 7
Cited 4

On finding lowest common ancestors: simplification and parallelization

SIAM Journal on Computing
Algorithms on strings, trees, and sequences: computer science and computational biology

Algorithms on strings, trees, and sequences: computer science and computational biology
A Fast Merging Algorithm

Journal of the ACM (JACM)
The Enhanced Suffix Array and Its Applications to Genome Analysis

WABI '02 Proceedings of the Second International Workshop on Algorithms in Bioinformatics
Identifying Occurrences of Maximal Pairs in Multiple Strings

CPM '02 Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching
Replacing suffix trees with enhanced suffix arrays

Journal of Discrete Algorithms - SPIRE 2002
Computing all repeats using suffix arrays

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

Maximal and minimal representations of gapped and non-gapped motifs of a string

Theoretical Computer Science
On the complexity of finding gapped motifs

Journal of Discrete Algorithms
Minimum Unique Substrings and Maximum Repeats

Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday
Structural analysis of gapped motifs of a string

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

Quantified Score

Hi-index	5.23

Visualization

Abstract

A k-repeat is a string wk = u*k v that matches more than one substring of x, where * is the don't care letter and k 0. We propose an O(n log n)-time algorithm for computing all longest k-repeats in a given string x = x[1..n]. The proposed algorithm uses suffix trees to fulfill this task and relies on the ability to answer lowest common ancestor queries in constant time.