A Filter-Based Approach for Approximate Circular Pattern Matching

  • Md. Aashikur Rahman Azim
  • Costas S. Iliopoulos
  • M. Sohel Rahman
  • M. Samiruzzaman
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9096)


This paper deals with the Approximate Circular Pattern Matching (ACPM) problem, which appears as an interesting problem in many biological contexts. Here the goal is to find all approximate occurrences of the rotations of a pattern \(\mathcal{P}\) of length m in a text \(\mathcal{T}\) of length n. In this article, we present a filter-based approach to solve the problem. We experimentally compare our approach with the state of the art algorithms in the literature and the results are found to be excellent.


Total Distance Circular Pattern Slide Window Approach Approximate Version Linear String 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
  2. 2.
  3. 3.
    Allers, T., Mevarech, M.: Archaeal genetics – the third way. Nat. Rev. Genet. 6, 58–73 (2005)CrossRefGoogle Scholar
  4. 4.
    Azim, M.A.R., Iliopoulos, C.S., Rahman, M.S., Samiruzzaman, M.: A fast and lightweight filter-based algorithm for circular pattern matching. In: Proceedings of the 5th ACM Conference on Bioinformatics, Computational Biology, and Health Informatics, BCB 2014, pp. 621–622. ACM, New York (2014)CrossRefGoogle Scholar
  5. 5.
    Barton, C., Iliopoulos, C., Pissis, S.: Fast algorithms for approximate circular string matching. Algorithms for Molecular Biology 9(1), 9 (2014)CrossRefGoogle Scholar
  6. 6.
    Chen, K., Huang, G., Lee, R.: Bit-parallel algorithms for exact circular string matching. Comput. J. (2013), doi:10.1093/comjnl/bxt023Google Scholar
  7. 7.
    Dulbecco, R., Vogt, M.: Evidence for a ring structure of polyoma virus DNA. Proc. Natl. Acad. Sci. 50(2), 236–243 (1963)CrossRefGoogle Scholar
  8. 8.
    Fernandes, F., Pereira, L., Freitas, A.: CSA: An efficient algorithm to improve circular DNA multiple alignment. BMC Bioinformatics 10, 1–13 (2009)CrossRefGoogle Scholar
  9. 9.
    Fredriksson, K., Grabowski, S.: Average-optimal string matching. J. Discrete Algorithms 7(4), 579–594 (2009)CrossRefzbMATHMathSciNetGoogle Scholar
  10. 10.
    Gusfield, D.: Algorithms on Strings, Trees and Sequences. Cambridge University Press, New York (1997)CrossRefzbMATHGoogle Scholar
  11. 11.
    Iliopoulos, C., Rahman, M.: Indexing circular patterns. In: Proceedings of the 2nd International Conference on Algorithms and Computation, pp. 46–57 (2008)Google Scholar
  12. 12.
    Lee, T., Na, J., Park, H., Park, K., Sim, J.: Finding optimal alignment and consensus of circular strings. In: Proceedings of the 21st Annual Conference on Combinatorial Pattern Matching, pp. 310–322 (2010)Google Scholar
  13. 13.
    Lin, J., Adjeroh, D.: All-against-all circular pattern matching. Comput. J. 55(7), 897–906 (2012)CrossRefGoogle Scholar
  14. 14.
    Lipps, G.: Plasmids: Current Research and Future Trends. Caister Academic Press, Norfolk (2008)Google Scholar
  15. 15.
    Lothaire, M.: Applied Combinatorics on Words. Cambridge University Press, New York (2005)CrossRefzbMATHGoogle Scholar
  16. 16.
    Mosig, A., Hofacker, I., Stadler, P., Zell, A.: Comparative analysis of cyclic sequences: viroids and other small circular RNAs. In: German Conference on Bioinformatics. LNI, vol. 83, pp. 93–102 (2006)Google Scholar
  17. 17.
    Thanbichler, M., Wang, S., Shapiro, L.: The bacterial nucleoid: A highly organized and dynamic structure. J. Cell Biochem. 96(3), 506–521 (2005), CrossRefGoogle Scholar
  18. 18.
    Weil, R., Vinograd, J.: The cyclic helix and cyclic coil forms of polyoma viral DNA. Proc. Natl. Acad. Sci. 50(4), 730–738 (1963)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  • Md. Aashikur Rahman Azim
    • 1
  • Costas S. Iliopoulos
    • 2
  • M. Sohel Rahman
    • 1
    • 2
  • M. Samiruzzaman
    • 2
  1. 1.Department of CSE, AℓEDA GroupBUETDhakaBangladesh
  2. 2.Department of InformaticsKing’s College LondonStrand, LondonUK

Personalised recommendations