- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1432-0541
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
online resource.
- Erschienen in
-
Computing the Rooted Triplet Distance Between Phylogenetic Networks ; day:16 ; month:3 ; year:2021 ; pages:1-43
Algorithmica ; (16.3.2021), 1-43
- Urheber
- Beteiligte Personen und Organisationen
-
SpringerLink (Online service)
- DOI
-
10.1007/s00453-021-00802-1
- URN
-
urn:nbn:de:101:1-2021050319482653897320
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2025, 10:46 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
- Jansson, Jesper
- Mampentzidis, Konstantinos
- Rajaby, Ramesh
- Sung, Wing-Kin
- SpringerLink (Online service)
Ähnliche Objekte (12)
An interchange property for the rooted phylogenetic subnet diversity on phylogenetic networks
SPRIT: Identifying horizontal gene transfer in rooted phylogenetic trees
On the Complexity of Computing MP Distance Between Binary Phylogenetic Trees
Exploring the Tiers of Rooted Phylogenetic Network Space Using Tail Moves
Minimum triplet covers of binary phylogenetic X-trees
A practical O(n log2 n) time algorithm for computing the triplet distance on binary trees
Locally-rooted directors
Rooted Spanning Superpixels
Locally-rooted directors
Deciphering the recent phylogenetic expansion of the originally deeply rooted Mycobacterium tuberculosis lineage 7
5. Bulbous-rooted flowers.
Transnational Experts, Rooted Careers
An interchange property for the rooted phylogenetic subnet diversity on phylogenetic networks
SPRIT: Identifying horizontal gene transfer in rooted phylogenetic trees
On the Complexity of Computing MP Distance Between Binary Phylogenetic Trees
Exploring the Tiers of Rooted Phylogenetic Network Space Using Tail Moves
Minimum triplet covers of binary phylogenetic X-trees
A practical O(n log2 n) time algorithm for computing the triplet distance on binary trees
Locally-rooted directors
Rooted Spanning Superpixels
Locally-rooted directors
Deciphering the recent phylogenetic expansion of the originally deeply rooted Mycobacterium tuberculosis lineage 7
5. Bulbous-rooted flowers.
Transnational Experts, Rooted Careers
An interchange property for the rooted phylogenetic subnet diversity on phylogenetic networks
SPRIT: Identifying horizontal gene transfer in rooted phylogenetic trees
On the Complexity of Computing MP Distance Between Binary Phylogenetic Trees
Exploring the Tiers of Rooted Phylogenetic Network Space Using Tail Moves
Minimum triplet covers of binary phylogenetic X-trees
A practical O(n log2 n) time algorithm for computing the triplet distance on binary trees
Locally-rooted directors
Rooted Spanning Superpixels
Locally-rooted directors
Deciphering the recent phylogenetic expansion of the originally deeply rooted Mycobacterium tuberculosis lineage 7
5. Bulbous-rooted flowers.