scientific article; zbMATH DE number 1088266

MaRDI QIDQ4364582zbMATH OpenFDO

Authors Vincent Berry, O. Gascuel

Publication date 10 November 1998

zbMATH Keywords

Cavender-Farris model of evolutionevolutionary treequartet reconstruction method

Mathematics Subject Classification ID

Trees (05C05) Applications of graph theory (05C90) Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10) Problems related to evolution (92D15)

Recommendations

• Inferring evolutionary trees with strong combinatorial evidence
• A polynomial time approximation scheme for inferring evolutionary trees from quartet topologies and its application
• Constructing big trees from short sequences
• scientific article; zbMATH DE number 1302377

Cited in

(12)

• A combinatorial description of the closest tree algorithm for finding evolutionary trees
• Inferring evolutionary trees with strong combinatorial evidence
• A polynomial time algorithm for constructing the refined Buneman tree
• A few logs suffice to build (almost) all trees. II
• The large-sample asymptotic behaviour of quartet-based summary methods for species tree inference
• A polynomial time approximation scheme for inferring evolutionary trees from quartet topologies and its application
• scientific article; zbMATH DE number 5003290 (Why is no real title available?)
• scientific article; zbMATH DE number 1305415 (Why is no real title available?)
• scientific article; zbMATH DE number 637307 (Why is no real title available?)
• A property tester for tree-likeness of quartet topologies
• A polynomial time algorithm for the minimum quartet inconsistency problem with O(n) quartet errors
• A constructive algorithm for realizing a distance matrix

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 Q4364582)