Combining polynomial running time and fast convergence for the disk-covering method.

DOI10.1016/S0022-0000(02)00005-3zbMath1059.68158MaRDI QIDQ1872716

Yanyan Li

Publication date: 14 May 2003

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

zbMATH Keywords

chordal graph theorem

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Genetics and epigenetics (92D10)

Related Items (1)

Fast neighbor joining

Cites Work

• Unnamed Item
• Unnamed Item
• Optimal algorithms for comparing trees with labeled leaves
• The performance of neighbor-joining methods of phylogenetic reconstruction
• A canonical decomposition theory for metrics on a finite set
• A characterisation of rigid circuit graphs
• Evolutionary Trees Can be Learned in Polynomial Time in the Two-State General Markov Model
• Efficient algorithms for inverting evolution
• On the Approximability of Numerical Taxonomy (Fitting Distances by Tree Metrics)
• A few logs suffice to build (almost) all trees (I)

This page was built for publication: Combining polynomial running time and fast convergence for the disk-covering method.