Linear Time Algorithm for Tree-Child Network Containment
暂无分享,去创建一个
[1] Andreas D. M. Gunawan. Solving the Tree Containment Problem for Reticulation-Visible Networks in Linear Time , 2018, AlCoB.
[2] Andreas Gunawan. Solving Tree Containment Problem for Reticulation-visible Networks with Optimal Running Time , 2017, ArXiv.
[3] Gabriel Cardona,et al. Generation of Tree-Child phylogenetic networks , 2019, ArXiv.
[4] Louxin Zhang,et al. Solving the Tree Containment Problem for Genetically Stable Networks in Quadratic Time , 2015, IWOCA.
[5] Steven Kelk,et al. Networks: expanding evolutionary thinking. , 2013, Trends in genetics : TIG.
[6] Ge Xia,et al. Seeing the trees and their branches in the network is hard , 2007, Theor. Comput. Sci..
[7] Simone Linz,et al. Attaching leaves and picking cherries to characterise the hybridisation number for a set of phylogenies , 2017, Adv. Appl. Math..
[8] Leo van Iersel,et al. Locating a tree in a phylogenetic network , 2010, Inf. Process. Lett..
[9] D. Morrison,et al. Networks in phylogenetic analysis: new tools for population biology. , 2005, International journal for parasitology.
[10] Louxin Zhang,et al. Solving the tree containment problem in linear time for nearly stable phylogenetic networks , 2017, Discret. Appl. Math..
[11] Gabriel Cardona,et al. Comparison of Tree-Child Phylogenetic Networks , 2007, IEEE/ACM Transactions on Computational Biology and Bioinformatics.
[12] Gabriel Cardona,et al. Generation of Binary Tree-Child phylogenetic networks , 2019, PLoS Comput. Biol..
[13] Leo van Iersel,et al. Deciding the existence of a cherry-picking sequence is hard on two trees , 2017, Discret. Appl. Math..