Approximate String Matching with Gaps

In this paper we consider several new versions of approximate string matching with gaps. The main characteristic of these new versions is the existence of gaps in the matching of a given pattern in a text. Algorithms are devised for each version and their time and space complexities are stated. These specific versions of approximate string matching have various applications in computerized music analysis.

[1]  P. Pevzner,et al.  Gray code masks for sequencing by hybridization. , 1994, Genomics.

[2]  Gad M. Landau,et al.  Identifying Periodic Occurrences of a Template with Applications to Protein Structures , 1992, CPM.

[3]  Thierry Lecroq,et al.  A Very Fast String Matching Algorithm for Small Alphabeths and Long Patterns (Extended Abstract) , 1998, CPM.

[4]  Aleksandar Milosavljevic,et al.  Discovering simple DNA sequences by the algorithmic significance method , 1993, Comput. Appl. Biosci..

[5]  Jean-Gabriel Ganascia,et al.  Musical Pattern Extraction and Similarity Assessment , 2000, Readings in Music and Artificial Intelligence.

[6]  Maxime Crochemore,et al.  Approximate String Matching in Musical Sequences , 2001, Stringology.

[7]  Vincent A. Fischetti,et al.  Identifying Periodic Occurrences of a Template with Applications to Protein Structure , 1993, Inf. Process. Lett..

[8]  Dimitrios Gunopulos,et al.  Episode Matching , 1997, CPM.

[9]  S Karlin,et al.  Efficient algorithms for molecular sequence analysis. , 1988, Proceedings of the National Academy of Sciences of the United States of America.

[10]  Andrew Hume,et al.  Fast string searching , 1991, USENIX Summer.

[11]  Robert E. Tarjan,et al.  Deques with Heap Order , 1986, Inf. Process. Lett..

[12]  Matthew J. Dovey.  A Technique for Regular Expression Style Searching in Polyphonic Music , 2001, ISMIR.

[13]  Steven Skiena,et al.  Reconstructing Strings from Substrings , 1995, J. Comput. Biol..

[14]  Graham A. Stephen.  String Searching Algorithms , 1994, Lecture Notes Series on Computing.

[15]  Jeanette P. Schmidt.  All shortest paths in weighted grid graphs and its application to finding all approximate repeats in strings , 1995, Proceedings Third Israel Symposium on the Theory of Computing and Systems.

[16]  Maxime Crochemore,et al.  Algorithms For Computing Approximate Repetitions In Musical Sequences , 2002, Int. J. Comput. Math..

[17]  Esko Ukkonen,et al.  Finding Approximate Patterns in Strings , 1985, J. Algorithms.

[18]  Costas S. Iliopoulos,et al.  Pattern Processing in Melodic Sequences: Challenges, Caveats and Prospects , 2001, Comput. Humanit..

[19]  Maxime Crochemore,et al.  Finding Motifs with Gaps , 2000, ISMIR.

[20]  Rajeev Raman,et al.  String-Matching techniques for musical similarity and melodic recognition , 1998 .

[21]  Daniel S. Hirschberg,et al.  A linear space algorithm for computing maximal common subsequences , 1975, Commun. ACM.