Cargando…
Algorithms for Computing the Triplet Quartet Distances for Binary General Trees
Distance measures between trees are useful for comparing trees in a systematic manner, and several different distance measures have been proposed. The triplet and quartet distances, for rooted and unrooted trees, respectively, are defined as the number of subsets of three or four leaves, respectivel...
Autores principales: | Sand, Andreas, Holt, Morten K., Johansen, Jens, Fagerberg, Rolf, Brodal, Gerth Stølting, Pedersen, Christian N. S., Mailund, Thomas |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
MDPI
2013
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4009797/ https://www.ncbi.nlm.nih.gov/pubmed/24833220 http://dx.doi.org/10.3390/biology2041189 |
Ejemplares similares
-
A practical O(n log(2 )n) time algorithm for computing the triplet distance on binary trees
por: Sand, Andreas, et al.
Publicado: (2013) -
A sub-cubic time algorithm for computing the quartet distance between two general trees
por: Nielsen, Jesper, et al.
Publicado: (2011) -
Fast calculation of the quartet distance between trees of arbitrary degrees
por: Christiansen, Chris, et al.
Publicado: (2006) -
Recrafting the neighbor-joining method
por: Mailund, Thomas, et al.
Publicado: (2006) -
Incompatible quartets, triplets, and characters
por: Shutters, Brad, et al.
Publicado: (2013)