Fast algorithms for approximate circular string matching

BACKGROUND: Circular string matching is a problem which naturally arises in many biological contexts. It consists in finding all occurrences of the rotations of a pattern of length m in a text of length n. There exist optimal average-case algorithms for exact circular string matching. Approximate ci...

Descripción completa

Detalles Bibliográficos
Autores principales: Barton, Carl, Iliopoulos, Costas S, Pissis, Solon P
Formato: Online Artículo Texto
Lenguaje:English
Publicado: BioMed Central 2014
Materias:
Research
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4234210/
https://www.ncbi.nlm.nih.gov/pubmed/24656145
http://dx.doi.org/10.1186/1748-7188-9-9

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4234210/
https://www.ncbi.nlm.nih.gov/pubmed/24656145
http://dx.doi.org/10.1186/1748-7188-9-9

Ejemplares similares