The Complexity of Constructing Evolutionary Trees Using Experiments
Gerth Stølting Brodal
January 2001 |
Abstract:
We present a tight upper and lower bound for constructing
evolutionary trees using experiments. We present an algorithm which
constructs an evolutionary tree of
![]() ![]() ![]() ![]() ![]() ![]() Available as PostScript, PDF, DVI. |