A. V. Aho and M. J. Corasick, Efficient string matching: an aid to bibliographic search, Communications of the ACM, vol.18, issue.6, pp.333-340, 1975.
DOI : 10.1145/360825.360855

S. F. Altschul, W. Gish, W. Miller, E. W. Myers, and D. J. Lipman, Basic local alignment search tool, Journal of Molecular Biology, vol.215, issue.3, pp.403-410, 1990.
DOI : 10.1016/S0022-2836(05)80360-2

R. Baeza-yates and G. Gonnet, A new approach to text searching, Communications of the ACM, vol.35, issue.10, pp.74-82, 1992.
DOI : 10.1145/135239.135243

R. S. Boyer and J. S. Moore, A fast string searching algorithm, Communications of the ACM, vol.20, issue.10, pp.762-772, 1977.
DOI : 10.1145/359842.359859

E. Cambouropoulos, T. Crawford, and C. S. Iliopoulos, Pattern Processing in Melodic Sequences: Challenges, Caveats and Prospects, Proc. of the AISB'99 Convention, pp.42-47, 1999.

E. Cambouropoulos, M. Crochemore, C. S. Iliopoulos, L. Mouchard, and Y. J. Pinzon, Algorithms For Computing Approximate Repetitions In Musical Sequences, Proc. 10th Australasian Workshop On Combinatorial Algorithms, pp.129-144, 1999.
DOI : 10.1145/135239.135244
URL : https://hal.archives-ouvertes.fr/hal-00465090

C. Charras, T. Lecroq, and J. D. Pehoushek, A very fast string matching algorithm for small alphabets and long patterns, Proc. 9th Annual Symposium on Combinatorial Pattern Matching (M. Farach-Colton Piscataway, NJ, pp.55-64, 1998.
DOI : 10.1007/BFb0030780

T. Crawford, C. S. Iliopoulos, and R. Raman, String Matching Techniques for Musical Similarity and Melodic Recognition, Computing in Musicology, vol.11, pp.73-100, 1998.

M. Crochemore, A. Czumaj, L. Ga¸sieniecga¸sieniec, S. Jarominek, T. Lecroq et al., Speeding up two string-matching algorithms, Algorithmica, vol.8, issue.11, pp.247-267, 1994.
DOI : 10.1007/BF01185427
URL : https://hal.archives-ouvertes.fr/hal-00619553

M. Crochemore, C. S. Iliopoulos, T. Lecroq, and Y. J. Pinzon, Approximate string matching in musical sequences, Proc. Prague Stringology Conference'01 Prague, Tcheque Republic, pp.2001-2007, 2001.
URL : https://hal.archives-ouvertes.fr/hal-00619981

V. A. Fischetti, G. M. Landau, J. P. Schmidt, and P. H. Sellers, Identifying periodic occurrences of a template with applications to protein structure, Proc. 3rd Annual Symposium on Combinatorial Pattern Matching, pp.111-120, 1992.
DOI : 10.1007/3-540-56024-6_9

E. Fredkin, Trie memory, Communications of the ACM, vol.3, issue.9, pp.490-499, 1960.
DOI : 10.1145/367390.367400

A. Hume and D. M. Sunday, Fast string searching, Software?Practice and Experience, pp.1221-1248, 1991.

S. Karlin, M. Morris, G. Ghandour, and M. Leung, Efficient algorithms for molecular sequence analysis., Proc. Natl. Acad. Sci. USA, pp.841-845, 1988.
DOI : 10.1073/pnas.85.3.841

P. Mcgettrick, MIDIMatch: Musical Pattern Matching in Real Time, 1997.

A. Milosavljevic and J. Jurka, Discovering simple DNA sequences by the algorithmic significance method, Bioinformatics, vol.9, issue.4, pp.407-411, 1993.
DOI : 10.1093/bioinformatics/9.4.407

P. A. Pevzner and W. Feldman, Gray Code Masks for DNA Sequencing by Hybridization, Genomics, vol.23, pp.233-235, 1993.

P. Rolland and J. Ganascia, Musical Pattern Extraction and Similarity Assessment, Music and Artifi cial Intelligence, pp.115-144, 2000.

J. P. Schmidt, All shortest paths in weighted grid graphs and its application to finding all approximate repeats in strings, Proceedings Third Israel Symposium on the Theory of Computing and Systems, pp.972-992, 1998.
DOI : 10.1109/ISTCS.1995.377044

S. S. Skiena and G. Sundaram, Reconstructing Strings from Substrings, Journal of Computational Biology, vol.2, issue.2, pp.333-353, 1995.
DOI : 10.1089/cmb.1995.2.333

D. M. Sunday, A very fast substring search algorithm, Communications of the ACM, vol.33, issue.8, pp.132-142, 1990.
DOI : 10.1145/79173.79184

S. Wu and U. Manber, Fast text searching: allowing errors, Communications of the ACM, vol.35, issue.10, pp.83-91, 1992.
DOI : 10.1145/135239.135244