A note on probabilistic models over strings: the linear algebra approach

DOI10.1007/s11538-013-9906-6zbMath1284.92065arXiv1301.5054OpenAlexW2963464696WikidataQ35019952 ScholiaQ35019952MaRDI QIDQ2446798

Alexandre Bouchard-Côté

Publication date: 22 April 2014

Published in: Bulletin of Mathematical Biology (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1301.5054

zbMATH Keywords

automatagraphical modelsphylogeneticsalignmentsfactor graphsstring transducersindelTKF91

Mathematics Subject Classification ID

Problems related to evolution (92D15) Applications of graph theory (05C90) Basic linear algebra (15A99)

Uses Software

• ATLAS
• fastDNAml
• Statalign
• Bali-phy
• PRMLT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A sufficient condition for reducing recursions in hidden Markov models
• The Kronecker product and stochastic automata networks
• Handbook of weighted automata
• Applying the Thorne-Kishino-Felsenstein model to sequence evolution on a star-shaped tree
• Alignment-free phylogenetic reconstruction: Sample complexity via a branching process analysis
• GENERIC ∊-REMOVAL AND INPUT ∊-NORMALIZATION ALGORITHMS FOR WEIGHTED TRANSDUCERS
• Alignment Uncertainty and Genomic Analysis
• On the definition of a family of automata
• Auxiliary Variable Methods for Markov Chain Monte Carlo with Applications
• An Improved Model for Statistical Alignment
• Multiplying matrices faster than coppersmith-winograd
• Graphical models
• Automated empirical optimizations of software and the ATLAS project

This page was built for publication: A note on probabilistic models over strings: the linear algebra approach