Please use this identifier to cite or link to this item:
|Title:||BatMis: A fast algorithm for k-mismatch mapping|
|Source:||Tennakoon, C., Purbojati, R.W., Sung, W.-K. (2012). BatMis: A fast algorithm for k-mismatch mapping. Bioinformatics 28 (16) : 2122-2128. ScholarBank@NUS Repository. https://doi.org/10.1093/bioinformatics/bts339|
|Abstract:||Motivation: Second-generation sequencing (SGS) generates millions of reads that need to be aligned to a reference genome allowing errors. Although current aligners can efficiently map reads allowing a small number of mismatches, they are not well suited for handling a large number of mismatches. The efficiency of aligners can be improved using various heuristics, but the sensitivity and accuracy of the alignments are sacrificed. In this article, we introduce Basic Alignment tool for Mismatches (BatMis)-an efficient method to align short reads to a reference allowing k mismatches. BatMis is a Burrows-Wheeler transformation based aligner that uses a seed and extend approach, and it is an exact method. Results: Benchmark tests show that BatMis performs better than competing aligners in solving the k-mismatch problem. Furthermore, it can compete favorably even when compared with the heuristic modes of the other aligners. BatMis is a useful alternative for applications where fast k-mismatch mappings, unique mappings or multiple mappings of SGS data are required. © The Author 2012. Published by Oxford University Press. All rights reserved.|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Feb 15, 2018
WEB OF SCIENCETM
checked on Feb 6, 2018
checked on Feb 20, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.