E. Cambouropoulos et al. (1999). Algorithms for Computing Approximate Repetitions in Musical Sequences. In: Proceedings of the 10th Australasian Workshop on Combinatorial Algorithms (Perth, Australia), pp 129144. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Melodic Description Of Audio Signals For Music Content Processing - Gutiérrez (2002) (Correct)
....propose a distance measure algorithm that takes into account a set of mathematical transformations on melodic patterns, as inversion or symmetric transformations [18] Clausen et al. 28] and [31] propose algorithms to measure the similarity between melodies containing note gaps. Cambouropoulos [22, 20] and Rolland [96] also propose algorithms being Data fusion Measure similarity Multidimensional representation Measure similarity for each of the features Similarity Measure Musical Sequences (for the different features) Data Fusion to obtain a global similarity measure Figure 3.5: ....
E. Cambouropoulos, M. Chrochemore, S. C. Lliopoulos, L. Mouchard, and Y. J. Pinzon. Algorithms for computing approximate repetitions in musical sequences. In 10th Australasian Workshop On Combinatorial Algorithms, 1999. http://citeseer.nj.nec.com/cambouropoulos99algorithms.html.
Fast Algorithms for Subset Matching and Tree Pattern Matching - Cole, Hariharan, Indyk (Correct)
....entry x is replaced by the interval [x] and the text entry y is replaced by the interval [y z; y z] As observed by Indyk [12] Bounded Di erence Matching can be used to nd interesting patterns in time series data. This problem also arises in detecting melodic patterns in musical scores [7, 2]. Another measure capturing the notion of limited di erence is the Total Di erence; for two length m strings u and v this is de ned to be i=1 ju(i) v(i)j. It is not clear whether this can be computed in subquadratic time for each alignment of a pattern with a text. However, the similar Total ....
E. Cambouropoulos, M. Crochemore, C.S. Iliopoulos, L. Mouchard, Y.J. Pinzon. Algorithms for computing approximate repetitions in musical sequences. R. Raman and J. Simpson, editors, Proceedings of the 10th Australasian Workshop on Combinatorial Algorithms, 1999, pp. 129-144.
Approximate String Matching with Gaps - Crochemore, Iliopoulos, al. (2004) (6 citations) Self-citation (Crochemore Iliopoulos) (Correct)
No context found.
E. Cambouropoulos, M. Crochemore, C.S. Iliopoulos, L. Mouchard and Y. J. Pinzon. Algorithms for computing approximate repetitions in musical sequences. In Proc. of the 10 Australian Workshop on Combinatorial Algorithms, pp. 129-144, Perth, WA, Australia, 1999.
Approximate String Matching with Gaps - Crochemore, Makris, al. (2002) (6 citations) Self-citation (Crochemore) (Correct)
No context found.
E. Cambouropoulos, M. Crochemore, C.S. Iliopoulos, L. Mouchard and Y. J. Pinzon, "Algorithms for computing approximate repetitions in musical sequences", In Proceedings of the 10th Australian Workshop on Combinatorial Algorithms, pp. 129-144, Perth, WA, Australia, 1999
Bit-parallel (δ,γ)-Matching and Suffix.. - Crochemore.. Self-citation (Crochemore Iliopoulos Pinzon) (Correct)
No context found.
E. Cambouropoulos, M. Crochemore, C. S. Iliopoulos, L. Mouchard, and Y. J. Pinzon. Algorithms for computing approximate repetitions in musical sequences. Int. J. Comput. Math., 79(11):1135--1148, 2002. 19
Bit-parallel (δ,γ)-Matching and Suffix.. - Crochemore.. Self-citation (Crochemore Iliopoulos Pinzon) (Correct)
No context found.
E. Cambouropoulos, M. Crochemore, C. Iliopoulos, L. Mouchard, and Y. J. Pinzon. Algorithms for computing approximate repetitions in musical sequences. In Proc. 10th Australasian Workshop on Combinatorial Algorithms (AWOCA'99), pages 129--144, 1999.
Three Heuristics for δ-Matching: δ-BM.. - Crochemore.. (2002) Self-citation (Crochemore Iliopoulos) (Correct)
No context found.
E. Cambouropoulos, M. Crochemore, C. S. Iliopoulos, L. Mouchard and Y. J. Pinzon, Algorithms for computing approximate repetitions in musical sequences. In R. Raman and J. Simpson, editors, Proceedings of the 10th Australasian Workshop On Combinatorial Algorithms, Perth, WA, Australia, pp 129-144, 1999.
Approximate String Matching in Musical Sequences - Crochemore, Iliopoulos.. (2001) (5 citations) Self-citation (Crochemore Iliopoulos Pinzon) (Correct)
No context found.
E. Cambouropoulos, M. Crochemore, C. S. Iliopoulos, L. Mouchard, and Y. J. Pinzon. Algorithms for computing approximate repetitions in musical sequences. In R. Raman and J. Simpson, editors, Proceedings of the 10th Australasian Workshop On Combinatorial Algorithms, pages 129-144, Perth, WA, Australia, 1999.
Approximate String Matching with Gaps - Crochemore, Iliopoulos, Makris.. (2002) (6 citations) Self-citation (Crochemore Iliopoulos) (Correct)
No context found.
E. Cambouropoulos, M. Crochemore, C.S. Iliopoulos, L. Mouchard and Y. J. Pinzon. Algorithms for computing approximate repetitions in musical sequences. In Proc. of the 10 Australian Workshop on Combinatorial Algorithms, pp. 129-144, Perth, WA, Australia, 1999.
A Bit-parallel Suffix Automaton Approach for.. - Crochemore.. Self-citation (Crochemore Iliopoulos Pinzon) (Correct)
No context found.
E. Cambouropoulos, M. Crochemore, C. S. Iliopoulos, L. Mouchard, and Y. J. Pinzon. Algorithms for computing approximate repetitions in musical sequences. Int. J. Comput. Math., 79(11):1135-1148, 2002.
A Bit-parallel Suffix Automaton Approach for.. - Crochemore.. Self-citation (Crochemore Iliopoulos Pinzon) (Correct)
No context found.
E. Cambouropoulos, M. Crochemore, C. Iliopoulos, L. Mouchard, and Y. J. Pinzon. Algorithms for computing approximate repetitions in musical sequences. In Proc. 10th Australasian Workshop on Combinatorial Algorithms (AWOCA'99), pages 129-144, 1999.
On Special Families of Morphisms Related to.. - Cole, Iliopoulos, al. (2002) Self-citation (Iliopoulos) (Correct)
....motivated by applications in musical information retrieval, where the alphabet is an interval of integers (see [1,7] A match of a pattern P of length m in a text T is a position j in T such jP [i j 1] T [j] for 1 i m. Algorithms for solving this problem have been presented in [2,4,3]. We investigate relations between matching and pattern matching with don t care symbol (a symbol matching every symbol, including itself) We show a close correspondence between pattern matching with don t cares and matching. The matching is reducible to k instances of pattern matching with ....
E. Cambouropoulos, M. Crochemore, C. S. Iliopoulos, L. Mouchard and Y. J. Pinzon, Algorithms for computing approximate repetitions in musical sequences, in: R. Raman and J. Simpson, eds., Proceedings of the 10th Australasian Workshop On Combinatorial Algorithms (Perth, WA, Australia, 1999) 129-144.
Approximate String Matching in Musical Sequences - Crochemore, Iliopoulos.. (2001) (5 citations) Self-citation (Crochemore Iliopoulos Pinzon) (Correct)
.... patterns consisting of integers match if each corresponding integer di ers by not more than e.g. a C major f60; 64; 65; 67g and a C minor f60; 63; 65; 67g sequence can be matched if a tolerance = 1 is allowed in the matching process ( approximate matching is described in the next section) In [4], a number of ecient algorithms for approximate matching were presented (i.e. the Shift And algorithm and Shift Plus algorithm) The ShiftAnd algorithm is based on the O(1) time computation of di erent states for each symbol in the text. Hence the overall complexity is O(n) These algorithms use ....
....solution of this problem is to build an Aho Corasick automaton (see [1] of all strings that are approximate to p and then use the automaton to process t. The time required to build the automaton is O(j j ) thus this method is of no practical use as e.g we can have j j 180 and jj 10. In [4] an ecient algorithm was presented based on the O(1) time computation of the 3 delta states by using bit operations under the assumption that m w, where w is the number of bits in a machine word. Here we present an adaptation of the Tuned Boyer Moore for exact pattern matching algorithm to ....
[Article contains additional citation context not shown here]
E. Cambouropoulos, M. Crochemore, C. S. Iliopoulos, L. Mouchard, and Y. J. Pinzon. Algorithms for computing approximate repetitions in musical sequences. In R. Raman and J. Simpson, editors, Proceedings of the 10th Australasian Workshop On Combinatorial Algorithms, pages 129-144, Perth, WA, Australia, 1999.
Extracting 'Significant' Patterns from Musical Strings: Some.. - Cambouropoulos (2000) (1 citation) Self-citation (Cambouropoulos) (Correct)
.... 5] sequence can be matched if a tolerance d=1 is allowed in the matching process (the total sum of d tolerance allowed for a pattern match can be constrained by a further g tolerance parameter resulting in d g approximate matching) Efficient algorithms for solving these problems are presented in (Cambouropoulos et al., 1999). 3.2 Filling and Thinning of Patterns The above algorithm for d approximate matching accounts only for equal length patterns. A common technique of musical composition is filling and thinning of musical motivic and thematic material. That is, extra notes are added in a musical pattern (filling) ....
Cambouropoulos, E., Crochemore, M., Iliopoulos, C.S., Mouchard, L. and Pinzon, Y.J. (1999) Algorithms for Computing Approximate Repetitions in Musical Sequences. In Proceedings of the AWOCA'99 Workshop (Australasian Workshop on Combinatorial Algorithms), Perth.
Computing Approximate Repetitions in Musical Sequences - Iliopoulos, Lecroq.. (2000) (2 citations) Self-citation (Iliopoulos Mouchard Pinzon) (Correct)
No context found.
E. Cambouropoulos, M. Crochemore, C. S. Iliopoulos, L. Mouchard, and Y. J. Pinzon, Algorithms for computing approximate repetitions in musical sequences. In R. Raman and J. Simpson, editors, Proceedings of the 10th Australasian Workshop on Combinatorial Algorithms, pages 129-144, Perth, WA, Australia, 1999.
Discovering Structure and Repetition in Musical Audio - Van Steelant, De Baets.. (2002) (Correct)
No context found.
E. Cambouropoulos et al. (1999). Algorithms for Computing Approximate Repetitions in Musical Sequences. In: Proceedings of the 10th Australasian Workshop on Combinatorial Algorithms (Perth, Australia), pp 129144.
New Upper Bounds on Various String Manipulation Problems - Makris, Panagis.. (Correct)
No context found.
Cambouropoulos, E., Crochemore, M., Iliopoulos, C., S., Mouchard, L., Pinzon, Y.: Algorithms for computing approximate repetitions in musical sequences. In Proc. of the 10 Australian Workshop on Combinatorial Algorithms, pages 129--144, 1999.
Transposition Invariant String Matching - Mäkinen, Navarro, Ukkonen (2004) (Correct)
No context found.
E. Cambouropoulos, M. Crochemore, C.S. Iliopoulos, L. Mouchard, and Yoan J. Pinzon. Algorithms for computing approximate repetitions in musical sequences. In Proc. 10th Australian Workshop on Combinatorial Algorithms, AWOCA'99, R. Raman and J. Simpson, eds., Curtin University of Technology, Perth, Western Australia, pp. 129144, 1999.
Tree-structured Representation of Melodies for - Comparison And Retrieval (Correct)
No context found.
Cambouropoulos E., Crochemore M., Costas S., Iliopoulos, Mouchard L., Pinzon Y.J. Algorithms for Computing Approximate Repetitions in Musical Sequences (1999) Austrian Research Institute for Artificial Intelligence
Discovering Structure and Repetition in Musical Audio - Van Steelant, De Baets.. (2002) (Correct)
No context found.
E. Cambouropoulos et al. (1999). Algorithms for Computing Approximate Repetitions in Musical Sequences. In: Proceedings of the 10th Australasian Workshop on Combinatorial Algorithms (Perth, Australia), pp 129144.
Matching Numeric Strings under Noise - Mäkinen, Navarro, Ukkonen (Correct)
No context found.
E. Cambouropoulos, M. Crochemore, C.S. Iliopoulos, L. Mouchard, and Yoan J. Pinzn. Algorithms for computing approximate repetitions in musical sequences. In Proc. 10th Australian Workshop on Combinatorial Algorithms, AWOCA'99, R. Raman and J. Simpson, eds., Curtin University of Technology, Perth, Western Australia, pp. 129144, 1999.
Algorithms for Transposition Invariant String Matching - Mäkinen, Navarro, Ukkonen (2002) (Correct)
No context found.
E. Cambouropoulos, M. Crochemore, C.S. Iliopoulos, L. Mouchard, and Yoan J. Pinzn. Algorithms for computing approximate repetitions in musical sequences. In Proc. 10th Australian Workshop on Combinatorial Algorithms, AWOCA'99, R. Raman and J. Simpson, eds., Curtin University of Technology, Perth, Western Australia, pp. 129144, 1999.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC