Absolute convergence: true trees from short sequences
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Fast recovery of evolutionary trees with thousands of nodes
RECOMB '01 Proceedings of the fifth annual international conference on Computational biology
Steps toward accurate reconstructions of phylogenies from gene-order data
Journal of Computer and System Sciences - Computational biology 2002
SAICSIT '03 Proceedings of the 2003 annual research conference of the South African institute of computer scientists and information technologists on Enablement through technology
A practical algorithm for ancestral rearrangement reconstruction
WABI'11 Proceedings of the 11th international conference on Algorithms in bioinformatics
| Hi-index | 4.10 |
Systematists study how a group of genes or organisms evolved. These biologists now have set their sights on the Tree of Life challenge: to reconstruct the evolutionary history of all knownliving organisms.A typical phylogenetic reconstruction starts with biomolecular data, such as DNA sequences for modern organisms, and builds a tree, or phylogeny, for these sequences that represents a hypothesized evolutionary history. Finding the best tree for a data set can be a computationally intensive problem.Phylogenetic software for mapping the Tree of Life will require entirely new approaches in statistical models of evolution, high-performance implementations, and data analysis and visualization. The authors have developed polynomial algorithmic techniques for use in their research addressing phylogeny reconstruction from biomolecular sequences, focusing on theaccuracy of reconstructions and the use of simulations.