Name
Abstract | ||
|---|---|---|
Two algorithms are presented that solve the problem of recovering the longest common subsequence of two strings. The first algorithm is an improvement of Hirschberg's divide-and-conquer algorithm. The second algorithm is an improvement of Hunt-Szymanski algorithm based on an efficient computation of all dominant match points. These two algorithms use bit-vector operations and are shown to work very efficiently in practice. |
Year | DOI | Venue |
|---|---|---|
2001 | 10.1109/SPIRE.2001.989737 | Fundamenta Informaticae - Computing Patterns in Strings |
Keywords | DocType | Volume |
bit-parallelism c corresponding author,hunt-szymanski lcs algorithms,bit-vector operation,longest common subsequence,dominant match point,hunt-szymanski algorithm,divide-and-conquer algorithm,hunt-szymanski lcs algorithm,speeding-up hirschberg,efficient computation,divide and conquer | Conference | 56 |
Issue | ISSN | Citations |
1-2 | 0169-2968 | 4 |
PageRank | References | Authors |
0.46 | 17 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Maxime Crochemore | 1 | 2655 | 281.75 |
| Costas S. Ilipoulos | 2 | 4 | 0.46 |
| Yoan J. Pinzon | 3 | 158 | 16.81 |