Fast linear-space computations of longest common subsequences

Theoretical Computer Science

Volumn 92, Issue 1, 1992, Pages 3-17

  Apostolico, A ^a,b   Browne, S ^a   Guerra, C ^a,c  

^a PURDUE UNIVERSITY   (United States)

^b UNIVERSITY OF L'AQUILA   (Italy)

^c SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL TECHNIQUES--ALGORITHMS;

COMPLEXITY OF ALGORITHMS;

COMPUTER METATHEORY;

EID: 0027113229     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(92)90132-Y     Document Type: Article

References (17)

1. Bounds on the complexity of the maximal common subsequence problem
2. Improving the worst-case performance of the Hunt-Szymanski strategy for the longest common subsequence of two strings
3. A fast linear-space algorithm for computing longest common subsequences
4. The longest common subsequence problem revisited
5. A representation of linear lists with movable fingers
6. A linear-space algorithm for computing maximal common subsequences
7. Algorithms for the longest common subsequence problem
8. A fast algorithm for computing longest common subsequences
9. A linear-space algorithm for the LCS problem
10. Mathematical and computational problems in the analysis of molecular sequences
11. A faster algorithm for computing string editing distances
12. Data Structures and Algorithms 1: Sorting and Searching
13. An O(ND) difference algorithm and its variations
14. A longest common subsequence algorithm suitable for similar text strings
15. The string to string correction problem