Who is Who in Phylogenetic Networks

Publications related to 'labeling' : Articles tagged with labeling solves problems where a phylogenetic network is given as an input, as well as labels for the leaves, and the aim is to find the labels of the internal nodes of the network.   Order by:   Type | Year

Only And Or     related to:

Associated keywords

explicit-network from-distances from-network from-sequences hybridization labeling normal-network NP-complete parsimony phylogenetic-network phylogeny polynomial tree-child-network

Article (Journal)

1 Cam Thach Nguyen, Nguyen Bao Nguyen, Wing-Kin Sung and Louxin Zhang. Reconstructing Recombination Network from Sequence Data: The Small Parsimony Problem. In TCBB, Vol. 4(3):394-402, 2007. Keywords: explicit network, from sequences, labeling, NP complete, parsimony, phylogenetic network, phylogeny. Note: http://www.cs.washington.edu/homes/ncthach/Papers/TCBB2007.pdf.         2 Stephen J. Willson. Unique solvability of certain hybrid networks from their distances. In ACOM, Vol. 10(1):165-178, 2006. Keywords: from distances, from network, labeling, phylogenetic network, phylogeny. Note: http://www.public.iastate.edu/~swillson/Solvability.pdf.         3 Stephen J. Willson. Unique determination of some homoplasies at hybridization events. In BMB, Vol. 69(5):1709-1725, 2007. Keywords: explicit network, from network, hybridization, labeling, normal network, phylogenetic network, tree-child network. Note: http://www.public.iastate.edu/~swillson/unique.det.pdf.         4 Stephen J. Willson. Reconstruction of certain phylogenetic networks from the genomes at their leaves. In JTB, Vol. 252(2):185-376, 2008. Keywords: labeling, polynomial. Note: http://www.public.iastate.edu/~swillson/ReconstructNormalHomopap6.pdf.         Toggle abstract "A network N is a rooted acyclic digraph. A base-set X for N is a subset of vertices including the root (or outgroup), all leaves, and all vertices of outdegree 1. A simple model of evolution is considered in which all characters are binary and in which back-mutations occur only at hybrid vertices. It is assumed that the genome is known for each member of the base-set X. If the network is known and is assumed to be "normal," then it is proved that the genome of every vertex is uniquely determined and can be explicitly reconstructed. Under additional hypotheses involving time-consistency and separation of the hybrid vertices, the network itself can also be reconstructed from the genomes of all members of X. An explicit polynomial-time procedure is described for performing the reconstruction. © 2008 Elsevier Ltd. All rights reserved."