Skip to main content
SpringerLink
Log in

Implementation of a Swap Matching Algorithm Using a Graph Theoretic Model

  • Conference paper
Bioinformatics Research and Development (BIRD 2008)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 13))

Included in the following conference series:

Abstract

The swap matching problem consists if finding a pattern in a text, while allowing for transpositions in the pattern. A new approach using a graph-theoretic model was presented in [6] by Iliopoulos et al. In this paper we present a useful application for this algorithm and provide an analysis of its running time with a naive approach through implementation.

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 89.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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., Landau, G.M., Lewenstein, M., Lewenstein, N.: Pattern matching with swaps. J. Algorithms 37(2), 247–266 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  2. Amir, A., Cole, R., Hariharan, R., Lewenstein, M., Porat, E.: Overlap matching. Inf. Comput. 181(1), 57–74 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  3. Amir, A., Landau, G.M., Lewenstein, M., Lewenstein, N.: Efficient special cases of pattern matching with swaps. Inf. Process. Lett. 68(3), 125–132 (1998)

    Article  MathSciNet  Google Scholar 

  4. Baeza-Yates, R., Gonnet, G.: A new approach to text searching. Communications of the ACM 35, 74–82 (1992)

    Article  Google Scholar 

  5. Charras, C., Lecroq, T.: Handbook of Exact String Matching Algorithms. In: Texts in Algorithmics, King’s College, London (2004)

    Google Scholar 

  6. Iliopoulos, C.S., Rahman, M.S.: A new model to solve the swap matching problem and efficient algorithms for short patterns. In: Geffert, V., Karhumäki, J., Bertoni, A., Preneel, B., Návrat, P., Bieliková, M. (eds.) SOFSEM. LNCS, vol. 4910, pp. 316–327. Springer, Heidelberg (2008)

    Google Scholar 

  7. Strachan, T., Read, A.P.: Human Molecular Genetics 3. Garland Science, New York (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Algorithm Design Group Department of Computer Science, King’s College London, Strand, London, WC2R 2LS, England

    Pavlos Antoniou, Costas S. Iliopoulos, Inuka Jayasekera & M. Sohel Rahman

Authors
  1. Pavlos Antoniou
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Costas S. Iliopoulos
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Inuka Jayasekera
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. M. Sohel Rahman
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Mourad Elloumi Josef Küng Michal Linial Robert F. Murphy Kristan Schneider Cristian Toma

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Antoniou, P., Iliopoulos, C.S., Jayasekera, I., Rahman, M.S. (2008). Implementation of a Swap Matching Algorithm Using a Graph Theoretic Model. In: Elloumi, M., Küng, J., Linial, M., Murphy, R.F., Schneider, K., Toma, C. (eds) Bioinformatics Research and Development. BIRD 2008. Communications in Computer and Information Science, vol 13. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-70600-7_34

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-70600-7_34

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-70598-7

  • Online ISBN: 978-3-540-70600-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation