Faster algorithms for δ,γ-matching and related problems

Lecture Notes in Computer Science

Volumn 3537, Issue , 2005, Pages 68-78

  Clifford, Peter ^a   Clifford, Raphaël ^b   Iliopoulos, Costas ^b  

^a Department of Statistics ^*  (United Kingdom)

^b KING'S COLLEGE LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

PATTERN MATCHING; PROBLEM SOLVING; TEXT PROCESSING;

ALPHABET SIZE; NUMERIC STRINGS; TEXT LENGTH;

ALGORITHMS;

EID: 26444498577     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11496656_7     Document Type: Conference Paper

References (17)

1. K. Abrahamson. Generalized string matching. SIAM journal on Computing, 16(6):1039-1051, 1987.
2. A. Amir. Private communication. 2004.
3. A. Amir and M. Farach. Efficient 2-dimensional approximate matching of half-rectangular figures. Information and Computation, 118(1): 1-11, 1995.
4. A. Amir, O. Lipsky, E. Porat, and J. Umanski. Approximate matching in the L\ metric. In Proceedings of the 16th Annual Symposium on Combinatorial Pattern Matching (CPM'05). Springer, 2005. This volume.
5. E. Cambouropoulos, M. Crochemore, C. S. Iliopoulos, L. Mouchard, and Y. J. Pinzon. Computing approximate repetitions in musical sequences. International Journal of Computer Mathematics, 79(11):1135-1148, 2002.
6. R. Clifford, T. Crawford, C. Iliopoulos, and D. Meredith. String matching techniques for music analysis. In String Algorithmics, NATO book series. KCL Press, 2004.
7. R. Cole and R. Hariharan. Verifying candidate matches in sparse and wildcard matching. In Proceedings of the Annual ACM Symposium on Theory of Computing, pages 592-601, 2002.
8. R. Cole, R. Hariharan, and P. Indyk. Fast algorithms for subset matching and tree pattern matching. Preprint.
9. R. Cole, C. Iliopoulos, T. Lecroq, W. Plandowski, and W. Rytter. On special families of morphisms related to δ-matching and don't care symbols. Information Processing Letters, 85(5):227-233, 2003.
10. D. Cope. Pattern-matching as an engine for the computer simulation of musical style. In Proceedings of the International Computer Music Conference, pages 288-291, 1990.
11. T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. MIT Press, 1990.
12. T. Crawford, C. S. Iliopoulos, and R. Raman. String-matching techniques for musical similarity and melodic recognition. In Computing in Musicology, volume 11, pages 73-100. MIT-Press, 1998.
13. M. Fischer and M. Paterson. String matching and other products. In R. Karp, editor, Proceedings of the 7th SIAM-AMS Complexity of Computation, pages 113-125, 1974.
14. P. Indyk, M. Lewenstein, O. Lipsky, and E. Porat. Closest pair problems in very high dimensions. In Automata, Languages and Programming: 31st International Colloquium, ICALP 2004, pages 782-792, Turku, Finland, July 2004.
15. E. Porat. Private communication. 2004.
16. P. Y. Rolland and J. G. Ganascia. Musical pattern extraction and similarity assessment. In E. Miranda, editor, Readings in Music and Artificial Intelligence, pages 115-144. Harwood Academic Publishers, 2000.
17. J. C. Schatzman. Accuracy of the discrete Fourier transform and the fast Fourier transform. SIAM Journal of Scientific Computing, 17(5):1150-1166, 1996.