Abstract
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.
Part of this research has been supported by an INSPIRE Strategic Partnership Award, administered by the British Council, Bangladesh for the project titled “Advances in Algorithms for Next Generation Biological Sequences”.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
http://hgdownload-test.cse.ucsc.edu/goldenPath/hg19/bigZips/
Allers, T., Mevarech, M.: Archaeal genetics – the third way. Nat. Rev. Genet. 6, 58–73 (2005)
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)
Barton, C., Iliopoulos, C., Pissis, S.: Fast algorithms for approximate circular string matching. Algorithms for Molecular Biology 9(1), 9 (2014)
Chen, K., Huang, G., Lee, R.: Bit-parallel algorithms for exact circular string matching. Comput. J. (2013), doi:10.1093/comjnl/bxt023
Dulbecco, R., Vogt, M.: Evidence for a ring structure of polyoma virus DNA. Proc. Natl. Acad. Sci. 50(2), 236–243 (1963)
Fernandes, F., Pereira, L., Freitas, A.: CSA: An efficient algorithm to improve circular DNA multiple alignment. BMC Bioinformatics 10, 1–13 (2009)
Fredriksson, K., Grabowski, S.: Average-optimal string matching. J. Discrete Algorithms 7(4), 579–594 (2009)
Gusfield, D.: Algorithms on Strings, Trees and Sequences. Cambridge University Press, New York (1997)
Iliopoulos, C., Rahman, M.: Indexing circular patterns. In: Proceedings of the 2nd International Conference on Algorithms and Computation, pp. 46–57 (2008)
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)
Lin, J., Adjeroh, D.: All-against-all circular pattern matching. Comput. J. 55(7), 897–906 (2012)
Lipps, G.: Plasmids: Current Research and Future Trends. Caister Academic Press, Norfolk (2008)
Lothaire, M.: Applied Combinatorics on Words. Cambridge University Press, New York (2005)
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)
Thanbichler, M., Wang, S., Shapiro, L.: The bacterial nucleoid: A highly organized and dynamic structure. J. Cell Biochem. 96(3), 506–521 (2005), http://dx.doi.org/10.1002/jcb.20519
Weil, R., Vinograd, J.: The cyclic helix and cyclic coil forms of polyoma viral DNA. Proc. Natl. Acad. Sci. 50(4), 730–738 (1963)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Azim, M.A.R., Iliopoulos, C.S., Rahman, M.S., Samiruzzaman, M. (2015). A Filter-Based Approach for Approximate Circular Pattern Matching. In: Harrison, R., Li, Y., Măndoiu, I. (eds) Bioinformatics Research and Applications. ISBRA 2015. Lecture Notes in Computer Science(), vol 9096. Springer, Cham. https://doi.org/10.1007/978-3-319-19048-8_3
Download citation
DOI: https://doi.org/10.1007/978-3-319-19048-8_3
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-19047-1
Online ISBN: 978-3-319-19048-8
eBook Packages: Computer ScienceComputer Science (R0)