z-logo
open-access-imgOpen Access
Shifted Hamming distance: a fast and accurate SIMD-friendly filter to accelerate alignment verification in read mapping
Author(s) -
Hongyi Xin,
John Greth,
John Emmons,
Gennady Pekhimenko,
Carl Kingsford,
Can Alkan,
Onur Mutlu
Publication year - 2015
Publication title -
bioinformatics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 3.599
H-Index - 390
eISSN - 1367-4811
pISSN - 1367-4803
DOI - 10.1093/bioinformatics/btu856
Subject(s) - computer science , edit distance , string (physics) , hamming distance , sequence (biology) , filter (signal processing) , algorithm , speedup , simd , error detection and correction , string searching algorithm , parallel computing , pattern matching , artificial intelligence , mathematics , biology , mathematical physics , computer vision , genetics
Calculating the edit-distance (i.e. minimum number of insertions, deletions and substitutions) between short DNA sequences is the primary task performed by seed-and-extend based mappers, which compare billions of sequences. In practice, only sequence pairs with a small edit-distance provide useful scientific data. However, the majority of sequence pairs analyzed by seed-and-extend based mappers differ by significantly more errors than what is typically allowed. Such error-abundant sequence pairs needlessly waste resources and severely hinder the performance of read mappers. Therefore, it is crucial to develop a fast and accurate filter that can rapidly and efficiently detect error-abundant string pairs and remove them from consideration before more computationally expensive methods are used.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom