Computing a smallest multilabeled phylogenetic tree from rooted triplets
10.1109/TCBB.2010.77
Saved in:
Main Authors: | Guillemot, S., Jansson, J., Sung, W.-K. |
---|---|
Other Authors: | COMPUTER SCIENCE |
Format: | Article |
Published: |
2013
|
Subjects: | |
Online Access: | http://scholarbank.nus.edu.sg/handle/10635/39451 |
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) -
Computing the Rooted Triplet Distance Between Phylogenetic Networks
by: Jansson, Jesper, et al.
Published: (2022) -
Inferring a level-1 phylogenetic network from a dense set of rooted triplets
by: Jansson, J., et al.
Published: (2013) -
Polynomial-time algorithms for building a consensus MUL-tree
by: Cui, Y., et al.
Published: (2013) -
Inferring phylogenetic relationships avoiding forbidding rooted triplets
by: He, Y.-J., et al.
Published: (2013)