Computing the Rooted Triplet Distance Between Phylogenetic Networks
10.1007/s00453-021-00802-1
Saved in:
Main Authors: | Jansson, Jesper, Mampentzidis, Konstantinos, Rajaby, Ramesh, Sung, Wing-Kin |
---|---|
Other Authors: | DEPARTMENT OF COMPUTER SCIENCE |
Format: | Article |
Published: |
Springer
2022
|
Subjects: | |
Online Access: | https://scholarbank.nus.edu.sg/handle/10635/232229 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Similar Items
-
Algorithms for combining rooted triplets into a galled phylogenetic network
by: Jansson, J., et al.
Published: (2013) -
Inferring a level-1 phylogenetic network from a dense set of rooted triplets
by: Jansson, J., et al.
Published: (2013) -
Inferring phylogenetic relationships avoiding forbidding rooted triplets
by: He, Y.-J., et al.
Published: (2013) -
Computing a smallest multilabeled phylogenetic tree from rooted triplets
by: Guillemot, S., et al.
Published: (2013) -
Computing the Rooted Triplet Distance Between Phylogenetic Networks
by: Jansson, Jesper, et al.
Published: (2019)