2013 IEEE International Symposium on Information Theory 2013
DOI: 10.1109/isit.2013.6620502
|View full text |Cite
|
Sign up to set email alerts
|

PREMIER — PRobabilistic error-correction using Markov inference in errored reads

Abstract: In this work we present a flexible, probabilistic and reference-free method of error correction for high throughput DNA sequencing data. The key is to exploit the high coverage of sequencing data and model short sequence outputs as independent realizations of a Hidden Markov Model (HMM). We pose the problem of error correction of reads as one of maximum likelihood sequence detection over this HMM. While time and memory considerations rule out an implementation of the optimal Baum-Welch algorithm (for parameter… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
22
0

Year Published

2013
2013
2017
2017

Publication Types

Select...
3
3

Relationship

1
5

Authors

Journals

citations
Cited by 6 publications
(22 citation statements)
references
References 24 publications
0
22
0
Order By: Relevance
“…In our previous work [17], we presented a hidden Markov model for the DNA sequencer outputs. The reads were corrected by first fitting the HMM model parameters from the observed data and then posing the problem of read correction as one of maximum likelihood sequence detection (MLSD).…”
Section: Introductionmentioning
confidence: 99%
“…In our previous work [17], we presented a hidden Markov model for the DNA sequencer outputs. The reads were corrected by first fitting the HMM model parameters from the observed data and then posing the problem of read correction as one of maximum likelihood sequence detection (MLSD).…”
Section: Introductionmentioning
confidence: 99%
“…Premier [136] models a sequencer as a Hidden Markov Model, with each read being an independent realization of the HMM. It uses Expectation Maximization (EM) Baum-Welch to fit a HMM to a read.…”
Section: Probabilistic Models Based (Pmb)mentioning
confidence: 99%
“…They present two algorithms for error correction: Viterbi and Fano. Premier Turbo [137] expands upon the previous version from [136]. It allows errors in the first k-mer.…”
Section: Probabilistic Models Based (Pmb)mentioning
confidence: 99%
See 2 more Smart Citations