A new algorithm for “the LCS problem” with application in compressing genome resequencing data

BACKGROUND: The longest common subsequence (LCS) problem is a classical problem in computer science, and forms the basis of the current best-performing reference-based compression schemes for genome resequencing data. METHODS: First, we present a new algorithm for the LCS problem. Using the generali...

Descripción completa

Detalles Bibliográficos
Autores principales: Beal, Richard, Afrin, Tazin, Farheen, Aliya, Adjeroh, Donald
Formato: Online Artículo Texto
Lenguaje:English
Publicado: BioMed Central 2016
Materias:
Research
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5001248/
https://www.ncbi.nlm.nih.gov/pubmed/27556803
http://dx.doi.org/10.1186/s12864-016-2793-0

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5001248/
https://www.ncbi.nlm.nih.gov/pubmed/27556803
http://dx.doi.org/10.1186/s12864-016-2793-0

Ejemplares similares