"On the complexity of finding common approximate substrings."

Patricia A. Evans, Andrew D. Smith, Harold T. Wareham (2003)

Details and statistics

DOI: 10.1016/S0304-3975(03)00320-7

access: open

type: Journal Article

metadata version: 2021-06-01

a service of  Schloss Dagstuhl - Leibniz Center for Informatics