Abstract : Here we consider computational problems on δ-approximate and (δ, γ)-approximate string matching. These are two new notions of approximate matching that arise naturally in applications of computer assisted music analysis. We present fast, efficient and practical algorithms for these two notions of approximate string matching
https://hal-upec-upem.archives-ouvertes.fr/hal-00619981
Contributor : Maxime Crochemore
<>
Submitted on : Tuesday, March 19, 2013 - 5:48:53 PM
Last modification on : Thursday, May 9, 2019 - 8:02:09 PM
Long-term archiving on: Thursday, June 20, 2013 - 4:21:11 PM
