scientific article; zbMATH DE number 2079368
From MaRDI portal
Publication:4471327
zbMath1094.68614MaRDI QIDQ4471327
Yunhong Zhou, Valerie King, L. Zhang
Publication date: 28 July 2004
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Problems related to evolution (92D15) Graph theory (including graph drawing) in computer science (68R10)
Related Items (18)
Circular Networks from Distorted Metrics ⋮ Near-Linear Query Complexity for Graph Inference ⋮ On the longest path algorithm for reconstructing trees from distance matrices ⋮ Identifiability and inference of non-parametric rates-across-sites models on large-scale phylo\-genies ⋮ Fast error-tolerant quartet phylogeny algorithms ⋮ Phylogenetic mixtures: concentration of measure in the large-tree limit ⋮ Exact learning of multitrees and almost-trees using path queries ⋮ Unnamed Item ⋮ Reconstructing Markov processes from independent and anonymous experiments ⋮ Alignment-free phylogenetic reconstruction: Sample complexity via a branching process analysis ⋮ Learning and Verifying Graphs Using Queries with a Focus on Edge Counting ⋮ Unnamed Item ⋮ Reconstruction and verification of chordal graphs with a distance oracle ⋮ Fast Error-Tolerant Quartet Phylogeny Algorithms ⋮ The minimum evolution problem: Overview and classification ⋮ Unnamed Item ⋮ Network delay inference from additive metrics ⋮ Large-Scale Multiple Sequence Alignment and Phylogeny Estimation
This page was built for publication: