Reconstructing evolution of sequences subject to recombination using parsimony

DOI10.1016/0025-5564(90)90123-GzbMath0692.92014OpenAlexW2049931279WikidataQ46404849 ScholiaQ46404849MaRDI QIDQ584109

Jotun J. Hein

Publication date: 1990

Published in: Mathematical Biosciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0025-5564(90)90123-g

zbMATH Keywords

algorithmdynamic programmingmetrictreeshorizontal transferevolutionary historygene conversionsmost parsimonious historyparsimony principlephylogeny reconstruction methodsrecombinationsreconstruction of the evolution of homologous sequences

Mathematics Subject Classification ID

Problems related to evolution (92D15) Applications of mathematical programming (90C90) Genetics and epigenetics (92D10) Computational methods for problems pertaining to biology (92-08)

Related Items (34)

On the challenge of reconstructing level-1 phylogenetic networks from triplets and clusters ⋮ Dimension reduction in principal component analysis for trees ⋮ Kernelizations for the hybridization number problem on multiple nonbinary trees ⋮ Non-essential arcs in phylogenetic networks ⋮ Characterizing local optima for maximum parsimony ⋮ Properties of normal phylogenetic networks ⋮ A pattern recognition-based approach for phylogenetic network construction with constrained recombination ⋮ Bounding the number of hybridisation events for a consistent evolutionary history ⋮ Inferring a level-1 phylogenetic network from a dense set of rooted triplets ⋮ An efficiently computed lower bound on the number of recombinations in phylogenetic networks: theory and empirical study ⋮ Computing the minimum number of hybridization events for a consistent evolutionary history ⋮ Extremal distances for subtree transfer operations in binary trees ⋮ The ultrametric Gromov-Wasserstein distance ⋮ Unique determination of some homoplasies at hybridization events ⋮ Reconstruction of some hybrid phylogenetic networks with homoplasies from distances ⋮ PULLPRU: a practical approach to estimate phylogenies from single nucleotide polymorphism haplotypes under the maximum parsimony criterion ⋮ Finding a most parsimonious or likely tree in a network with respect to an alignment ⋮ When is a phylogenetic network simply an amalgamation of two trees? ⋮ Optimal algorithms for recombination distance problem ⋮ SUBTREE TRANSFER DISTANCE FOR DEGREE-D PHYLOGENIES ⋮ Reconstructing tree-child networks from reticulate-edge-deleted subnetworks ⋮ Optimal, efficient reconstruction of root-unknown phylogenetic networks with constrained and structured recombination ⋮ Computing the maximum agreement of phylogenetic networks ⋮ Fast algorithms for computing the tripartition-based distance between phylogenetic networks ⋮ On the complexity of comparing evolutionary trees ⋮ Reconstruction of certain phylogenetic networks from the genomes at their leaves ⋮ All that glisters is not galled ⋮ Unique reconstruction of tree-like phylogenetic networks from distances between leaves ⋮ A partial order and cluster-similarity metric on rooted phylogenetic trees ⋮ A 3-approximation algorithm for the subtree distance between phylogenies ⋮ Note on the hybridization number and subtree distance in phylogenetics ⋮ Reconstructing a history of recombinations from a set of sequences ⋮ Fixed topology alignment with recombination ⋮ A New Algorithm for Inferring Hybridization Events Based on the Detection of Horizontal Gene Transfers

Cites Work

• Comparison of phylogenetic trees
• The Steiner problem in phylogeny is NP-complete
• Properties of a neutral allele model with intragenic recombination
• Comparing Trees with Pendant Vertices Labelled
• Minimal Mutation Trees of Sequences
• Comparison of labeled trees with valency three

This page was built for publication: Reconstructing evolution of sequences subject to recombination using parsimony