FLEXIBLE MUSIC RETRIEVAL IN SUBLINEAR TIME
From MaRDI portal
Publication:3421849
DOI10.1142/S0129054106004455zbMath1169.68390MaRDI QIDQ3421849
Veli Mäkinen, Kimmo Fredriksson, Gonzalo Navarro
Publication date: 8 February 2007
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
approximate string matching; music retrieval; transposition invariance; \((\delta; \gamma )\)-matching
Related Items
Average-optimal string matching, On building minimal automaton for subset matching queries, Rotation and lighting invariant template matching
Cites Work
- Unnamed Item
- On special families of morphisms related to \(\delta \)-matching and don't care symbols
- A fast and practical bit-vector algorithm for the longest common subsequence problem
- Average complexity of exact and approximate multiple string matching
- Efficient 2-dimensional approximate matching of half-rectangular figures
- Bit-parallel (\(\delta ,\gamma\))-matching and suffix automata
- Practical algorithms for transposition-invariant string-matching
- A fast string searching algorithm
- The Complexity of Pattern Matching for a Random String
- Algorithms on Strings, Trees and Sequences
- New and faster filters for multiple approximate string matching
- Transposition invariant string matching