scientific article; zbMATH DE number 1754590

zbMATH Open0986.68100MaRDI QIDQ4535015FDOQ4535015

Authors: Gerth Stølting Brodal, Rolf Fagerberg, Christian Nørgaard Storm Pedersen, Anna Östlin 

Publication date: 12 June 2002

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2076/20760140

Title of this publication is not available (Why is that?)

Recommendations

• Efficient merging and construction of evolutionary trees
• scientific article; zbMATH DE number 2079368
• Determining the Evolutionary Tree Using Experiments
• A robust model for finding optimal evolutionary tree
• scientific article; zbMATH DE number 1088267

Mathematics Subject Classification ID

Problems related to evolution (92D15) Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cited In (9)

• Learning a bounded-degree tree using separator queries
• On the longest path algorithm for reconstructing trees from distance matrices
• Determining the Evolutionary Tree Using Experiments
• Title not available (Why is that?)
• Efficient merging and construction of evolutionary trees
• Research in Computational Molecular Biology
• A new linear-time algorithm for centroid decomposition
• Title not available (Why is that?)
• Adaptive learning of compressible strings

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4535015)