DSpace Repository

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

Show simple item record

dc.contributor.author Azim, Md. Aashikur Rahman
dc.contributor.author Iliopoulos, Costas S.
dc.contributor.author Rahman, M. Sohel
dc.contributor.author Samiruzzaman, M.
dc.date.accessioned 2015-10-08T14:23:27Z
dc.date.available 2015-10-08T14:23:27Z
dc.date.issued 2015-03-21
dc.identifier.other 259320
dc.identifier.uri http://lib.buet.ac.bd:8080/xmlui/handle/123456789/953
dc.description.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 patternPof length𝑚in a textTof 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. en_US
dc.language.iso en_US en_US
dc.publisher Hindawi Publishing Corporation en_US
dc.subject Bioinformatics en_US
dc.subject Circular Pattern Matching en_US
dc.title SimpLiFiCPM: A Simple and Lightweight Filter-Based Algorithm for Circular Pattern Matching. en_US
dc.type Journal en_US
dc.pub.crdept Dept. of Computer Science and Engineering (CSE) en_US
dc.pub.dept Dept. of Computer Science and Engineering (CSE) en_US
dc.pub.event International Journal of Genomics en_US
dc.contributor.crauthor Azim, Md. Aashikur Rahman


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search BUET IR


Advanced Search

Browse

My Account