An \(O(n\log n)\)-time algorithm for the maximum constrained agreement subtree problem for binary trees (Q845850)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An \(O(n\log n)\)-time algorithm for the maximum constrained agreement subtree problem for binary trees |
scientific article; zbMATH DE number 5664706
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An \(O(n\log n)\)-time algorithm for the maximum constrained agreement subtree problem for binary trees |
scientific article; zbMATH DE number 5664706 |
Statements
An \(O(n\log n)\)-time algorithm for the maximum constrained agreement subtree problem for binary trees (English)
0 references
29 January 2010
0 references
design of algorithms
0 references
maximum agreement subtree
0 references
phylogenetic analysis
0 references
0 references
