An approximation to the Longest Common Subsequence for Multiple Sequences problem using Shannon’s Entropy
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...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | Spanish |
| Published: |
Universidad Nacional de Trujillo
2019-12-01
|
| Series: | Selecciones Matemáticas |
| Subjects: | |
| Online Access: | http://revistas.unitru.edu.pe/index.php/SSMM/article/view/2634 |