Name
Title | ||
|---|---|---|
A Pattern Extraction Algorithm for Abstract Melodic Representations that Allow Partial Overlapping of Intervallic Categories |
Abstract | ||
|---|---|---|
This paper proposes an efficient pattern extraction al- gorithm that can be applied on melodic sequences that are represented as strings of abstract intervallic symbols ; the melodic representation introduces special "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 in- terval is classified as a step (±s), a leap (±l) or a unison (u). Binary don't care symbols are introduced to repre- sent the possible overlapping between the various abstract categories e.g. � = s, � = l and # = s, # = l. For such a sequence, we are interested in finding maximal repeating pairs and repetitions with a hole (two matching subsequences separated with an intervening non-matching symbol). We propose an O(n + d(n d) + z)-time al- gorithm for computing all such repetitions in a given se- quence x = x(1..n) with d binary don't care symbols, where z is the output size. |
Year | Venue | Keywords |
|---|---|---|
2005 | ISMIR 2013 | string,suffix tree,lowest common ancestor.,don't care,repetitions,lowest common ancestor |
Field | DocType | Citations |
Melody,Combinatorics,Lowest common ancestor,Diatonic scale,Extraction algorithm,Symbol,Unison,Arithmetic,Speech recognition,Mathematics,Special case,Binary number | Conference | 7 |
PageRank | References | Authors |
0.65 | 9 | 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 |