A natural number based linear time filtering approach to finding all occurrences of a DNA pattern

String matching and searching techniques have been extensively studied in different research works [[1], [4], [5]]. They currently play an essential part in the field of computational biology. Most of those techniques, from classics to their improved versions could successfully accomplish the task i...

Full description

Saved in:
Bibliographic Details
Main Author: Le, Vu Quang
Format: Conference Proceeding
Language:English
Subjects:
Computer science
DNA
Filtering
Frequency
Genetics
Matched filters
Nonlinear filters
Pattern matching
Sequences
Table lookup
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:String matching and searching techniques have been extensively studied in different research works [[1], [4], [5]]. They currently play an essential part in the field of computational biology. Most of those techniques, from classics to their improved versions could successfully accomplish the task in linear time. In this paper, I propose a new searching approach based on the delivery of distinct natural numbers over a transition matrix of four nucleotides to find all occurrences of a DNA pattern in a given string. My algorithm has only Θ( - 1) time complexity for the worst case with n to be the length of a given string s for a DNA pattern p of length m to be searched on.
DOI:10.1109/ICISIP.2006.4286078