On minimizing pattern splitting in multi-track string matching
From MaRDI portal
Publication:2569400
DOI10.1016/j.jda.2004.08.008zbMath1080.68567MaRDI QIDQ2569400
Publication date: 27 October 2005
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2004.08.008
shortest paths; string matching; sparse dynamic programming; music retrieval; transposition invariance
Cites Work
- Approximate string matching with suffix automata
- Fast string matching with k differences
- An Improved Algorithm For Approximate String Matching
- On Minimizing Pattern Splitting in Multi-track String Matching
- Verifying candidate matches in sparse and wildcard matching
- Efficient string matching
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item