Minimal Phylogenetic Supertrees and Local Consensus Trees

Minimal Phylogenetic Supertrees and Local Consensus Trees

The problem of constructing a <em>minimally resolved phylogenetic supertree</em> (i.e., a rootedtree having the smallest possible number of internal nodes) that contains all of the rooted triplets froma consistent set <em>R</em> is known to be NP-hard. In this article, we pro...

Full description

Bibliographic Details
Main Authors: Jesper Jansson, Ramesh Rajaby, Wing-Kin Sung
Format: Article
Language:English
Published: American Institute of Mathematical Sciences 2018-05-01
Series:AIMS Medical Science
Subjects:
Phylogenetic tree
rooted triplet
local consensus
minimal supertree
algorithms
computational complexity
Online Access:http://www.aimspress.com/medicalScience/article/2012/fulltext.html

Internet

http://www.aimspress.com/medicalScience/article/2012/fulltext.html

Similar Items