Fast algorithms for computing the tripartition-based distance between phylogenetic networks
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Saved in:
Main Authors: | Nguyen, N.B., Thach Nguyen, C., Sung, W.-K. |
---|---|
Other Authors: | COMPUTER SCIENCE |
Format: | Conference or Workshop Item |
Published: |
2013
|
Online Access: | http://scholarbank.nus.edu.sg/handle/10635/41502 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Similar Items
-
Fast algorithms for computing the tripartition-based distance between phylogenetic networks
by: Nguyen, N.B., et al.
Published: (2013) -
Computing the Rooted Triplet Distance Between Phylogenetic Networks
by: Jansson, Jesper, et al.
Published: (2019) -
Computing the Rooted Triplet Distance Between Phylogenetic Networks
by: Jansson, Jesper, et al.
Published: (2022) -
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)