Counting and optimising maximum phylogenetic diversity sets (Q2161386): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: The minimum latency problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Optimizing phylogenetic diversity across two trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Lexicographic multi-objective linear programming using grossone methodology: theory and algorithm / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Topological sorting of large networks / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Optimizing phylogenetic diversity under constraints / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Phylogeny / rank | |||
Normal rank |
Revision as of 19:32, 29 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Counting and optimising maximum phylogenetic diversity sets |
scientific article |
Statements
Counting and optimising maximum phylogenetic diversity sets (English)
0 references
4 August 2022
0 references
phylogenetic tree
0 references
phylogenetic diversity
0 references
biodiversity measures
0 references
optimisation
0 references
enumeration
0 references
algorithms
0 references
0 references