The Complexity of Constructing Evolutionary Trees Using Experiments

We present tight upper and lower bounds for the problem of constructing evolutionary trees in the experiment model. We describe an algorithm which constructs an evolutionary tree of n species in time O(nd logd n) using at most n⌈d/2⌉(log2ċd/2ċ 1 n+O(1)) experiments for d > 2, and at most n(log n+O(1)) experiments for d = 2, where d is the degree of the tree. This improves the previous best upper bound by a factor Θ(log d). For d = 2 the previously best algorithm with running time O(n log n) had a bound of 4n log n on the number of experiments. By an explicit adversary argument, we show an Ω(nd logd n) lower bound, matching our upper bounds and improving the previous best lower bound by a factor Θ(logd n). Central to our algorithm is the construction and maintenance of separator trees of small height, which may be of independent interest.

[1]  C. Jordan.  Sur les assemblages de lignes. , 1869 .

[2]  Frank Harary,et al.  Graph Theory , 2016 .

[3]  A. J. Goldman.  Optimal Center Location in Simple Networks , 1971 .

[4]  Allan Borodin,et al.  Efficient Searching Using Partial Ordering , 1981, Inf. Process. Lett..

[5]  Nimrod Megiddo,et al.  Applying parallel computation algorithms in the design of serial algorithms , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[6]  Nimrod Megiddo,et al.  An O(n log2 n) Algorithm for the k-th Longest Path in a Tree with Applications to Location Problems , 1981, SIAM J. Comput..

[7]  Robert E. Tarjan,et al.  A data structure for dynamic trees , 1981, STOC '81.

[8]  Jon E. Ahlquist,et al.  Phylogeny and classification of birds based on the data of DNA-DNA hybridization , 1983 .

[9]  Greg N. Frederickson,et al.  Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications , 1985, SIAM J. Comput..

[10]  Arne Andersson,et al.  Improving Partial Rebuilding by Using Simple Balance Criteria , 1989, WADS.

[11]  Arne Andersson,et al.  Fast Updating of Well-Balanced Trees , 1990, SWAT.

[12]  Greg N. Frederickson,et al.  Ambivalent data structures for dynamic 2-edge-connectivity and k smallest spanning trees , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[13]  Jaikumar Radhakrishnan,et al.  The Randomized Complexity of Maintaining the Minimum , 1996, Nord. J. Comput..

[14]  Eugene L. Lawler,et al.  Determining the Evolutionary Tree Using Experiments , 1996, J. Algorithms.

[15]  Mikkel Thorup,et al.  Minimizing Diameters of Dynamic Trees , 1997, ICALP.

[16]  Ming-Yang Kao,et al.  Balanced Randomized Tree Splitting with Applications to Evolutionary Tree Constructions , 1999, STACS.

[17]  Andrzej Lingas,et al.  Efficient Merging, Construction, and Maintenance of Evolutionary Trees , 1999, ICALP.

[18]  Lasse Nielsen,et al.  A Denotational Investigation of Defunctionalization , 2000 .

[19]  Peter D. Mosses.  CASL for CafeOBJ Users , 2000 .

[20]  Peter D. Mosses.  Modularity in Meta-Languages , 2000 .

[21]  Zhe Yang,et al.  Reasoning About Code-Generation in Two-Level Languages , 2000 .

[22]  Marcin Jurdziński,et al.  A Discrete Stratety Improvement Algorithm for Solving Parity Games , 2000 .

[23]  Mikkel Thorup,et al.  Maintaining Center and Median in Dynamic Trees , 2000, SWAT.

[24]  Louis Salvail,et al.  How to Convert the Flavor of a Quantum Bit Commitment , 2001, EUROCRYPT.

[25]  Gerth Stølting Brodal,et al.  The Complexity of Constructing Evolutionary Trees Using Experiments , 2001 .