title: A fast Boyer-Moore type pattern matching algorithm for highly similar sequences.
abstract: In the last decade, biology and medicine have undergone a fundamental change: next generation sequencing (NGS) technologies have enabled to obtain genomic sequences very quickly and at small costs compared to the traditional Sanger method. These NGS technologies have thus permitted to collect genomic sequences (genes, exomes or even full genomes) of individuals of the same species. These latter sequences are identical to more than 99%. There is thus a strong need for efficient algorithms for indexing and performing fast pattern matching in such specific sets of sequences. In this paper we propose a very efficient algorithm that solves the exact pattern matching problem in a set of highly similar DNA sequences where only the pattern can be pre-processed. This new algorithm extends variants of the Boyer-Moore exact string matching algorithm. Experimental results show that it exhibits the best performances in practice.
authors.forename: Nadia
authors.initials: N
authors.lastname: Ben Nsira
authors.forename: Thierry
authors.initials: T
authors.lastname: Lecroq
authors.forename: Mourad
authors.initials: M
authors.lastname: Elloumi
mesh_terms: D000465:Algorithms; D001483:Base Sequence; D017124:Conserved Sequence / Q000235:genetics*; D004247:DNA / Q000235:genetics*; D000069550:Machine Learning; D008969:Molecular Sequence Data; D010363:Pattern Recognition, Automated / Q000379:methods*; D015203:Reproducibility of Results; D012680:Sensitivity and Specificity; D016415:Sequence Alignment / Q000379:methods*; D017422:Sequence Analysis, DNA / Q000379:methods*
chemical_list: D004247:DNA