Combinatorics of linked systems of quartet trees

Moan, Emili; Rusinko, Joseph

doi:10.2140/involve.2016.9.171

Download this article
	For screen
	For printing

Recent Issues

The Journal

Submission Guidelines

Submission Form

Policies for Authors

Ethics Statement

ISSN: 1944-4184 (e-only)

ISSN: 1944-4176 (print)

Author Index

Coming Soon

Other MSP Journals

Combinatorics of linked systems of quartet trees

Emili Moan and Joseph Rusinko

Vol. 9 (2016), No. 1, 171–180

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.

Keywords

phylogenetics, quartets, decisiveness

Mathematical Subject Classification 2010

Primary: 92B10

Milestones

Received: 17 November 2014

Revised: 14 January 2015

Accepted: 2 February 2015

Published: 17 December 2015

Communicated by Kenneth S. Berenhaut

Authors

Emili Moan
Department of Mathematics Winthrop University Rock Hill, SC 29733 United States

Joseph Rusinko
Department of Mathematics Winthrop University Rock Hill, SC 29733 United States

Vol. 9, No. 1, 2016