Paper Info
Title
COSPEDTree-II: Improved couplet based phylogenetic supertree
Abstract
Phylogenetic supertrees synthesize a set of phylogenetic trees carrying overlapping taxa set, preferably with the consensus topologies of individual taxa subsets. Supertree construction is an NP-hard problem, and the methods based on decomposition and synthesis of fixed size subtree topologies (such as triplets or quartets) are the most popular. Time and space complexities of these methods, however, depend on the subtree size considered. Our earlier work proposed a couplet (taxa pair) based supertree method COSPEDTree, which produces slightly conservative (not fully resolved) supertrees. Here we propose its improved version COSPEDTree-II, which produces better resolved supertrees with lower number of missing branches, and incurs much lower running time.
Year
DOI
Venue
2016
10.1109/BIBM.2016.7822499
2016 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)
Keywords
Field
DocType
Phylogenetic tree,Supertree,Couplet,Directed Acyclic Graph (DAG),Equivalence Relation,Transitive reduction,Internode count
Cut,Maximum parsimony,Phylogenetic tree,Biology,Tree (data structure),Algorithm,Network topology,Supertree,Heuristics,Local search (optimization)
Conference
ISSN
ISBN
Citations 
2156-1125
978-1-5090-1612-9
0
PageRank 
References 
Authors
0.34
10
2
Name
Order
Citations
PageRank
Sourya Bhattacharyya1174.35
Jayanta Mukhopadhyay27226.05