Publications related to 'k-reticulated' : A phylogenetic network is k-reticulated if for any vertex v of indegree at most 1, there are at most k vertices reached by at least two directed internally vertex-disjoint paths from v (that is paths whose only common vertices are the source and the target of the directed path). Also called k-articulated. More about binary 1-reticulated, 2-reticulated, 3-reticulated, k-reticulated on ISIPhyNC.
 
Order by:   Type | Year
           related to:
Associated keywords
2018
1
photophotophoto
Kuang-Yu Chang, Yun Cui, Siu-Ming Yiu and Wing-Kai Hon. Reconstructing One-Articulated Networks with Distance Matrices. In JCB, Vol. 25(3):253-269, 2018.  
Keywords: explicit network, from distances, k-reticulated, phylogenetic network, phylogeny, reconstruction.
       

2017
2
photophotophoto
Kuang-Yu Chang, Yun Cui, Siu-Ming Yiu and Wing-Kai Hon. Reconstructing One-Articulated Networks with Distance Matrices. In ISBRA17, Vol. 10330:34-45 of LNCS, Springer, 2017.  
Keywords: explicit network, from distances, k-reticulated, phylogenetic network, phylogeny, reconstruction.
Note: https://link.springer.com/content/pdf/10.1007%2F978-3-319-59575-7.pdf#page=100.
       

2013
3
photophotophotophotophotophoto
Hoa Vu, Francis Chin, Wing-Kai Hon, Henry Leung, Kunihiko Sadakane, Wing-Kin Sung and Siu-Ming Yiu. Reconstructing k-Reticulated Phylogenetic Network from a Set of Gene Trees. In ISBRA13, Vol. 7875:112-124 of LNCS, springer, 2013.  
Keywords: from rooted trees, k-reticulated, phylogenetic network, phylogeny, polynomial, Program ARTNET, Program CMPT, reconstruction.
Note: http://grid.cs.gsu.edu/~xguo9/publications/2013_Cloud%20computing%20for%20de%20novo%20metagenomic%20sequence%20assembly.pdf#page=123.
       
Toggle abstract