Constructing the Maximum Consensus Tree from Rooted Triples

The complexity of reconstructing trees from qualitative characters and subtrees

Journal of Classification · 1992 · 525 citations

Tree Language, Combinatorics On Word, Computational Complexity Theory +14

Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions

A. V. Aho, Yehoshua Sagiv, Thomas G. Szymanski et al. · SIAM Journal on Computing · 1981 · 412 citations

Relational Database, Engineering, Computational Complexity +19

Reconstruction of rooted trees from subtrees

Meei Pyng Ng, Nicholas Wormald · Discrete Applied Mathematics · 1996 · 86 citations

Tree Language, Graph Theory, Decision Tree +3

Minimum cuts in near-linear time

David R. Karger · 1996 · 60 citations · Full text

On the Complexity of Constructing Evolutionary Trees

Leszek Gąsieniec, Jesper Jansson, Andrzej Lingas et al. · Journal of Combinatorial Optimization · 1999 · 55 citations