Shortest triplet clustering: reconstructing large phylogenies using representative sets
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1471-2105
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
online resource.
- Erschienen in
-
Shortest triplet clustering: reconstructing large phylogenies using representative sets ; volume:6 ; number:1 ; day:08 ; month:4 ; year:2005 ; pages:1-14 ; date:12.2005
BMC bioinformatics ; 6, Heft 1 (08.4.2005), 1-14, 12.2005
- Urheber
-
Sy Vinh, Le
- Beteiligte Personen und Organisationen
-
von Haeseler, Arndt
SpringerLink (Online service)
- DOI
-
10.1186/1471-2105-6-92
- URN
-
urn:nbn:de:1111-2016021620642
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:32 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Sy Vinh, Le
- von Haeseler, Arndt
- SpringerLink (Online service)
Ähnliche Objekte (12)
Selective clustering for representative paintings selection
Informative and Representative Triplet Selection for Multilabel Remote Sensing Image Retrieval
Acceleration of Shortest Path and Constrained Shortest Path Computation
Shortest Paths II
Universal Shortest Paths
Triplet‐triplet Annihilation Dynamics of Naphthalene
Reconstructing social mixing patterns via weighted contact matrices from online and representative surveys
Shortest path network problems
Distributed shortest-path computation
Sect. 3: shortest paths - Application 3: fastest train connection: Section 3: shortest path
Minimally-invasive Theranostics based on Triplet-Triplet Annihilation
The shortest history of Germany
Selective clustering for representative paintings selection
Informative and Representative Triplet Selection for Multilabel Remote Sensing Image Retrieval
Acceleration of Shortest Path and Constrained Shortest Path Computation
Shortest Paths II
Universal Shortest Paths
Triplet‐triplet Annihilation Dynamics of Naphthalene
Reconstructing social mixing patterns via weighted contact matrices from online and representative surveys
Shortest path network problems
Distributed shortest-path computation
Sect. 3: shortest paths - Application 3: fastest train connection: Section 3: shortest path
Minimally-invasive Theranostics based on Triplet-Triplet Annihilation
The shortest history of Germany
Selective clustering for representative paintings selection
Informative and Representative Triplet Selection for Multilabel Remote Sensing Image Retrieval
Acceleration of Shortest Path and Constrained Shortest Path Computation
Shortest Paths II
Universal Shortest Paths
Triplet‐triplet Annihilation Dynamics of Naphthalene
Reconstructing social mixing patterns via weighted contact matrices from online and representative surveys
Shortest path network problems
Distributed shortest-path computation
Sect. 3: shortest paths - Application 3: fastest train connection: Section 3: shortest path
Minimally-invasive Theranostics based on Triplet-Triplet Annihilation