New Construction of Family of MLCS Algorithms

The multiple longest common subsequence (MLCS) problem involves finding all the longest common subsequences of multiple character sequences. This problem is encountered in a variety of areas, including data mining, text processing, and bioinformatics, and is particularly important for biological seq...

Descripción completa

Detalles Bibliográficos
Autores principales: Shi, Haihe, Wang, Jun
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Hindawi 2021
Materias:
Research Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7843170/
https://www.ncbi.nlm.nih.gov/pubmed/33542799
http://dx.doi.org/10.1155/2021/6636710

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7843170/
https://www.ncbi.nlm.nih.gov/pubmed/33542799
http://dx.doi.org/10.1155/2021/6636710

Ejemplares similares