Unknown

Dataset Information

Large scale sequence alignment via efficient inference in generative models.


ABSTRACT: Finding alignments between millions of reads and genome sequences is crucial in computational biology. Since the standard alignment algorithm has a large computational cost, heuristics have been developed to speed up this task. Though orders of magnitude faster, these methods lack theoretical guarantees and often have low sensitivity especially when reads have many insertions, deletions, and mismatches relative to the genome. Here we develop a theoretically principled and efficient algorithm that has high sensitivity across a wide range of insertion, deletion, and mutation rates. We frame sequence alignment as an inference problem in a probabilistic model. Given a reference database of reads and a query read, we find the match that maximizes a log-likelihood ratio of a reference read and q

SUBMITTER: Mongia M 

PROVIDER: S-EPMC10160065 | biostudies-literature | 2023 May

REPOSITORIES: biostudies-literature