The complexity of constructing evolutionary trees using experiments

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2076 LNCS, Issue , 2001, Pages 140-151

  Brodal, Gerth Stølting ^a   Fagerberg, Rolf ^a   Pedersen, Christian N S ^a   Östlin, Anna ^b  

^a AARHUS UNIVERSITY   (Denmark)

^b LUND UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; EVOLUTIONARY ALGORITHMS; FORESTRY; COMPUTATIONAL LINGUISTICS;

ADVERSARY ARGUMENT; EVOLUTIONARY TREE; EXPERIMENT MODELING; LOWER BOUNDS; N SPECIES; RUNNING TIME; UPPER AND LOWER BOUNDS; UPPER BOUND;

TREES (MATHEMATICS);

EID: 84879517859     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48224-5_12     Document Type: Conference Paper

References (9)

1. A. Andersson. Improving partial rebuilding by using simple balance criteria. In Proc. 1st Workshop on Algorithms and Data Structures (WADS), volume 382 of Lecture Notes in Computer Science, pages 393-402. Springer-Verlag, 1989.
2. A. Andersson and T. W. Lai. Fast updating of well-balanced trees. In Proc. 2nd Scandinavian Workshop on Algorithm Theory (SWAT), volume 447 of Lecture Notes in Computer Science, pages 111-121. Springer-Verlag, 1990.
3. A. Borodin, L. J. Guibas, N. A. Lynch, and A. C. Yao. Efficient searching using partial ordering. Information Processing Letters, 12:71-75, 1981.
4. G. S. Brodal, S. Chaudhuri, and J. Radhakrishnan. The randomized complexity of maintaining the minimum. Nordic Journal of Computing, Selected Papers of the 5th Scandinavian Workshop on Algorithm Theory (SWAT), 3(4):337-351, 1996.
5. G. S. Brodal, R. Fagerberg, C. N. S. Pedersen, and A. Ostlin. The complexity of constructing evolutionary trees using experiments. Technical Report BRICS-RS-01-1, BRICS, Department of Computer Science, University of Aarhus, 2001.
6. S. K. Kannan, E. L. Lawler, and T. J. Warnow. Determining the evolutionary tree using experiments. Journal of Algorithms, 21:26-50, 1996.
7. M. Y. Kao, A. Lingas, and A. Ostlin. Balanced randomized tree splitting with applications to evolutionary tree constructions. In Proc. 16th Annual Symposium on Theoretical Aspects of Computer Science (STACS), pages 184-196, 1999.
8. A. Lingas, H. Olsson, and A. Ostlin. Efficient merging, construction, and maintenance of evolutionary trees. In Proc. 26th Int. Colloquium on Automata, Languages and Programming (ICALP), volume 1644 of Lecture Notes in Computer Science, pages 544-553. Springer-Verlag, 1999.
9. C. G. Sibley and J. E. Ahlquist. Phylogeny and classification of birds based on the data of DNA-DNA-hybridization. Current Ornithology, 1:245-292, 1983.