10 search results - page 1 / 2 » Music Matching Based on Rough Longest Common Subsequence |
JISE
2011
13 years 17 days ago
2011
DIS
2006
Springer
13 years 9 months ago
2006
Springer
This paper introduces a new family of string classifiers based on local relatedness. We use three types of local relatedness measurements, namely, longest common substrings (LCStr&...
TASLP
2008
13 years 5 months ago
2008
Finding a piece of music based on its content is a key problem in music information retrieval. For example, a user may be interested in finding music based on knowledge of only a s...
CIBCB
2007
IEEE
13 years 12 months ago
2007
IEEE
—DNA matching is a crucial step in sequence alignment. Since sequence alignment is an approximate matching process there is a need for good approximate algorithms. The process of...
SPIRE
2001
Springer
13 years 10 months ago
2001
Springer
Two algorithms are presented that solve the problem of recovering the longest common subsequence of two strings. The £rst algorithm is an improvement of Hirschberg’s divide-andc...