Towards a practical <it>O</it>(<it>n</it>log<it>n</it>) phylogeny algorithm
<p>Abstract</p> <p/> <p>Recently, we have identified a randomized quartet phylogeny algorithm that has <it>O</it>(<it>n</it>log<it>n</it>) runtime with high probability, which is asymptotically optimal. Our algorithm has high probability of...
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
BMC
2012-11-01
|
Series: | Algorithms for Molecular Biology |
Subjects: | |
Online Access: | http://www.almob.org/content/7/1/32 |