Evolutionary Networks

Abstract

Evolutionary networks are labeled and weighted connected graphs that, in contrast to genetic trees, may contain cycles. A network can accommodate ambiguities concerning evolutionary pathways and thus simultaneously represent alternative estimates of a phylogeny.

Keywords: phylogeny; median network; mtDNA; Y chromosome; parsimony

Figure 1.

(a) Binary data table and (b) its corresponding median network. The unbroken links indicate a network (obtained via split decomposition) that realizes the mismatch distances in the five‐dimensional sequence space (hypercube). The bold links constitute the minimum spanning network as well as the MJ network relative to parameter ε = 0. The RM network is formed by the bold and broken links (parameter r = 2).

Figure 2.

(a) Table of deoxyribonucleic acid sequences and (b) its corresponding quasi‐median network. The unbroken links indicate a network that realizes the mismatch distances in the three‐dimensional sequence space (Hamming graph). The bold links constitute the minimum spanning network as well as the median‐joining network (parameter ε = 0).

close

References

Bandelt H‐J (1994) Phylogenetic networks. Verhandlungen des naturwissenschaftlichen Vereins Hamburg (NF) 34: 51–71.

Bandelt H‐J (1995) Combination of data in phylogenetic analyses. Plant Systematics and Evolution 9(Supplement): 355–361.

Bandelt H‐J and Dress AWM (1992) Split decomposition: a new and useful approach to phylogenetic analyses of distance data. Molecular Phylogenetics and Evolution 1: 242–252.

Bandelt H‐J, Forster P and Röhl A (1999) Median‐joining networks for inferring intraspecific phylogenies. Molecular Biology and Evolution 16: 37–48.

Bandelt H‐J, Forster P, Sykes BC and Richards MB (1995) Mitochondrial portraits of human populations using median networks. Genetics 141: 743–753.

Bandelt H‐J, Macaulay V and Richards M (2000) Median networks: speedy construction and greedy reduction, one simulation, and two case studies from human mtDNA. Molecular Phylogenetics and Evolution 16: 8–28.

Dress A, Hendy M, Huber K and Moulton V (1997) On the number of vertices and edges in the Buneman graph. Annals of Combinatorics 1: 329–337.

Excoffier L and Smouse PE (1994) Using allele frequencies and geographic subdivision to reconstruct gene trees within a species: molecular variance parsimony. Genetics 136: 343–359.

Foulds LR, Hendy MD and Penny D (1979) A graph theoretic approach to the development of minimal phylogenetic trees. Journal of Molecular Evolution 13: 127–149.

Jobling MA and Tyler‐Smith C (2000) New uses for new haplotypes: the human Y chromosome, disease and selection. Trends in Genetics 16: 356–362.

Macaulay V, Richards M and Sykes B (1999) Mitochondrial DNA recombination: no need to panic. Proceedings of the Royal Society of London B 266: 2037–2039.

Richards M and Macaulay V (2001) The mitochondrial gene tree comes of age. American Journal of Human Genetics 68: 1315–1320.

Further Reading

Avise JC (2000) Phylogeography: The History and Formation of Species. Cambridge: Harvard University Press.

Page RDM and Holmes EC (1998) Molecular Evolution: A Phylogenetic Approach. Oxford: Blackwell Science.

Wägele J‐W (2001) Grundlagen der phylogenetischen Systematik. Munich: Verlag Dr Friedrich Pfeil.

Contact Editor close
Submit a note to the editor about this article by filling in the form below.

* Required Field

How to Cite close
Bandelt, Hans‐Jürgen(Jul 2006) Evolutionary Networks. In: eLS. John Wiley & Sons Ltd, Chichester. http://www.els.net [doi: 10.1038/npg.els.0005463]