title: Compressed pattern matching in DNA sequences.
abstract: We propose derivative Boyer-Moore (d-BM), a new compressed pattern matching algorithm in DNA sequences. This algorithm is based on the Boyer-Moore method, which is one of the most popular string matching algorithms. In this approach, we compress both DNA sequences and patterns by using two bits to represent each A, T, C, G character. Experiments indicate that this compressed pattern matching algorithm searches long DNA patterns (length > 50) more than 10 times faster than the exact match routine of the software package Agrep, which is known as the fastest pattern matching tool. Moreover, compression of DNA sequences by this method gives a guaranteed space saving of 75%. In part the enhanced speed of the algorithm is due to the increased efficiency of the Boyer-Moore method resulting from an increase in alphabet size from 4 to 256.
authors.affiliation: Wayne State University, USA. ak3230@wayne.edu
authors.forename: Lei
authors.initials: L
authors.lastname: Chen
authors.forename: Shiyong
authors.initials: S
authors.lastname: Lu
authors.forename: Jeffrey
authors.initials: J
authors.lastname: Ram
mesh_terms: D000465:Algorithms; D001185:Artificial Intelligence; D001483:Base Sequence; D002874:Chromosome Mapping / Q000379:methods*; D044962:Data Compression / Q000379:methods*; D008969:Molecular Sequence Data; D010363:Pattern Recognition, Automated / Q000379:methods*; D016415:Sequence Alignment / Q000379:methods*; D017422:Sequence Analysis, DNA / Q000379:methods*