2 search results - page 1 / 1 » Restricted Transposition Invariant Approximate String Matchi... |
SPIRE
2005
Springer
13 years 10 months ago
2005
Springer
Let A and B be strings with lengths m and n, respectively, over a finite integer alphabet. Two classic string mathing problems are computing the edit distance between A and B, and...
ISMIR
2000
Springer
13 years 8 months ago
2000
Springer
We present an efficient prototype for music information retrieval. The prototype uses bitparallel algorithms for locating transposition invariant matches of monophonic query melod...