All highest scoring paths in weighted grid graphs and their application to finding all approximate repeats in strings

SIAM Journal on Computing

Volumn 27, Issue 4, 1998, Pages 972-992

  Schmidt, Jeanette P ^a  

^a POLYTECHNIC UNIVERSITY   (United States)

Author keywords

Dynamic programming; Edit distance; String matching; Tandem repeats

Indexed keywords

EID: 0001596047     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539795288489     Document Type: Article

References (1)

1. [AALM-90] A. APOSTOLICO, M. ATALLAH, L. LARMORE, AND S. MCFADDIN, Efficient parallel algorithms for string editing problems, SIAM J. Comput., 19 (1990), pp. 968-988.