Computational Grand Challenges in Assembling the Tree of Life: Problems and Solutions

Document Type

Article

Publication Date

11-23-2006

Abstract

The computation of ever larger as well as more accurate phylogenetic (evolutionary) trees with the ultimate goal to compute the tree of life represents one of the grand challenges in High Performance Computing (HPC) Bioinformatics. Unfortunately, the size of trees which can be computed in reasonable time based on elaborate evolutionary models is limited by the severe computational cost inherent to these methods. There exist two orthogonal research directions to overcome this challenging computational burden: First, the development of novel, faster, and more accurate heuristic algorithms and second, the application of high performance computing techniques. The goal of this chapter is to provide a comprehensive introduction to the field of computational evolutionary biology to an audience with computing background, interested in participating in research and/or commercial applications of this field. Moreover, we will cover leading-edge technical and algorithmic developments in the field and discuss open problems and potential solutions. © 2006 Elsevier Inc. All rights reserved.

Identifier

33751114437 (Scopus)

ISBN

[0120121689, 9780120121687]

Publication Title

Advances in Computers

External Full Text Location

https://doi.org/10.1016/S0065-2458(06)68004-2

ISSN

00652458

First Page

127

Last Page

176

Volume

68

Grant

ACI-00-93039

Fund Ref

National Science Foundation

This document is currently not available here.

Share

COinS