Advertisement

Faster Algorithms for δ,γ-Matching and Related Problems

  • Peter Clifford
  • Raphaël Clifford
  • Costas Iliopoulos
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3537)

Abstract

We present new faster algorithms for the problems of δ and (δ, γ)-matching on numeric strings. In both cases the running time of the proposed algorithms is shown to be O(δn log m), where m is the pattern length, n is the text length and δ a given integer. Our approach makes use of Fourier transform methods and the running times are independent of the alphabet size. \(O(n\sqrt{m\log{m}})\) algorithms for the γ-matching and total-difference problems are also given. In all the above cases, we improve existing running time bounds in the literature.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Peter Clifford
    • 1
  • Raphaël Clifford
    • 2
  • Costas Iliopoulos
    • 2
  1. 1.Department of StatisticsOxfordUK
  2. 2.Algorithm Design Group, Department of Computer ScienceKing’s College LondonLondonUK

Personalised recommendations