Combinatorics of linked systems of quartet trees

DOI10.2140/INVOLVE.2016.9.171MaRDI QIDQ903149zbMATH OpenOpenAlexFDO

Authors Emili Moan, Joseph Rusinko

Publication date 5 January 2016

Published in Involve (Search for Journal in Brave)

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

zbMATH Keywords

quartetsphylogeneticsdecisiveness

Mathematics Subject Classification ID

Applications of graph theory (05C90) Problems related to evolution (92D15)

Abstract: We apply classical quartet techniques to the problem of phylogenetic decisiveness and find a value $k$ such that all collections of at least $k$ quartets are decisive. Moreover, we prove that this bound is optimal and give a lower-bound on the probability that a collection of quartets is decisive.

Recommendations

• On the compatibility of quartet trees
• On the compatibility of quartet trees
• Quartet compatibility and the quartet graph
• Constructing optimal trees from quartets
• Encoding phylogenetic trees in terms of weighted quartets

Cited in

(3)

• Bounding the maximum size of a minimal definitive set of quartets
• On the maximum size of minimal definitive quartet sets
• X-trees and weighted quartet systems

This page was built for publication: Combinatorics of linked systems of quartet trees

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