Linear-time computation of minimal absent words using suffix array

BACKGROUND: An absent word of a word y of length n is a word that does not occur in y. It is a minimal absent word if all its proper factors occur in y. Minimal absent words have been computed in genomes of organisms from all domains of life; their computation also provides a fast alternative for me...

Descripción completa

Detalles Bibliográficos
Autores principales: Barton, Carl, Heliou, Alice, Mouchard, Laurent, Pissis, Solon P
Formato: Online Artículo Texto
Lenguaje:English
Publicado: BioMed Central 2014
Materias:
Research Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4297395/
https://www.ncbi.nlm.nih.gov/pubmed/25526884
http://dx.doi.org/10.1186/s12859-014-0388-9

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4297395/
https://www.ncbi.nlm.nih.gov/pubmed/25526884
http://dx.doi.org/10.1186/s12859-014-0388-9

Ejemplares similares