Defining binary phylogenetic trees using parsimony (Q6065678): 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: W3213146121 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the Balance of Unrooted Trees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4792088 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Phylogeny / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 13:49, 3 August 2024
scientific article; zbMATH DE number 7765572
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Defining binary phylogenetic trees using parsimony |
scientific article; zbMATH DE number 7765572 |
Statements
Defining binary phylogenetic trees using parsimony (English)
0 references
15 November 2023
0 references
phylogenetic tree
0 references
maximum parsimony
0 references
Buneman theorem
0 references
\(X\)-splits
0 references
