A fast parallel algorithm for finding the longest common sequence of multiple biosequences

BACKGROUND: Searching for the longest common sequence (LCS) of multiple biosequences is one of the most fundamental tasks in bioinformatics. In this paper, we present a parallel algorithm named FAST_LCS to speedup the computation for finding LCS. RESULTS: A fast parallel algorithm for LCS is present...

Descripción completa

Detalles Bibliográficos
Autores principales: Chen, Yixin, Wan, Andrew, Liu, Wei
Formato: Texto
Lenguaje:English
Publicado: BioMed Central 2006
Materias:
Research
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC1780122/
https://www.ncbi.nlm.nih.gov/pubmed/17217522
http://dx.doi.org/10.1186/1471-2105-7-S4-S4

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC1780122/
https://www.ncbi.nlm.nih.gov/pubmed/17217522
http://dx.doi.org/10.1186/1471-2105-7-S4-S4

Ejemplares similares