- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1471-2105
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
Triplet supertree heuristics for the tree of life ; volume:10 ; number:1 ; day:30 ; month:1 ; year:2009 ; pages:1-12 ; date:1.2009
BMC bioinformatics ; 10, Heft 1 (30.1.2009), 1-12, 1.2009
- Creator
-
Lin, Harris T.
- Contributor
-
Burleigh, J Gordon
Eulenstein, Oliver
SpringerLink (Online service)
- DOI
-
10.1186/1471-2105-10-S1-S8
- URN
-
urn:nbn:de:1111-2016021713605
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:31 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Lin, Harris T.
- Burleigh, J Gordon
- Eulenstein, Oliver
- SpringerLink (Online service)
Other Objects (12)
Heuristics for the K-Cardinality Tree and Subgraph Problems
Using tree diversity to compare phylogenetic heuristics
Minimum triplet covers of binary phylogenetic X-trees
Degree heuristics for matching
Degree heuristics for matching
Philosophical heuristics
Relaxation heuristics for numeric planning
Meta-heuristics for portfolio optimization
Heuristics are Tools for Uncertainty
Triplet‐triplet Annihilation Dynamics of Naphthalene
Self-adaptive heuristics for evolutionary computation
Heuristics for demand : driven disassembly planning
Heuristics for the K-Cardinality Tree and Subgraph Problems
Using tree diversity to compare phylogenetic heuristics
Minimum triplet covers of binary phylogenetic X-trees
Degree heuristics for matching
Degree heuristics for matching
Philosophical heuristics
Relaxation heuristics for numeric planning
Meta-heuristics for portfolio optimization
Heuristics are Tools for Uncertainty
Triplet‐triplet Annihilation Dynamics of Naphthalene
Self-adaptive heuristics for evolutionary computation
Heuristics for demand : driven disassembly planning
Heuristics for the K-Cardinality Tree and Subgraph Problems
Using tree diversity to compare phylogenetic heuristics
Minimum triplet covers of binary phylogenetic X-trees
Degree heuristics for matching
Degree heuristics for matching
Philosophical heuristics
Relaxation heuristics for numeric planning
Meta-heuristics for portfolio optimization
Heuristics are Tools for Uncertainty
Triplet‐triplet Annihilation Dynamics of Naphthalene
Self-adaptive heuristics for evolutionary computation