Algorithms for computing approximate repetitions in musical sequences

International Journal of Computer Mathematics

Volumn 79, Issue 11, 2002, Pages 1135-1148

  Cambouropoulos, Emilios ^a   Crochemore, Maxime ^b   Iliopoulos, Costas S ^c,d   Mouchard, Laurent ^d,e   Pinzon, Yoan J ^c  

^a AUSTRIAN RESEARCH INSTITUTE FOR ARTIFICIAL INTELLIGENCE   (Austria)

^b Université de Marne la Vallée   (France)

^c KING'S COLLEGE LONDON   (United Kingdom)

^d CURTIN UNIVERSITY   (Australia)

^e UNIVERSITÉ DE ROUEN   (France)

Author keywords

Approximate string matching; Computer assisted music analysis; Dynamic programming; String algorithms

Indexed keywords

APPROXIMATE STRING MATCHING; COMPUTER ASSISTED MUSIC ANALYSIS; STRING ALGORITHMS;

APPROXIMATION THEORY; DYNAMIC PROGRAMMING;

ALGORITHMS;

EID: 18544387359     PISSN: 00207160     EISSN: 10290265     Source Type: Journal    
DOI: 10.1080/00207160213939     Document Type: Article

References (31)

1. Apostolico, A. and Preparata, F. P. (1983). Optimal off-line detection of repetitions in a string, Theoretical Computer Science, 22(3), 297-315.
2. Baeza-Yates, R. A. and Gonnet. G. H. (1992). A new approach to text searching, CACM, 35, 74-82.
3. Berkman, O., Iliopoulos, C. and Park, K. (1996). String covering, Information and Computation, 123, 127-137.
4. Cambouropoulos, E., Crawford, T. and Iliopoulos, C. S. (1999). Pattern processing in melodic sequences: challenges, caveats and prospects, in Proceedings of the AISB'99 Convention (Artificial Intelligence and Simulation of Behaviour), Edinburgh, U.K., pp. 42-47.
5. Cope, D. (1990). Pattern-matching as an engine for the computer simulation of musical style, in Proceedings of the International Computer Music Conference, Glasgow, pp. 288-291.
6. Crawford, T., Iliopoulos, C. S. and Raman, R. (1998). String matching techniques for musical similarity and melodic recognition. Computing in Musicology, 11, 73-100.
7. Crawford, T., Iliopoulos, C. S., Winder, R. and Yu, H. (1999). Approximate musical evolution, in Proceedings of the 1999 Artificial Intelligence and Simulation of Behaviour Symposium (AISB'99), G. Wiggins (Ed.), The Society for the Study of Artificial Intelligence and Simulation of Behaviour, Edinburgh, pp. 76-81.
8. Crochemore, M. (1981). An optimal algorithm for computing the repetitions in a word, Information Processing Letters, 12, 244-250.
9. Crochemore, M., Iliopoulos, C. S. and Yu, H. (1998). Algorithms for computing evolutionary chains in molecular and musical sequences, Proceedings of the 9th Australasian Workshop on Combinatorial Algorithms. 6, 172-185.
10. Czumaj, A., Ferragina, P., Gasieniec, E., Muthukrishnan, S. and Traeff, J. The architecture of a software library for string processing, presented at Workshop on Algorithm Engineering, Venice, September 1997.
11. Fischetti, V., Landau, G., Schmidt, J. and Sellers, P. (1992). Identifying periodic occurences of a template with applications to protein structure, Proc. 3rd Combinatorial Pattern Matching, Lecture Notes in Computer Science, 644, 111-120.
12. Galil, Z. and Park, K. (1990). An improved algorithm for approximate string matching, SIAM Journal on Computing, 29, 989-999.
13. Iliopoulos, C. S. and Mouchard, E. (1999). An O(n log n) algorithm for computing all maximal quasiperiodi cities in strings, in Proceedings of CATS'99: "Computing: Australasian Theory Symposium", Auckland, New Zealand, Lecture Notes in Computer Science, Springer Verlag, 21(3), 262-272.
14. Iliopoulos, C. S., Moore, D. W. G. and Park, K. (1996). Covering a string, Algorithmica, 16, 288-297.
15. Iliopoulos, C. S., Moore, D. W. G. and Smyth, W. F. (1996). A linear algorithm for computing the squares of a Fibonacci string, in Proceedings CATS'96, "Computing: Australasian Theory Symposium", P. Eades and M. Moule (Eds), University of Melbourne, pp. 55-63.
16. Iliopoulos, C. S. and Pinzon, Y. J. An O(n log n) algorithm for computing squares in musical sequences, in preparation.
17. Karlin, S., Morris, M., Ghandour, G. and Leung, M.-Y. (1998). Efficients algorithms for molecular sequences analysis, Proc. Natl. Acad. Sci., USA, 85, 841-845.
18. Landau, G. M. and Schmidt, J. P. (1993). An algorithm for approximate tandem repeats, in Proc. Fourth Symposium on Combinatorial Pattern Matching, Springer-Verlag Lecture Notes in Computer Science 648, 120-133.
19. Landau, G. M. and Vishkin, U. (1988). Introducing efficient parallelism into approximate string matching and a new serial algorithm, in Proc. Annual ACM Symposium on Theory of Computing, ACM Press, pp. 220-230, 1986.
20. Landau, G. M. and Vishkin, U. (1988). Fast string matching with k differences, Journal of Computer and Systems Sciences, 37, 63-78.
21. Main, G. and Lorentz, R. (1984). An O(nlogn) algorithm for finding all repetitions in a string, Journal of Algorithms, 5, 422-432.
22. Mongeau, M. and Sankoff, D. (1990). Comparison of musical sequences, Computers and the Humanities, 24, 161-175.
23. McGettrick, P. (1997). MIDIMatch: musical pattern matching in real iime. MSc Dissertation, York University, UK.
24. Milosavljevic, A. and Jurka, J. (1993). Discovering simple DNA sequences by the algorithmic significance method, Comput. Appl. Biosci., 9, 407-411.
25. Moore, D. W. G. and Smyth, W. F. (1994). Computing the covers of a string in linear time, in Proc. 5th ACM-SIAM Symposium on Discrete Algorithms, 511-515.
26. Myers, E. W. and Kannan, S. K. (1993). An algorithm for locating non-overlapping regions of maximum alignment score, in Proc. Fourth Symposium on Combinatorial Pattern Matching, Springer-Verlag Lecture Notes in Computer Science 648, 74-86.
27. Pevzner, P. A. and Feldman, W. (1993). Gray code masks for DNA sequencing by hybridization, Genomics, 23, 233-235.
28. Rolland, P. Y. and Ganascia, J. G. (1999). Musical pattern extraction and similarity assessment, in Readings in Music and Artificial Intelligence, E. Miranda (Ed.), Harwood Academic Publishers (forthcoming).
29. Schmidt, J. P. (1994). All shortest paths in weighted grid graphs and its application to finding all approximate repeats in strings, in Proc. of the Fifth Symposium on Combinatorial Pattern Matching CPM'94, Lecture Notes in Computer Science.
30. Skiena, S. S. and Sundaram, G. (1995). Reconstructing strings from substrings, J. Computational Biol., 2, 333-353.
31. Wu, S. and Manber, U. (1992). Fast text searching allowing errors, CACM, 35, 83-91.