R. Baeza-yates, Text retrieval: Theory and practice, 12th IFIP World Computer Congress, pp.465-476, 1992.

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. Baeza-yates and G. Gonnet, Fast String Matching with Mismatches, Information and Computation, vol.108, issue.2, pp.187-199, 1994.
DOI : 10.1006/inco.1994.1007

R. Baeza-yates and G. Navarro, Faster approximate string matching

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. Iliopoulos, Pattern processing in melodic sequences: Challenges, caveats and prospects, Proc. Artificial Intelligence and Simulation of Behaviour (AISB'99) Convention, pp.42-47, 1999.

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

E. Cambouropoulos, M. Crochemore, C. S. Iliopoulos, L. Mouchard, and Y. J. Pinzon, Algorithms For Computing Approximate Repetitions In Musical Sequences, International Journal of Computer Mathematics, vol.23, issue.11, pp.1135-1148, 2002.
DOI : 10.1145/135239.135244
URL : https://hal.archives-ouvertes.fr/hal-00465090

T. Crawford, C. Iliopoulos, and R. Raman, String matching techniques for musical similarity and melodic recognition, Computing in Musicology, vol.11, pp.73-100, 1998.

M. Crochemore, C. Iliopoulos, T. Lecroq, Y. J. Pinzon, W. Plandowski et al., Occurence and substring heuristics for ?-matching, Fundamenta Informaticae, vol.55, pp.1-15, 2003.

M. Crochemore, C. Iliopoulos, T. Lecroq, W. Plandowski, and W. Rytter, Three Heuristics for ??-Matching: ??-BM Algorithms, Proc. 13th Ann. Symp. on Combinatorial Pattern Matching (CPM'02), LNCS v. 2373, pp.178-189, 2002.
DOI : 10.1007/3-540-45452-7_16
URL : https://hal.archives-ouvertes.fr/hal-00619982

M. Crochemore, C. Iliopoulos, G. Navarro, and Y. Pinzon, A Bit-Parallel Suffix Automaton Approach for (??,??)-Matching in Music Retrieval, Proc. 10th Intl. Symp. on String Processing and Information Retrieval (SPIRE'03), 2003.
DOI : 10.1007/978-3-540-39984-1_16
URL : https://hal.archives-ouvertes.fr/hal-00619985

M. Crochemore and W. Rytter, Text algorithms, 1994.
URL : https://hal.archives-ouvertes.fr/hal-00619796

A. Czumaj, M. Crochemore, L. Gasieniec, S. Jarominek, T. Lecroq et al., Speeding up two string-matching algorithms, Algorithmica, vol.12, pp.247-267, 1994.
URL : https://hal.archives-ouvertes.fr/hal-00619553

K. Lemström and G. Navarro, Flexible and Efficient Bit-Parallel Techniques for Transposition Invariant Approximate Matching in Music Retrieval, Proc. 10th Intl. Symp. on String Processing and Information Retrieval (SPIRE'03), 2003.
DOI : 10.1007/978-3-540-39984-1_17

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

G. Navarro and R. Baeza-yates, Improving an Algorithm for Approximate Pattern Matching, Algorithmica, vol.30, issue.4, pp.473-502, 2001.
DOI : 10.1007/s00453-001-0034-6

G. Navarro and M. Raffinot, Fast and flexible string matching by combining bitparallelism and suffix automata, ACM Journal of Experimental Algorithmics (JEA), vol.5, issue.4, 2000.

G. Navarro and M. Raffinot, Flexible Pattern Matching in Strings ? Practical on-line search algorithms for texts and biological sequences, 2002.

P. Roland and J. Ganascia, Musical pattern extraction and similarity assessment, Music and Artificial Intelligence, pp.115-144, 2000.

L. A. Smith, E. F. Chiu, and B. L. Scott, A speech interface for building musical score collections, Proceedings of the fifth ACM conference on Digital libraries , DL '00, pp.165-173, 2000.
DOI : 10.1145/336597.336657

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

E. Ukkonen, Approximate string-matching over suffix trees, Proc. 4th Ann. Symp. on Combinatorial Pattern Matching (CPM'93), pp.228-242, 1993.
DOI : 10.1007/BFb0029808
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.141.5074

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