Parametric Inference for Biological Sequence Analysis
Lior Pachter, Bernd Sturmfels
Abstract
One of the major successes in computational biology has been the unification, using the graphical model formalism, of a multitude of algorithms for annotating and comparing biological sequences. Graphical models that have been applied towards these problems include hidden Markov models for annotation, tree models for phylogenetics, and pair hidden Markov models for alignment. A single algorithm, the sum-product algorithm, solves many of the inference problems associated with different statistical models. This paper introduces the polytope propagation algorithm for computing the Newton polytope of an observation from a graphical model. This algorithm is a geometric version of the sum-product algorithm and is used to analyze the parametric behavior of maximum a posteriori inference calculations for graphical models.
Create a lesson
Related papers
Large Language Model Agents for Evidence Based Genetic Disease Severity Classification
Tohid Ghasemnejad, Ahmadreza Argha, Mark Grosser et al.
STUART: Sequence Triage and qUAntification of Read Transcripts for Rapid Ionizing Radiation Exposure Assessment
Tomasz Strzoda, Lourdes Cruz-Garcia, Mustafa Najim et al.
PlainMap: a lightweight, restartable mapping pipeline for ancient and modern DNA
Michael V. Westbury
Democratizing Clinical Tumor Whole Genome Sequencing: 18-hour End-to-end Analysis via Trillion-parameter Large Language Models Locally Deployed on Consumer-grade Hardware
Rui Xiao, Yili Xu
Structure is not mechanism: high-gain gated-FFN rows across text and genomic foundation models
Alexandros Tzanakakis, Aris Karatzikos, Ilias Georgakopoulos-Soares
RAGCell: Retrieval-Augmented Generation as Supervision for Versatile Single-cell Analysis
Tianyu Liu, Fan Zhang, Jiayuan Chen et al.