Skip to main content
SpringerLink
Log in

Approximate Function Matching under δ- and γ- Distances

  • Conference paper
String Processing and Information Retrieval (SPIRE 2012)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7608))

Included in the following conference series:

Abstract

This paper defines a new string matching problem by combining two paradigms: function matching and δγ-matching. The result is an approximate variant of function matching where two equal-length strings X and Y match if there exists a function that maps X to a string X′ such that X′ and Y are δγ- similar. We propose an O(nm) algorithm for finding all the matches of a pattern P 1 …m in a text T 1 …n .

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Amir, A., Aumann, Y., Cole, R., Lewenstein, M., Porat, E.: Function Matching: Algorithms, Applications, and a Lower Bound. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 929–942. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  2. Amir, A., Farach, M., Muthukrishnan, S.: Alphabet dependence in parameterized matching. Information Processing Letters 49(3), 111–115 (1994)

    Article  MATH  Google Scholar 

  3. Amir, A., Nor, I.: Generalized function matching. Journal of Discrete Algorithms 5(3), 514–523 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  4. Apostolico, A., Galil, Z.: Pattern matching algorithms. Oxford University Press, USA (1997)

    Book  MATH  Google Scholar 

  5. Baker, B.S.: A theory of parameterized pattern matching: algorithms and applications. In: Proc. 25th Annual Symposium on Theory of Computing (1993)

    Google Scholar 

  6. Baker, B.S.: Parameterized pattern matching by Boyer-Moore-type algorithms. In: Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, p. 550. Society for Industrial and Applied Mathematics (1995)

    Google Scholar 

  7. Cantone, D., Cristofaro, S., Faro, S.: Efficient Algorithms for the δ-Approximate String Matching Problem in Musical Sequences. In: Proc. of the Prague Stringology Conference (2004)

    Google Scholar 

  8. Clifford, R., Harrow, A.W., Popa, A., Sach, B.: Generalised Matching. In: Karlgren, J., Tarhio, J., Hyyrö, H. (eds.) SPIRE 2009. LNCS, vol. 5721, pp. 295–301. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  9. Clifford, R., Sach, B.: Permuted function matching. Information Processing Letters 110(22), 1012–1015 (2010)

    Article  MathSciNet  Google Scholar 

  10. Crochemore, M., Iliopoulos, C.S., Lecroq, T., Pinzon, Y.J., Plandowski, W., Rytter, W.: Occurrence and Substring Heuristics for d-Matching. Fundamenta Informaticae 56(1), 1–21 (2003)

    MathSciNet  MATH  Google Scholar 

  11. Crochemore, M., Iliopoulos, C.S., Lecroq, T., Plandowski, W., Rytter, W.: Three Heuristics for δ-Matching: δ-BM Algorithms. In: Apostolico, A., Takeda, M. (eds.) CPM 2002. LNCS, vol. 2373, pp. 178–189. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  12. Crochemore, M., Iliopoulos, C.S., Navarro, G., Pinzon, Y.J., Salinger, A.: Bit-parallel (δ, γ)-Matching and Suffix Automata. Journal of Discrete Algorithms 3(2-4), 198–214 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  13. Fredriksson, K., Mäkinen, V., Navarro, G.: Flexible music retrieval in sublinear time. In: Proceedings of the 10th Prague Stringology Conference (PSC 2005), pp. 174–188 (2005)

    Google Scholar 

  14. Hazay, C., Lewenstein, M., Sokol, D.: Approximate parameterized matching. ACM Transactions on Algorithms (TALG) 3(3), 29 (2007)

    Article  MathSciNet  Google Scholar 

  15. Lee, I., Mendivelso, J., Pinzón, Y.J.: δγ – Parameterized Matching. In: Amir, A., Turpin, A., Moffat, A. (eds.) SPIRE 2008. LNCS, vol. 5280, pp. 236–248. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  16. Reiser, A.: A linear selection algorithm for sets of elements with weights. Inf. Process. Lett. 7(3), 159–162 (1978)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Industrial Engineering, Research Group on Algorithms and Combinatorics (ALGOS-UN), Universidad Nacional de Colombia, Colombia

    Juan Mendivelso & Yoan J. Pinzón

  2. School of Electronic, Telecommunication, and Computer Engineering, Korea Aerospace University, Republic of Korea

    Inbok Lee

Authors
  1. Juan Mendivelso
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Inbok Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yoan J. Pinzón
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Information Technologies Research Group, Universidad Autónoma de Bucaramanga, Bucaramanga, Colombia

    Liliana Calderón-Benavides

  2. Information Technologies and Research Group, Universidad Autónoma de Bucaramanga, Bucaramanga, Colombia

    Cristina González-Caro

  3. School of Physics and Mathematics, Universidad Michoacana, Edificio ”B”, Ciudad Universitaria,, 58000, Morelia, Mexico

    Edgar Chávez

  4. Department of Computer Science, Universidade Federal de Minas Gerais, Av. Antonio Carlos 6627, Pampulha, 31270-010, Belo Horizonte, Brazil

    Nivio Ziviani

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mendivelso, J., Lee, I., Pinzón, Y.J. (2012). Approximate Function Matching under δ- and γ- Distances. In: Calderón-Benavides, L., González-Caro, C., Chávez, E., Ziviani, N. (eds) String Processing and Information Retrieval. SPIRE 2012. Lecture Notes in Computer Science, vol 7608. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34109-0_37

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-34109-0_37

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-34108-3

  • Online ISBN: 978-3-642-34109-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation