A practical O(n log2n) time algorithm for computing the triplet distance on binary trees

The triplet distance is a distance measure that compares two rooted trees on the same set of leaves by enumerating all sub-sets of three leaves and counting how often the induced topologies of the tree are equal or different. We present an algorithm that computes the triplet distance between two roo...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	BMC bioinformatics Jg. 14; H. Suppl 2; S. S18
Hauptverfasser:	Sand, Andreas, Brodal, Gerth Stølting, Fagerberg, Rolf, Pedersen, Christian NS, Mailund, Thomas
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	London BioMed Central 21.01.2013 Springer Nature B.V
Schlagworte:	Algorithms Bioinformatics Biomedical and Life Sciences Computational Biology - methods Computational Biology/Bioinformatics Computer Appl. in Life Sciences Computer science Computer Simulation Leaves Life Sciences Microarrays Phylogeny Proceedings Software Studies Lower Common Ancestor Brodal Contractible Edge Time Algorithm Binary Tree
ISSN:	1471-2105, 1471-2105
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!