Bit-parallel (δ,γ)-matching and suffix automata

Journal of Discrete Algorithms

Volumn 3, Issue 2-4, 2005, Pages 198-214

  Crochemore, Maxime ^a,b   Iliopoulos, Costas S ^b   Navarro, Gonzalo ^c   Pinzon, Yoan J ^b,d   Salinger, Alejandro ^c  

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

^b KING'S COLLEGE LONDON   (United Kingdom)

^c UNIVERSITY OF CHILE   (Chile)

^d UNIVERSIDAD AUTÓNOMA DE BUCARAMANGA   (Colombia)

Author keywords

Approximate string matching; Bit parallelism; MIDI music retrieval

Indexed keywords

ALGORITHMS; COMPUTER MUSIC; FINITE AUTOMATA; INFORMATION RETRIEVAL; INTEGER PROGRAMMING; PARALLEL PROCESSING SYSTEMS; PROBLEM SOLVING;

APPROXIMATE STRING MATCHING; BIT-PARALLELISM; MIDI MUSIC RETRIEVAL; SUFFIX AUTOMATA;

PATTERN MATCHING;

EID: 18544368972     PISSN: 15708667     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jda.2004.08.005     Document Type: Conference Paper

References (23)

1. R. Baeza-Yates Text retrieval: Theory and practice 12th IFIP World Computer Congress, vol. I 1992 Elsevier Science 465 476
2. R. Baeza-Yates, and G. Gonnet A new approach to text searching Comm. ACM 35 10 1992 74 82
3. R. Baeza-Yates, and G. Gonnet Fast string matching with mismatches Inform. and Comput. 108 2 1994 187 199
4. R. Baeza-Yates, and G. Navarro Faster approximate string matching Algorithmica 23 2 1999 127 158
5. R.S. Boyer, and J.S. Moore A fast string searching algorithm Comm. ACM 20 10 1977 762 772
6. 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 1999 42 47
7. 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) 1999 129 144
8. E. Cambouropoulos, M. Crochemore, C.S. Iliopoulos, L. Mouchard, and Y.J. Pinzon Algorithms for computing approximate repetitions in musical sequences Internat. J. Comput. Math. 79 11 2002 1135 1148
9. T. Crawford, C. Iliopoulos, and R. Raman String matching techniques for musical similarity and melodic recognition Computing in Musicology 11 1998 73 100
10. M. Crochemore, C. Iliopoulos, T. Lecroq, Y.J. Pinzon, W. Plandowski, and W. Rytter Occurrence and substring heuristics for δ-matching Fundamenta Informaticae 55 2003 1 15
11. 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) Lecture Notes in Comput. Sci. vol. 2373 2002 178 189
12. M. Crochemore, and W. Rytter Text Algorithms 1994 Oxford University Press
13. A. Czumaj, M. Crochemore, L. Gasieniec, S. Jarominek, T. Lecroq, W. Plandowski, and W. Rytter Speeding up two string-matching algorithms Algorithmica 12 1994 247 267
14. K. Lemström, and G. Navarro Flexible and efficient bit-parallel techniques for transposition invariant approximate matching in music retrieval Proc. 10th Internat. Symp. on String Processing and Information Retrieval (SPIRE'03) Lecture Notes in Comput. Sci. vol. 2857 2003 224 237
15. P. McGettrick, MIDIMatch: Musical pattern matching in real time, MSc Dissertation, York University, UK, 1997
16. G. Navarro, and R. Baeza-Yates Improving an algorithm for approximate string matching Algorithmica 30 4 2001 473 502
17. G. Navarro, and M. Raffinot Fast and flexible string matching by combining bit-parallelism and suffix automata ACM J. Experimental Algorithmics (JEA) 5 4 2000
18. G. Navarro, and M. Raffinot Flexible Pattern Matching in Strings - Practical On-line Search Algorithms for Texts and Biological Sequences 2002 Cambridge University Press
19. P. Roland, and J. Ganascia Musical pattern extraction and similarity assessment E. Miranda Readings in Music and Artificial Intelligence 2000 Harwood Academic Publishers 115 144
20. L.A. Smith, E.F. Chiu, and B.L. Scott A speech interface for building musical score collections Proc. 5th ACM Conference on Digital Libraries 2000 ACM Press 165 173
21. D. Sunday A very fast substring searching algorithm Comm. ACM 33 8 1990 132 142
22. E. Ukkonen Approximate string matching over suffix trees Proc. 4th Ann. Symp. on Combinatorial Pattern Matching (CPM'93) 1993 228 242
23. S. Wu, and U. Manber Fast text searching allowing errors Comm. ACM 35 10 1992 83 91