Computing a Longest Common Subsequence of two strings when one of them is Run Length Encoded
Given two strings, the longest common subsequence (LCS) problem computes a common subsequence that has the maximum length. In this paper, we present new and efficient algorithms for solving the LCS problem for two strings one of which is run length encoded (RLE). We first present an algorithm that r...
| Autor principal: | |
|---|---|
| Outros Autores: | , , |
| Formato: | article |
| Idioma: | eng |
| Publicado em: |
2011
|
| Assuntos: | |
| Texto completo: | https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/337 |
| País: | Brasil |
| Oai: | oai:infocomp.dcc.ufla.br:article/337 |