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 𝒫 of length m in a text 𝒯 of length n. In this paper, we present SimpLiFiCPM (pronounced “Simp...

Descripción completa

Detalles Bibliográficos
Autores principales: Azim, Md. Aashikur Rahman, Iliopoulos, Costas S., Rahman, M. Sohel, Samiruzzaman, M.
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Hindawi Publishing Corporation 2015
Materias:
Research Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4628665/
https://www.ncbi.nlm.nih.gov/pubmed/26557649
http://dx.doi.org/10.1155/2015/259320

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4628665/
https://www.ncbi.nlm.nih.gov/pubmed/26557649
http://dx.doi.org/10.1155/2015/259320

Ejemplares similares