SimpLiFiCPM: A Simple and Lightweight Filter-Based Algorithm for Circular Pattern Matching
This paper deals with the circular pattern matching (CPM) problem, which appears as an interesting problem in many biological contexts. CPM 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 SimpLiFiCPM (pronounced “Simp...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2015-01-01
|
| Series: | International Journal of Genomics |
| Online Access: | http://dx.doi.org/10.1155/2015/259320 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!