Do triplets have enough information to construct the multi-labeled phylogenetic tree?
10.1371/journal.pone.0103622
Saved in:
Main Authors: | Hassanzadeh R., Eslahchi C., Sung W.-K. |
---|---|
Other Authors: | DEPARTMENT OF COMPUTER SCIENCE |
Format: | Article |
Published: |
Public Library of Science
2018
|
Online Access: | http://scholarbank.nus.edu.sg/handle/10635/142466 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Similar Items
-
Computing a smallest multi-labeled phylogenetic tree from rooted triplets
by: Guillemot, S., et al.
Published: (2013) -
Constructing phylogenetic supernetworks based on simulated annealing
by: Hassanzadeh, R., et al.
Published: (2013) -
Computing a smallest multilabeled phylogenetic tree from rooted triplets
by: Guillemot, S., et al.
Published: (2013) -
Inferring phylogenetic relationships avoiding forbidding rooted triplets
by: He, Y.-J., et al.
Published: (2013) -
Inferring phylogenetic relationships avoiding Forbidden rooted triplets
by: He, Y.-J., et al.
Published: (2013)