A faster algorithm computing string edit distances

Journal of Computer and System Sciences

Volumn 20, Issue 1, 1980, Pages 18-31

  Masek, William J ^a   Paterson, Michael S ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b School of Computer Science University of Warwick Coventry Warwicks United Kingdom ^*

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING;

EID: 0018985316     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/0022-0000(80)90002-1     Document Type: Article

References (9)

1. Bounds on the complexity of the longest common subsequence problem
2. On economic construction of the, transitive closure of a directed graph
3. A linear space algorithm for computing maximal common subsequences
4. On time versus space and other related problems
5. An extension of the string to string correction problem
6. The string to string correction problem
7. Bounds for the string editing problem