Fast error-tolerant quartet phylogeny algorithms

We present a quartet-based phylogeny algorithm that returns the correct topology for n taxa in O(nlogn) time with high probability, assuming that each quartet is inconsistent with the true tree topology with constant probability, independent of other quartets. Our incremental algorithm relies upon a...

Full description

Bibliographic Details

Published in:	Theoretical computer science Vol. 483; pp. 104 - 114
Main Authors:	Brown, Daniel G., Truszkowski, Jakub
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 29.04.2013
ISSN:	0304-3975, 1879-2294
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!