The longest common subsequence problem revisited

Algorithmica

Volumn 2, Issue 1-4, 1987, Pages 315-336

  Apostolico, A ^a   Guerra, C ^a  

^a PURDUE UNIVERSITY   (United States)

Author keywords

Characteristic tree; Design and analysis of algorithms; Dictionary; Dynamic programming; Efficient merging of linear lists; Finger tree; Longest common subsequence

Indexed keywords

DATA PROCESSING - DATA STRUCTURES; MATHEMATICAL PROGRAMMING, DYNAMIC;

LONGEST COMMON SUBSEQUENCE PROBLEM;

COMPUTER PROGRAMMING;

EID: 0023586274     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/BF01840365     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. An almost optimal algorithm for unbounded searching
4. A fast merging algorithm
5. A linear space algorithm for computing maximal common subsequences
6. Algorithms for the longest common subsequence problem
7. New algorithms for the LCS problem
8. A fast algorithm for computing longest common subsequences
9. A faster algorithm for computing string editing distances
10. Data Structures and Algorithms 1: Sorting and Searching
11. Preserving order in a forest in less than logarithmic time and linear space
12. The string to string correction problem