Reference : Algorithms For Phylogeny Reconstruction In a New Mathematical Model
Scientific journals : Article
Engineering, computing & technology : Computer science
Computational Sciences
Algorithms For Phylogeny Reconstruction In a New Mathematical Model
Lenzini, Gabriele mailto [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) >]
Marianelli, Silvia [> >]
Yes (verified by ORBilu)
[en] 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.
From 1998 Calcolo is published by Springer
ISBN 0008-0624

There is no file associated with this reference.

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.