Open Access
Translator Disclaimer
2016 Combinatorics of linked systems of quartet trees
Emili Moan, Joseph Rusinko
Involve 9(1): 171-180 (2016). DOI: 10.2140/involve.2016.9.171

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.

Citation

Download Citation

Emili Moan. Joseph Rusinko. "Combinatorics of linked systems of quartet trees." Involve 9 (1) 171 - 180, 2016. https://doi.org/10.2140/involve.2016.9.171

Information

Received: 17 November 2014; Revised: 14 January 2015; Accepted: 2 February 2015; Published: 2016
First available in Project Euclid: 22 November 2017

zbMATH: 1343.92359
MathSciNet: MR3438452
Digital Object Identifier: 10.2140/involve.2016.9.171

Subjects:
Primary: 92B10

Keywords: decisiveness , Phylogenetics , quartets

Rights: Copyright © 2016 Mathematical Sciences Publishers

JOURNAL ARTICLE
10 PAGES


SHARE
Vol.9 • No. 1 • 2016
MSP
Back to Top