libFLASM: a software library for fixed-length approximate string matching

BACKGROUND: Approximate string matching is the problem of finding all factors of a given text that are at a distance at most k from a given pattern. Fixed-length approximate string matching is the problem of finding all factors of a text of length n that are at a distance at most k from any factor o...

Descripción completa

Detalles Bibliográficos
Autores principales: Ayad, Lorraine A. K., Pissis, Solon P., Retha, Ahmad
Formato: Online Artículo Texto
Lenguaje:English
Publicado: BioMed Central 2016
Materias:
Software
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5103500/
https://www.ncbi.nlm.nih.gov/pubmed/27832739
http://dx.doi.org/10.1186/s12859-016-1320-2

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5103500/
https://www.ncbi.nlm.nih.gov/pubmed/27832739
http://dx.doi.org/10.1186/s12859-016-1320-2

Ejemplares similares