On the Complexity of Constructing Evolutionary Trees

Approximation Algorithms for NP-Hard Problems

Dorit S. Hochba · ACM SIGACT News · 1997 · 3.1K citations · Full text

Computing, Computer Science, Mathematics +13

Approximation algorithms for combinatorial problems

David S. Johnson · Journal of Computer and System Sciences · 1974 · 2.2K citations

Natural Sciences, Computer Science, Mathematics +12

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 · 413 citations

Computing, Computer Science, Algebra +12

On the Size of Systems of Sets Every <i>t</i> of which Have an SDR, with an Application to the Worst-Case Ratio of Heuristics for Packing Problems

C.A.J. Hurkens, Alexander Schrijver · SIAM Journal on Discrete Mathematics · 1989 · 266 citations · Full text

Natural Sciences, Computer Science, Mathematics +13

On the complexity of comparing evolutionary trees

Jotun Hein, Tao Jiang, Lusheng Wang et al. · Discrete Applied Mathematics · 1996 · 239 citations

Life Sciences, Biology, Evolutionary Biology +12