Computing evolutionary chains in musical sequences

Electronic Journal of Combinatorics

Volumn 8, Issue 2 R, 2001, Pages 1-16

  Crochemore, Maxime ^a   Iliopoulos, Costas S ^b   Pinzon, Yoan J ^b  

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

^b KING'S COLLEGE LONDON   (United Kingdom)

Author keywords

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

Indexed keywords

EID: 4043120313     PISSN: 10778926     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (16)

1. A. Apostolico and F. P. Preparata, Optimal Off-line Detection of Repetitions in a String, Theoretical Computer Science, 22 3, pp. 297-315 (1983).
2. E. Cambouropoulos, A General Pitch Interval Representation: Theory and Applications, Journal of New Music Research 25, pp. 231-251 (1996).
3. E. Cambouropoulos, T. Crawford and C.S. Iliopoulos, (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 (1999).
4. T. Crawford, C. S. Iliopoulos, R. Raman, String Matching Techniques for Musical Similarity and Melodic Recognition, Computing in Musicology, Vol 11, pp. 73-100 (1998).
5. T. Crawford, C. S. Iliopoulos, R. Winder, H. Yu, Approximate musical evolution, in the 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 (1999).
6. M. Crochemore, An optimal algorithm for computing the repetitions in a word, Information Processing Letters 12, pp. 244-250 (1981).
7. M. Crochemore, C.S. Iliopoulos and H. Yu, Algorithms for computing evolutionary chains in molecular and musical sequences, Proceedings of the 9-th Australasian Workshop on Combinatorial Algorithms Vol 6, pp. 172-185 (1998).
8. V. Fischetti, G. Landau, J.Schmidt and P. Sellers, Identifying periodic occurences of a template with applications to protein structure, Proc. 3rd Combinatorial Pattern Matching, Lecture Notes in Computer Science, vol. 644, pp. 111-120 (1992).
9. C. S. Iliopoulos and L. Mouchard, An O(n log n) algorithm for computing all maximal quasiperiodicities in strings, Proceedings of CATS'99: "Computing: Australasian Theory Symposium", Auckland, New Zealand, Lecture Notes in Computer Science, Springer Verlag, Vol 21 3, pp. 262-272 (1999).
10. C. S. Iliopoulos, D. W. G. Moore and K. Park, Covering a string, Algorithmica 16, pp. 288-297 (1996).
11. C. S. Iliopoulos and Y.J. Pinzon, The Max-Shift Algorithm, submitted.
12. G. M. Landau and U. Vishkin, Fast parallel and serial approximate string matching, in Journal of Algorithms 10, pp. 157-169 (1989).
13. G. M. Landau and J. P. Schmidt, An algorithm for approximate tandem repeats, in Proc. Fourth Symposium on Combinatorial Pattern Matching, Springer-Verlag Lecture Notes in Computer Science 648, pp. 120-133 (1993).
14. G. M. Landau and U. Vishkin, 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).
15. G. Main and R. Lorentz, An O(n log n) algorithm for finding all repetitions in a string, Journal of Algorithms 5, pp. 422-432 (1984).
16. E. W. Myers , A Fast Bit-Vector Algorithm for Approximate String Matching Based on Dynamic Progamming, in Journal of the ACM 46 3, pp. 395-415 (1999).