2008
DOI: 10.1093/bioinformatics/btn565
|View full text |Cite
|
Sign up to set email alerts
|

Slider—maximum use of probability information for alignment of short sequence reads and SNP detection

Abstract: Motivation: A plethora of alignment tools have been created that are designed to best fit different types of alignment conditions. While some of these are made for aligning Illumina Sequence Analyzer reads, none of these are fully utilizing its probability (prb) output. In this article, we will introduce a new alignment approach (Slider) that reduces the alignment problem space by utilizing each read base's probabilities given in the prb files. Results: Compared with other aligners, Slider has higher alignment… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
30
0

Year Published

2009
2009
2018
2018

Publication Types

Select...
4
3
2

Relationship

0
9

Authors

Journals

citations
Cited by 45 publications
(30 citation statements)
references
References 12 publications
0
30
0
Order By: Relevance
“…The short read lengths and the high error rates of reads generated by the Illumina GA pose new computational challenges for the accurate detection of SNPs. Many methods have been developed for aligning short reads with multiple errors to a reference sequence and SNP calling for the Illumina GA (Li et al , 2009aMalhis et al 2009). In particular, MAQ represents an efficient, easy-to-use and popular tool for read alignment and SNP calling.…”
Section: Discussionmentioning
confidence: 99%
“…The short read lengths and the high error rates of reads generated by the Illumina GA pose new computational challenges for the accurate detection of SNPs. Many methods have been developed for aligning short reads with multiple errors to a reference sequence and SNP calling for the Illumina GA (Li et al , 2009aMalhis et al 2009). In particular, MAQ represents an efficient, easy-to-use and popular tool for read alignment and SNP calling.…”
Section: Discussionmentioning
confidence: 99%
“…If an exact match of a seed s exists, then we extend it to the whole read and find mismatches for the whole read (Algorithm 3, lines 9-11). If mismatches are less than e then a read with its location in the reference genome is yielded (Algorithm 3, lines [12][13]. If the mismatches are more than e then the edit distance for the whole read is calculated and if this computed edit distance is less than e, then a read with its location in the reference genome is outputted (Algorithm 3, lines [14][15][16][17].…”
Section: Phase Iii-read Mappingmentioning
confidence: 99%
“…To bypass the large memory requirement, slider [13] proposes a sequence alignment by merge-sorting the reference genome subsequences and read sequences. Recently, string matching algorithms based on the Burrow-Wheeler Transformation (BWT) [14], which is a string compression technique, has drawn the attention of many research groups.…”
mentioning
confidence: 99%
“…Similaritybased methods use sequence identity to determine how alike sequences are: BLAST 18,19 ' 21 and number of mismatches [22][23][24][25] are commonly used measures. Sequence composition methods use instead intrinsic features of the sequences to determine their similarity, such as their GC-content 26 or fc-nucleotide frequencies.…”
Section: ~20mentioning
confidence: 99%