Algorithms For Computing Approximate Repetitions In Musical Sequences

References

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