Computing the quartet distance between evolutionary trees in time \(O(n\,\log n)\)
type: Item
instance of: scholarly article
title: Computing the quartet distance between evolutionary trees in time \(O(n\,\log n)\)
zbMATH Open document ID: 1072.68121
author: Gerth Stølting Brodal
author: Rolf Fagerberg
author: Christian Nørgaard Storm Pedersen
published in: Algorithmica
publication date: 2004-12-02T00:00:00Z
Mathematics Subject Classification ID: 68W05
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 92D15
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 2121096
MaRDI profile type: Publication
full work available at URL: s00453-003-1065-y
OpenAlex ID: W2160517437
DOI: 10.1007/S00453-003-1065-Y
Recommended article: Q4474139
Recommended article: Q4519914
Recommended article: A polynomial time approximation scheme for inferring evolutionary trees from quartet topologies and its application
Recommended article: On the maximum quartet distance between phylogenetic trees
Recommended article: Efficient Algorithms for Computing the Triplet and Quartet Distance Between Trees of Arbitrary Degree
Recommended article: Q4471327
Recommended article: On the complexity of computing MP distance between binary phylogenetic trees
Recommended article: Locating a Tree in a Phylogenetic Network in Quadratic Time
description: scientific article; zbMATH DE number 2121096