Algorithms on strings, trees, and sequences: computer science and computational biology
Algorithms on strings, trees, and sequences: computer science and computational biology
The String-to-String Correction Problem
Journal of the ACM (JACM)
Robust Polyphonic Music Retrieval with N-grams
Journal of Intelligent Information Systems
Searching notated polyphonic music using transportation distances
Proceedings of the 12th annual ACM international conference on Multimedia
An alignment based system for chord sequence retrieval
Proceedings of the 9th ACM/IEEE-CS joint conference on Digital libraries
Toward a General Framework for Polyphonic Comparison
Fundamenta Informaticae - Special Issue on Stringology
Comparing approaches to the similarity of musical chord sequences
CMMR'10 Proceedings of the 7th international conference on Exploring music contents
Polyphonic alignment algorithms for symbolic music retrieval
CMMR/ICAD'09 Proceedings of the 6th international conference on Auditory Display
Toward a General Framework for Polyphonic Comparison
Fundamenta Informaticae - Special Issue on Stringology
Hi-index | 0.00 |
Music retrieval systems based on melodic similarity consider sequences of notes. Adaptations of edit-based algorithms, mainly applied in bioinformatic applications, to the musical domain lead to promising results. However, new problems are raised when considering polyphonic music. Existing representations of notes do not allow retrieval systems to be transposition invariant. In this article, we propose a new dynamic programming algorithm that permits to take into account multiple local transpositions. Experiments with MIREX collections have been performed to evaluate the improvements induced by this algorithm. The results clearly show the contribution of this algorithm: it is confirmed as the most accurate solution for a music retrieval system based on alignment algorithm to be transposition invariant.