Cargando…

A fast and efficient path elimination algorithm for large-scale multiple common longest sequence problems

BACKGROUND: In various fields, searching for the Longest Common Subsequences (LCS) of Multiple (i.e., three or more) sequences (MLCS) is a classic but difficult problem to solve. The primary bottleneck in this problem is that present state-of-the-art algorithms require the construction of a huge gra...

Descripción completa

Detalles Bibliográficos
Autores principales: Yu, Changyong, Lin, Pengxi, Zhao, Yuhai, Ren, Tianmei, Wang, Guoren
Formato: Online Artículo Texto
Lenguaje:English
Publicado: BioMed Central 2022
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9450393/
https://www.ncbi.nlm.nih.gov/pubmed/36071384
http://dx.doi.org/10.1186/s12859-022-04906-5