Finding a maximum compatible tree is NP-hard for sequences and trees (Q1921170)
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: Finding a maximum compatible tree is NP-hard for sequences and trees |
scientific article; zbMATH DE number 915076
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding a maximum compatible tree is NP-hard for sequences and trees |
scientific article; zbMATH DE number 915076 |
Statements
Finding a maximum compatible tree is NP-hard for sequences and trees (English)
0 references
11 August 1996
0 references
DNA sequences
0 references
leaf-labelled trees
0 references
sequences
0 references
compatibility
0 references
phylogenetic analysis
0 references
NP-hard
0 references
aligned 2-state sequences
0 references
