The complexity of constructing evolutionary trees using experiments (2001)

by Gerth Stølting Brodal , Rolf Fagerberg , Christian N. S. Pedersen , Anna Östlin
Citations:8 - 1 self

Documents Related by Co-Citation

23 An Optimal Algorithm to Reconstruct Trees from Additive Distance Data – J J Hein - 1989
16 Determining the evolutionary tree using experiments – S K Kannan, E L Lawler, T J Warnow - 1996
17 A fast algorithm for constructing trees from distance matrices – J C Culberson, P Rudnicki - 1989
878 Parameterized Complexity – Rod G. Downey, Michael R. Fellows, Rolf Niedermeier, Peter Rossmanith, Rod G. Downey (wellington, New Zeal, Michael R. Fellows (newcastle, Rolf Niedermeier (tubingen, Peter Rossmanith (tu Munchen - 1998
78 A Robust Model for Finding Optimal Evolutionary Trees – Martin Farach, Sampath Kannan, Tandy Warnow - 1993
428 Property Testing and its connection to Learning and Approximation – Oded Goldreich, Shafi Goldwasser, Dana Ron
905 Algorithms on Strings, Trees and Sequences – D Gusfield - 1999
983 Evolutionary trees from DNA sequences: A maximum likelihood approach – J Felsenstein - 1981
2364 The neighbor-joining method: A new method for reconstructing phylogenetic trees – N Saitou, M Nei - 1987