Efficient repeat finding in sets of strings via suffix arrays

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...

Descripción completa

Detalles Bibliográficos
Autores principales: Barenbaum, Pablo, Becher, Verónica Andrea, Heiber, Pablo Ariel
Publicado: 2013
Materias:
Longest maximal substring
Repeats
Stringology
Suffix array
Expensive parts
Input string
Maximal repeats
Maximal substring
Sub-strings
Suffix arrays
Algorithms
Indexing (of information)
Acceso en línea:https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_14627264_v15_n2_p59_Barenbaum
http://hdl.handle.net/20.500.12110/paper_14627264_v15_n2_p59_Barenbaum
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

Ejemplares similares

Ejemplares similares