Flexible and efficient bit-parallel techniques for transposition invariant approximate matching in music retrieval

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2857, Issue , 2003, Pages 224-237

  Lemström, Kjell ^a   Navarro, Gonzalo ^b  

^a UNIVERSITY OF HELSINKI   (Finland)

^b UNIVERSITY OF CHILE   (Chile)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

APPROXIMATE MATCHING; APPROXIMATE SEARCHING; APPROXIMATION MEASURE; COMBINATORIAL APPROACH; COMBINATORIAL PATTERN MATCHING; COMPLEX COMBINATORIAL PROBLEM; RECENT RESEARCHES; TRANSPOSITION INVARIANCE;

PATTERN MATCHING;

EID: 0142218938     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39984-1_17     Document Type: Article

References (17)

1. E. Cambouropoulos. A general pitch interval representation: Theory and applications. Journal of New Music Research, 25:231-251, 1996.
2. M. Crochemore, C. S. Iliopoulos, Y. J. Pinzon, and W. Rytter. Finding motifs with gaps. In First International Symposium on Music Information Retrieval (ISMIR'2000), Plymouth, MA, 2000.
3. M. Crochemore, C.S. Iliopoulos, G. Navarro, and Y. Pinzon. A bit-parallel suffix automaton approach for (δ,γ)-matching in music retrieval. To appear in Proc. SPIRE 2003.
4. M. Crochemore, C.S. Iliopoulos, Y.J. Pinzon, and J.F. Reid. A fast and practical bit-vector algorithm for the longest common subsequence problem. Information Processing Letters, 80(6):279-285, 2001.
5. M. Crochemore and W. Rytter. Text Algorithms. Oxford University Press, 1994.
6. M.J. Dovey. A technique for "regular expression" style searching in polyphonic music. In the 2nd Annual International Symposium on Music Information Retrieval (ISMIR'2001), pages 179-185, Bloomington, IND, October 2001.
7. J. Holub, C.S. Iliopoulos, and L. Mouchard. Distributed string matching using finite automata. Journal of Automata, Languages and Combinatorics, 6(2):191-204, 2001.
8. H. Hyyrö and G. Navarro. Faster bit-parallel approximate string matching. In Proc. 13th Annual Symposium on Combinatorial Pattern Matching (CPM 2002), pages 203-224, 2002. LNCS 2373.
9. K. Lemström and P. Laine. Musical information retrieval using musical parameters. In Proceedings of the 1998 International Computer Music Conference, pages 341-348, Ann Arbor, MI, 1998.
10. K. Lemström and J. Tarhio. Transposition invariant pattern matching for multitrack strings. Nordic Journal of Computing, 2003. (to appear).
11. K. Lemström and E. Ukkonen. Including interval encoding into edit distance based music comparison and retrieval. In Proceedings of the AISB'2000 Symposium on Creative & Cultural Aspects and Applications of AI & Cognitive Science, pages 53-60, Birmingham, April 2000.
12. D. Meredith, K. Lemström, and G.A. Wiggins. Algorithms for discovering repeated patterns in multidimensional representations of polyphonic music. Journal of New Music Research, 31(4):321-345, 2002.
13. MIDI Manufacturers Association, Los Angeles, California. The Complete Detailed MIDI 1.0 Specification, 1996.
14. G. Myers. A fast bit-vector algorithm for approximate string matching based on dynamic programming. Journal of the ACM, 46(3):395-415, 1999.
15. Earlier version in Proc. CPM'98, LNCS 1448.
16. W. Paul and J. Simon. Decision trees and random access machines. In Proc. Int'l. Symp. on Logic and Algorithmic, pages 331-340, Zurich, 1980.
17. G.A. Wiggins, K. Lemström, and D. Meredith. SIA(M): A family of efficient algorithms for translation-invariant pattern matching in multidimensional datasets. (submitted).