Sobre el longest common subsequence: extensiones y algoritmos
Abstract
Dadas dos palabras x e y sobre un alfabeto finito cualquiera, el problema de la Longest Common Subsequence (LCS) en castellano Subsecuencia Común Más Larga Conwsiste, como su nombre sugiere, en encontrar cuál es el largo máximo que puede tener una palabra que sea subsecuencia de x e y simultáneamente.
Palabras clave: Alineamiento, LCS, subsecuencia común más larga, similitud.
How to Cite
Downloads
Downloads
Published
Issue
Section
License
The publication of an article in the Colombian Journal of Computing, requires authorization by the author, through the letter of assignment, which authorizes the Editor of this Journal for partial or total reproduction, for academic purposes, not commercial or lucrative, according to the Open Access philosophy on Web sites and on the Internet, such as networks, bibliographic databases, indexes, directories or any other means of electronic reproduction, always referring to the author(s) and the journal, as stipulated in Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
Altmetric
| Article metrics | |
|---|---|
| Abstract views | 348 |
| Galley views | 175 |
| PDF Views | 175 |
| HTML views | 0 |
| Other views | 0 |


