2018 · 29 citations · 11 references
Life SciencesBioinformaticsGenomic Data AnalysisGenomicsSequence AnalysisDna SequencingGenome SequencingChannelsComputational Reconstruction AlgorithmsDeletionsEdit DistanceMaximum Likelihood EstimatorReconstruction Algorithms
The problem of reconstructing a sequence when observed through multiple looks over deletion channels occurs in “de novo” DNA sequencing. The DNA could be sequenced multiple times, yielding several “looks” of it, but each time the sequencer could be noisy with (independent) deletion impairments. The main goal of this paper is to develop reconstruction algorithms for a sequence observed through the lens of a fixed number of deletion channels. We use the probabilistic model of the deletion channels to develop both symbol-wise and sequence maximum likelihood decoding criteria, and algorithms motivated by them. Numerical evaluations demonstrate improvement in terms of edit distance error, over earlier algorithms.
11
Fast and accurate short read alignment with Burrows–Wheeler transform
Heng Li, Richard Durbin · Bioinformatics · 2009 · 62.8K citations · Full text
Decoding long nanopore sequencing reads of natural DNA
Andrew H. Laszlo, Ian M. Derrington, Brian C. Ross et al. · Nature Biotechnology · 2014 · 441 citations · Full text
Efficient reconstruction of sequences
V.I. Levenshtein · IEEE Transactions on Information Theory · 2001 · 201 citations