Pages that link to "Item:Q584109"

The following pages link to Reconstructing evolution of sequences subject to recombination using parsimony (Q584109):

Displaying 34 items.

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