Md. Aashikur Rahman Azim
ABSTRACT
Exact Circular Pattern Matching (ECPM) problem consists in finding all occurrences of the rotations of a pattern P of length m in a text T of length n. In this paper we present a fast filter-based algorithm for this problem.
- Applied Combinatorics on Words, 2005.Google Scholar
- T. Allers and M. Mevarech. Archaeal genetics -- the third way. Nat Rev Genet, 6:58--73, 2005.Google ScholarCross Ref
- C. Barton, C. Iliopoulos, and S. Pissis. Fast algorithms for approximate circular string matching. Algorithms for Molecular Biology, 9(1):9, 2014.Google ScholarCross Ref
- K. Chen, G. Huang, and R. Lee. Bit-parallel algorithms for exact circular string matching. Comput J, 2013. doi:10.1093/comjnl/bxt023.Google Scholar
- R. Dulbecco and M. Vogt. Evidence for a ring structure of polyoma virus dna. Proc Natl Acad Sci, 50(2):236--243, 1963.Google ScholarCross Ref
- K. Fredriksson and S. Grabowski. Average-optimal string matching. J Discrete Algorithms, 7(4):579--594, 2009. Google ScholarDigital Library
- D. Gusfield. Algorithms on Strings, Trees and Sequences, 1997. Google ScholarDigital Library
- C. Iliopoulos and M. Rahman. Indexing circular patterns. Proceedings of the 2nd International Conference on Algorithms and Computation, pages 46--57, 2008. Google ScholarDigital Library
- J. Lin and D. Adjeroh. All-against-all circular pattern matching. Comput J, 55(7):897--906, 2012. Google ScholarDigital Library
- G. Lipps. Plasmids: Current Research and Future Trends, 2008.Google Scholar
- M. Thanbichler, S. Wang, and L. Shapiro. The bacterial nucleoid: A highly organized and dynamic structure. J Cell Biochem, 96(3):506--521, 2005.Google ScholarCross Ref
- R. Weil and J. Vinograd. The cyclic helix and cyclic coil forms of polyoma viral dna. Proc Natl Acad Sci, 50(4):730--738, 1963.Google ScholarCross Ref
Index Terms
- A fast and lightweight filter-based algorithm for circular pattern matching
Recommendations
On the average-case complexity of pattern matching with wildcards
AbstractPattern matching with wildcards is a string matching problem with the goal of finding all factors of a text t of length n that match a pattern x of length m, where wildcards (characters that match everything) may be present. In this ...
New algorithms for fixed-length approximate string matching and approximate circular string matching under the Hamming distance
This paper proposes new algorithms for fixed-length approximate string matching and approximate circular string matching under the Hamming distance. Fixed-length approximate string matching and approximate circular string matching are special cases of ...
Palindrome pattern matching
A palindrome is a string that reads the same forward and backward. For a string x, let Pals(x) be the set of all maximal palindromes of x, where each maximal palindrome in Pals(x) is encoded by a pair (c,r) of its center c and its radius r. Given a text ...
Comments