Markovian log-supermodularity, and its applications in phylogenetics

Simple item page
dc.creatorSteel, Mike
dc.creatorFaller, Beata
dc.date2008-05-19
dc.date.accessioned2026-07-07T09:39:49Z
dc.date.available2026-07-07T09:39:49Z
dc.descriptionWe 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.
dc.description8 pages, 2 figures
dc.identifierhttps://arxiv.org/abs/0805.2936
dc.identifierhttp://arxiv.org/abs/0805.2936
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/161317
dc.subjectPopulations and Evolution
dc.subjectQuantitative Methods
dc.titleMarkovian log-supermodularity, and its applications in phylogenetics
dc.typetext

Files

Collections

arXiv