Who is Who in Phylogenetic Networks

Publications related to 'enumeration'   Order by:   Type | Year

Only And Or     related to:

Associated keywords

counting enumeration explicit-network exponential-algorithm from-sequences galled-network galled-tree generation NNI-moves normal-network parsimony phylogenetic-network phylogeny Program-PhyloNetwork Program-TCGenerators reconstruction software tree-child-network unicyclic-network

Article (Journal)

1 Gabriel Cardona and Louxin Zhang. Counting and Enumerating Tree-Child Networks and Their Subclasses. In JCSS, Vol. 114:84-104, 2020. Keywords: counting, enumeration, explicit network, galled network, galled tree, normal network, phylogenetic network, phylogeny, tree-child network.         2 Louxin Zhang. Generating normal networks via leaf insertion and nearest neighbor interchange. In BMC Bioinformatics, Vol. 20(642):1-9, 2019. Keywords: enumeration, explicit network, generation, NNI moves, phylogenetic network, phylogeny. Note: https://link.springer.com/content/pdf/10.1186/s12859-019-3209-3.pdf.         3 Andreas Gunawan, Jeyaram Rathin and Louxin Zhang. Counting and enumerating galled networks. In DAM, Vol. 283:644-654, 2020. Keywords: counting, enumeration, explicit network, galled network, phylogenetic network, phylogeny. Note: https://arxiv.org/abs/1812.08569.         4 Gabriel Cardona, Joan Carles Pons and Celine Scornavacca. Generation of Binary Tree-Child phylogenetic networks. In PLoS Computational Biology, Vol. 15(10):e1007440.1-29, 2019. Keywords: enumeration, explicit network, generation, phylogenetic network, phylogeny, Program PhyloNetwork, Program TCGenerators, software, tree-child network. Note: https://doi.org/10.1371/journal.pcbi.1007440.

InProceedings

5 Ernst Althaus and Rouven Naujoks. Reconstructing Phylogenetic Networks with One Recombination. In Proceedings of the seventh International Workshop on Experimental Algorithms (WEA'08), Vol. 5038:275-288 of LNCS, springer, 2008. Keywords: enumeration, explicit network, exponential algorithm, from sequences, generation, parsimony, phylogenetic network, phylogeny, reconstruction, unicyclic network. Note: http://dx.doi.org/10.1007/978-3-540-68552-4_21.         Toggle abstract "In this paper we propose a new method for reconstructing phylogenetic networks under the assumption that recombination events have occurred rarely. For a fixed number of recombinations, we give a generalization of the maximum parsimony criterion. Furthermore, we describe an exact algorithm for one recombination event and show that in this case our method is not only able to identify the recombined sequence but also to reliably reconstruct the complete evolutionary history. © 2008 Springer-Verlag Berlin Heidelberg."