An average-case sublinear forward algorithm for the haploid Li and Stephens model.
Conclusions: We show a forward algorithm which avoids any tradeoff between runtime and model complexity. Our algorithm makes use of two general strategies which might be applicable to improving the time complexity of other future sequence analysis algorithms: sparse dynamic programming matrices and lazy evaluation.
PMID: 30988694 [PubMed]
Source: Algorithms for Molecular Biology : AMB - Category: Molecular Biology Authors: Rosen YM, Paten BJ Tags: Algorithms Mol Biol Source Type: research
More News: Biology | Molecular Biology