Markovian log-supermodularity, and its applications in phylogenetics

From MaRDI portal
Publication:845658

DOI10.1016/J.AML.2008.10.005zbMATH Open1179.92046arXiv0805.2936OpenAlexW2045899679MaRDI QIDQ845658FDOQ845658


Authors: Beáta Faller, Mike Steel Edit this on Wikidata


Publication date: 29 January 2010

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Abstract: We establish a log-supermodularity property for probability distributions on binary patterns observed at the tips of a tree that are generated under any 2--state Markov process. We illustrate the applicability of this result in phylogenetics by deriving an inequality relevant to estimating expected future phylogenetic diversity under a model of species extinction. In a further application of the log-supermodularity property, we derive a purely combinatorial inequality for the parsimony score of a binary character. The proofs of our results exploit two classical theorems in the combinatorics of finite sets.


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




Recommendations




Cites Work


Cited In (5)





This page was built for publication: Markovian log-supermodularity, and its applications in phylogenetics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q845658)