Defining binary phylogenetic trees using parsimony: new bounds (Q6069172): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4386435185 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Menger's Theorem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Defining binary phylogenetic trees using parsimony / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4792088 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 13:19, 3 August 2024
scientific article; zbMATH DE number 7764562
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Defining binary phylogenetic trees using parsimony: new bounds |
scientific article; zbMATH DE number 7764562 |
Statements
Defining binary phylogenetic trees using parsimony: new bounds (English)
0 references
13 November 2023
0 references
maximum parsimony
0 references
phylogenetic tree
0 references
Buneman theorem
0 references
