scientific article; zbMATH DE number 5262865
From MaRDI portal
Publication:5457044
zbMath1133.92347MaRDI QIDQ5457044
Xin He, John Tromp, Tao Jiang, Louxin Zhang, Bhaskar Das Gupta, Ming Li
Publication date: 14 April 2008
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Problems related to evolution (92D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (9)
Fast algorithms for the rooted triplet distance between caterpillars ⋮ Neighborhoods of Phylogenetic Trees: Exact and Asymptotic Counts ⋮ Approximating geodesic tree distance ⋮ Distributions of topological tree metrics between a species tree and a gene tree ⋮ Properties for the Fréchet mean in Billera-Holmes-Vogtmann treespace ⋮ Walks in phylogenetic treespace ⋮ Computing nearest neighbour interchange distances between ranked phylogenetic trees ⋮ The combinatorics of discrete time-trees: theory and open problems ⋮ Discrete coalescent trees
This page was built for publication:
