Reconstruction of certain phylogenetic networks from the genomes at their leaves.
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.
Willson
Stephen J
SJ
Department of Mathematics, Iowa State University, Ames, IA 50011, USA. swillson@iastate.edu
D000818:Animals; D005075:Biological Evolution; D003198:Computer Simulation; D053263:Gene Regulatory Networks; D016678:Genome; D008957:Models, Genetic; D010802:Phylogeny