Bounding the number of hybridisation events for a consistent evolutionary history

DOI10.1007/s00285-005-0315-9zbMath1068.92034WikidataQ34415638 ScholiaQ34415638MaRDI QIDQ2388380

Charles Semple, Stefan Grünewald, Vincent L. Moulton, Mihaela Baroni

Publication date: 13 September 2005

Published in: Journal of Mathematical Biology (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10092/1670

zbMATH Keywords

phylogenetic trees; hybridization; phylogenetic networks; lateral gene transfer

Mathematics Subject Classification ID

05C05: Trees

92D15: Problems related to evolution

94C99: Circuits, networks

Related Items

Constructing the simplest possible phylogenetic network from triplets, Analyzing and reconstructing reticulation networks under timing constraints, A cluster reduction for computing the subtree distance between phylogenies, Computing the minimum number of hybridization events for a consistent evolutionary history, Note on the hybridization number and subtree distance in phylogenetics, On the complexity of computing the temporal hybridization number for two phylogenies, Phylogenetic networks from multi-labelled trees

Cites Work

• Reconstructing evolution of sequences subject to recombination using parsimony
• A framework for representing reticulate evolution
• On the computational complexity of the rooted subtree prune and regraft distance
• On the minimum number of recombination events in the evolutionary history of DNA se\-quences
• Subtree transfer operations and their induced metrics on evolutionary trees
• On the complexity of comparing evolutionary trees