Efficient repeat finding in sets of strings via suffix arrays - Inria - Institut national de recherche en sciences et technologies du numérique
Article Dans Une Revue Discrete Mathematics and Theoretical Computer Science Année : 2013

Efficient repeat finding in sets of strings via suffix arrays

Résumé

We consider two repeat finding problems relative to sets of strings: (a) Find the largest substrings that occur in every string of a given set; (b) Find the maximal repeats in a given string that occur in no string of a given set. Our solutions are based on the suffix array construction, requiring O(m) memory, where m is the length of the longest input string, and O(n &log;m) time, where n is the the whole input size (the sum of the length of each string in the input). The most expensive part of our algorithms is the computation of several suffix arrays. We give an implementation and experimental results that evidence the efficiency of our algorithms in practice, even for very large inputs.
Fichier principal
Vignette du fichier
2130-7867-1-PB.pdf (158.95 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00980753 , version 1 (18-04-2014)

Identifiants

Citer

Pablo Barenbaum, Verónica Becher, Alejandro Deymonnaz, Melisa Halsband, Pablo Ariel Heiber. Efficient repeat finding in sets of strings via suffix arrays. Discrete Mathematics and Theoretical Computer Science, 2013, Vol. 15 no. 2 (2), pp.59--70. ⟨10.46298/dmtcs.597⟩. ⟨hal-00980753⟩

Collections

TDS-MACS
205 Consultations
1156 Téléchargements

Altmetric

Partager

More