The Prague Stringology Conference 2005

Kimmo Fredriksson, Veli Makinen and Gonzalo Navarro

Flexible Music Retrieval in Sublinear Time

Music sequences can be treated as texts in order to perform music retrieval tasks on them. However, the text search problems that result from this modeling are unique to music retrieval. Up to date, several approaches derived from classical string matching have been proposed to cope with the new search problems, yet each problem had its own algorithms. In this paper we show that a technique recently developed for multipattern approximate string matching is flexible enough to be successfully extended to solve many different music retrieval problems, as well as combinations thereof not addressed before. We show that the resulting algorithms are close to optimal and much better than existing approaches in many practical cases.

Download paper: Article in PostScript Article in PDF
 PostScript   PDF