Name
Abstract | ||
|---|---|---|
This paper proposes an efficient pattern extraction algorithm that can be applied on melodic sequences that are represented as strings of abstract intervallic symbols; the melodic representation introduces special ''binary don't care'' symbols for intervals that may belong to two partially overlapping intervallic categories. As a special case the well established ''step-leap'' representation is examined. In the step-leap representation, each melodic diatonic interval is classified as a step (+/-s), a leap (+/-l) or a unison (u). Binary don't care symbols are used to represent the possible overlapping between the various abstract categories e.g. *=s, *=l and #=-s, #=-l. We propose an O(n+d(n-d)+z)-time algorithm for computing all maximal-pairs in a given sequence x=x[1..n], where x contains d occurrences of binary don't cares and z is the number of reported maximal-pairs. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1016/j.ins.2006.11.012 | Inf. Sci. |
Keywords | Field | DocType |
special case,melodic diatonic interval,abstract intervallic symbol,melodic sequence,melodic representation,combinatorial algorithm,repetitions,step-leap representation,lowest common ancestor,reported maximal-pairs,string,suffix tree,maximal-pair,time algorithm,efficient pattern extraction algorithm,overlapping intervallic category,don't care,music retrieval | Melody,Discrete mathematics,Lowest common ancestor,Diatonic scale,Extraction algorithm,Unison,Suffix tree,Mathematics,Binary number,Special case | Journal |
Volume | Issue | ISSN |
177 | 9 | 0020-0255 |
Citations | PageRank | References |
3 | 0.42 | 18 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Emilios Cambouropoulos | 1 | 200 | 25.12 |
| Maxime Crochemore | 2 | 2655 | 281.75 |
| Costas S. Iliopoulos | 3 | 1534 | 167.43 |
| Manal Mohamed | 4 | 102 | 12.62 |
| Marie-France Sagot | 5 | 1337 | 109.23 |