Simple but Fundamental Limitations on Supertree and Consensus Tree Methods | Zendy

Mike Steel | Zendy; Andreas Dress | Zendy; Sebastian Böcker | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Simple but Fundamental Limitations on Supertree and Consensus Tree Methods

Author(s) -

Mike Steel,

Andreas Dress,

Sebastian Böcker

Publication year - 2000

Publication title -

systematic biology

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 7.128

H-Index - 182

eISSN - 1076-836X

pISSN - 1063-5157

DOI - 10.1093/sysbio/49.2.363

Subject(s) - supertree , biology , simple (philosophy) , tree (set theory) , computational biology , mathematics , phylogenetic tree , combinatorics , genetics , epistemology , philosophy , gene

el,1992).The search for "good" new algorithms to amalgamate trees is topical, particularly for thesupertree problem because existing methods appear to have certain limitations, and to besomewhat ad-hoc: a common supertree method is to re-code trees by characters and applymaximum parsimony reconstruction; see for example, Baum (1992), Ragan (1992), Purvis(1995b) and Sanderson et al. (1998).The purpose of this note is to point out that there exist inherent limitations to what any...

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research