An approximation to the Longest Common Subsequence for Multiple Sequences problem using Shannon’s Entropy

Descripción del Articulo

The Longest Common Subsequence for Multiples Sequences problem (LCSM), has been studied for more than 40 years, mainly motivated by its multiple applications in Bioinformatics. In this article we present a heuristic algorithm that estimates one or more solutions to the LCSM problem, using the Shanno...

Descripción completa

Detalles Bibliográficos
Autor: Sáenz, Ross Mary
Formato: artículo
Fecha de Publicación:2019
Institución:Universidad Nacional de Trujillo
Repositorio:Revistas - Universidad Nacional de Trujillo
Lenguaje:español
OAI Identifier:oai:ojs.revistas.unitru.edu.pe:article/2634
Enlace del recurso:https://revistas.unitru.edu.pe/index.php/SSMM/article/view/2634
Nivel de acceso:acceso abierto
Materia:Heuristic Algorithm
Subsequence
Common Subsequence
Alignment
Entropy
Simulation
Algoritmo Heurístico
Subsecuencia
Subsecuencia Común
Alineamiento
Entropía
Descripción
Sumario:The Longest Common Subsequence for Multiples Sequences problem (LCSM), has been studied for more than 40 years, mainly motivated by its multiple applications in Bioinformatics. In this article we present a heuristic algorithm that estimates one or more solutions to the LCSM problem, using the Shannon’s Entropy as a measure of information in order to determine alignments with the greatest number of matches.
An approximation to the Longest Common Subsequence for Multiple Sequences problem using Shannon’s Entropy
Nota importante:
La información contenida en este registro es de entera responsabilidad de la institución que gestiona el repositorio institucional donde esta contenido este documento o set de datos. El CONCYTEC no se hace responsable por los contenidos (publicaciones y/o datos) accesibles a través del Repositorio Nacional Digital de Ciencia, Tecnología e Innovación de Acceso Abierto (ALICIA).

Ejemplares Similares