An \(O(n\log n)\)-time algorithm for the maximum constrained agreement subtree problem for binary trees (Q845850)
From MaRDI portal
scientific article
| 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 |
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
0 references
