A Filter-Based Approach for Approximate Circular Pattern Matching

Md. Aashikur Rahman Azim; Costas S. Iliopoulos; M. Sohel Rahman; Samir Samir Uzzaman

doi:10.1007/978-3-319-19048-8_3

A Filter-Based Approach for Approximate Circular Pattern Matching

Md. Aashikur Rahman Azim, Costas S. Iliopoulos, M. Sohel Rahman, Samir Samir Uzzaman

Informatics

Research output: Chapter in Book/Report/Conference proceeding › Conference paper › peer-review

5 Citations (Scopus)

Abstract

This paper deals with the Approximate Circular Pattern Matching (ACPM) problem, which appears as an interesting problem in many biological contexts. Here the goal is to find all approximate occurrences of the rotations of a pattern P of length m in a text T of length n. In this article, we present a filter-based approach to solve the problem. We experimentally compare our approach with the state of the art algorithms in the literature and the results are found to be excellent.

Original language	English
Title of host publication	Bioinformatics Research and Applications - 11th International Symposium
Publisher	Springer
Pages	24-35
Number of pages	12
DOIs	https://doi.org/10.1007/978-3-319-19048-8_3
Publication status	Published - 2015

Access to Document

10.1007/978-3-319-19048-8_3

Cite this

@inbook{b99007c49bf142c0a7ce9e4dad874044,

title = "A Filter-Based Approach for Approximate Circular Pattern Matching",

abstract = "This paper deals with the Approximate Circular Pattern Matching (ACPM) problem, which appears as an interesting problem in many biological contexts. Here the goal is to find all approximate occurrences of the rotations of a pattern P of length m in a text T of length n. In this article, we present a filter-based approach to solve the problem. We experimentally compare our approach with the state of the art algorithms in the literature and the results are found to be excellent.",

author = "Azim, {Md. Aashikur Rahman} and Iliopoulos, {Costas S.} and Rahman, {M. Sohel} and {Samir Uzzaman}, Samir",

year = "2015",

doi = "10.1007/978-3-319-19048-8_3",

language = "English",

pages = "24--35",

booktitle = "Bioinformatics Research and Applications - 11th International Symposium",

publisher = "Springer",

}

TY - CHAP

T1 - A Filter-Based Approach for Approximate Circular Pattern Matching

AU - Azim, Md. Aashikur Rahman

AU - Iliopoulos, Costas S.

AU - Rahman, M. Sohel

AU - Samir Uzzaman, Samir

PY - 2015

Y1 - 2015

N2 - This paper deals with the Approximate Circular Pattern Matching (ACPM) problem, which appears as an interesting problem in many biological contexts. Here the goal is to find all approximate occurrences of the rotations of a pattern P of length m in a text T of length n. In this article, we present a filter-based approach to solve the problem. We experimentally compare our approach with the state of the art algorithms in the literature and the results are found to be excellent.

AB - This paper deals with the Approximate Circular Pattern Matching (ACPM) problem, which appears as an interesting problem in many biological contexts. Here the goal is to find all approximate occurrences of the rotations of a pattern P of length m in a text T of length n. In this article, we present a filter-based approach to solve the problem. We experimentally compare our approach with the state of the art algorithms in the literature and the results are found to be excellent.

U2 - 10.1007/978-3-319-19048-8_3

DO - 10.1007/978-3-319-19048-8_3

M3 - Conference paper

SP - 24

EP - 35

BT - Bioinformatics Research and Applications - 11th International Symposium

PB - Springer

ER -

A Filter-Based Approach for Approximate Circular Pattern Matching

Abstract

Access to Document

Fingerprint

Cite this