Constructing a smallest refining galled phylogenetic network
Lecture Notes in Bioinformatics (Subseries of Lecture Notes in Computer Science)
Saved in:
Main Authors: | Huynh, T.N.D., Jansson, J., Nguyen, N.B., Sung, W.-K. |
---|---|
Other Authors: | COMPUTER SCIENCE |
Format: | Conference or Workshop Item |
Published: |
2013
|
Online Access: | http://scholarbank.nus.edu.sg/handle/10635/40451 |
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) -
Algorithms for combining rooted triplets into a galled phylogenetic network
by: Jansson, J., et al.
Published: (2013) -
Computing a smallest multilabeled phylogenetic tree from rooted triplets
by: Guillemot, S., et al.
Published: (2013) -
Computing a smallest multi-labeled 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)