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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	BMC bioinformatics Ročník 14; číslo Suppl 2; s. S18
Hlavní autori:	Sand, Andreas, Brodal, Gerth Stølting, Fagerberg, Rolf, Pedersen, Christian NS, Mailund, Thomas
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	London BioMed Central 21.01.2013 Springer Nature B.V
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!