SimpLiFiCPM: A Simple and Lightweight Filter-Based Algorithm for Circular Pattern Matching

Research output: Contribution to journalArticlepeer-review

3 Citations (Scopus)
158 Downloads (Pure)

Abstract

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 of length in a text of length . In this paper, we present SimpLiFiCPM (pronounced “Simplify CPM”), a simple and lightweight filter-based algorithm to solve the problem. We compare our algorithm with the state-of-the-art algorithms and the results are found to be excellent. Much of the speed of our algorithm comes from the fact that our filters are effective but extremely simple and lightweight.
Original languageEnglish
Article number259320
JournalInternational Journal of Genomics
Volume2015
DOIs
Publication statusPublished - 2015

Fingerprint

Dive into the research topics of 'SimpLiFiCPM: A Simple and Lightweight Filter-Based Algorithm for Circular Pattern Matching'. Together they form a unique fingerprint.

Cite this