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

Md Aashikur Rahman Azim, Costas S Iliopoulos, M Sohel Rahman, M Samiruzzaman

Open access · goldAbstract read

In one paragraph

Article in International journal of genomics, 2015. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

0numbers the graph read from it

0cells of the map it votes in

0citing papers in PubMed

1.3field-weighted citation impact, top 14% of its field

1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

0 citing papers in PubMed, 3 citations in OpenAlex.

No citing paper in PubMed yet.

4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

4 authors at 2 institutions in 2 countries.

Md Aashikur Rahman AzimA ℓ EDA Group, Department of CSE, Bangladesh University of Engineering & Technology, Dhaka 1215, Bangladesh.

Costas S IliopoulosDepartment of Informatics, King's College London, Strand, London WC2R 2LS, UK.

M Sohel RahmanA ℓ EDA Group, Department of CSE, Bangladesh University of Engineering & Technology, Dhaka 1215, Bangladesh.

M SamiruzzamanDepartment of Informatics, King's College London, Strand, London WC2R 2LS, UK.

Bangladesh University of Engineering and Technology · BDKing's College London · GB

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

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 m in a text 𝒯 of length n. 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.

Identifiers

PMID26557649

DOI10.1155/2015/259320

PMCPMC4628665

OpenAlexW2098636590

What OpenQuestion holds

Textmetadata

LicenceCC BY

Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.