Algorithms For Phylogeny Reconstruction In a New Mathematical Model

Share/Save/Bookmark

Lenzini, Gabriele and Marianelli, Silvia (1997) Algorithms For Phylogeny Reconstruction In a New Mathematical Model. Calcolo - A Quarterly on Numerical Analysis and Theory of Computation, 1-4 (34). pp. 1-24. ISSN 0008-0624

[img]
Preview
PDF
302Kb
Abstract:The evolutionary history of a set of species is represented by a tree called phylogenetic tree or phylogeny. Its structure depends on precise biological assumptions about the evolution of species. Problems related to phylogeny reconstruction (i.e., finding a tree representation of information regarding a set of items) are widely studied in computer science. Most of these problems have found to be NP-hard. Sometimes they can solved polynomially if appropriate restrictions on the structure of the tree are fixed. This paper summarizes the most recent problems and results in phylogeny reconstruction, and introduces an innovative tree model, called Phylogenetic Parsimonious Tree, which is justified by significant biological hypothesis. Using PPT two problems are studied: the existence and the reconstruction of a tree both when sequences of characters and partial order on interspecies distances are given. We rove complexity results that confirm the hardness of this class of problems.
Item Type:Article
Copyright:© 1997 Springer
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Link to this item:http://purl.utwente.nl/publications/64234
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page