作者: David Bryant , Charles Semple , Mike Steel
DOI: 10.1007/978-1-4020-2330-9_7
关键词:
摘要: There are many ways to combine rooted phylogenetic trees with overlapping leaf sets into a single “supertree”. The most widely used method is MRP (matrix representation parsimony analysis), but other direct methods have been developed recently. However, all these utilize typically only the discrete topology of input and ignore information that might be available. Based, for example, on fossil data or molecular dating techniques, this includes whether one particular divergence event occurred earlier later than another, actual time estimates events. ability include such in supertree construction could allow more accurate certain species divergences. This topical problem recent biological literature. In chapter, we describe way incorporate fast exact algorithm extends classic Build algorithm. approach somewhat flexible it allows any combination relative and/or absolute times. addition extension, last section chapter consists applications problems phylogenetics are, general, computationally challenging.