Publications related to 'nearly-stable network' : A phylogenetic network is nearly stable if for each vertex v of the network, either v is stable (that is there exists a leaf such that v is on all paths from the root to v) or one of its parents is stable.
 
Order by:   Type | Year
           related to:
Associated keywords
Article (Journal)
1
photophotophotophotophoto
Philippe Gambette, Andreas Gunawan, Anthony Labarre, Stéphane Vialette and Louxin Zhang. Solving the Tree Containment Problem in Linear Time for Nearly Stable Phylogenetic Networks. In DAM, Vol. 246:62-79, 2018.
Keywords: explicit network, from network, from rooted trees, nearly-stable network, phylogenetic network, phylogeny, polynomial, tree containment.
Note: https://hal-upec-upem.archives-ouvertes.fr/hal-01575001/en/.
       

InProceedings
2
photophotophotophotophoto
Philippe Gambette, Andreas Gunawan, Anthony Labarre, Stéphane Vialette and Louxin Zhang. Locating a Tree in A Phylogenetic Network in Quadratic Time. In RECOMB15, Vol. 9029:96-107 of LNCS, Springer, 2015.
Keywords: evaluation, explicit network, from network, from rooted trees, genetically stable network, nearly-stable network, phylogenetic network, phylogeny, polynomial, tree containment.
Note: https://hal.archives-ouvertes.fr/hal-01116231/en.
       

3
photophotophoto
Jittat Fakcharoenphol, Tanee Kumpijit and Attakorn Putwattana. A Faster Algorithm for the Tree Containment Problem for Binary Nearly Stable Phylogenetic Networks. In Proceedings of the The 12th International Joint Conference on Computer Science and Software Engineering (JCSSE'15), Pages 337-342, IEEE, 2015.
Keywords: dynamic programming, explicit network, from network, from rooted trees, nearly-stable network, phylogenetic network, phylogeny, polynomial, tree containment.
       

4
photo
Mathias Weller. Linear-Time Tree Containment in Phylogenetic Networks. In RECOMB-CG18, Vol. 11183:309-323 of LNCS, Springer, 2018.
Keywords: explicit network, from network, from rooted trees, nearly-stable network, phylogenetic network, phylogeny, polynomial, reconstruction, reticulation-visible network, tree containment.
Note: https://arxiv.org/abs/1702.06364.
       

5
photo
Louxin Zhang. Recent Progresses in the Combinatorial and Algorithmic Study of Rooted Phylogenetic Networks. In WALCOM20, Vol. 12049:22-27 of LNCS, Springer, 2020.
Keywords: cluster containment, galled network, galled tree, nearly-stable network, phylogenetic network, phylogeny, polynomial, reticulation-visible network, survey, time consistent network, tree containment, tree-based network, tree-child network.
       

PhdThesis
6
photo
Andreas Gunawan. On the tree and cluster containment problems for phylogenetic networks. PhD thesis, National University of Singapore, 2018.
Keywords: cluster containment, explicit network, galled network, genetically stable network, nearly-stable network, phylogenetic network, phylogeny, reticulation-visible network, tree containment.
Note: https://scholarbank.nus.edu.sg/handle/10635/144270.
       

Misc
7
photophoto
Andreas Gunawan and Louxin Zhang. Bounding the Size of a Network Defined By Visibility Property. 2015.
Keywords: bound, explicit network, galled network, nearly-stable network, phylogenetic network, phylogeny, reticulation-visible network, stable-child network.
Note: http://arxiv.org/abs/1510.00115.