The Fine Structure of Galls in Phylogenetic Networks
From MaRDI portal
Publication:2890447
DOI10.1287/ijoc.1040.0099zbMath1402.92313OpenAlexW2096967818MaRDI QIDQ2890447
Charles H. Langley, Satish Eddhu, Dan Gusfield
Publication date: 8 June 2012
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/fba92cccea1931525182595f8d4d2a0cd843a58b
recombinationmolecular evolutionSNPphylogenetic networksancestral recombination graphbi-convex graph
Problems related to evolution (92D15) Applications of graph theory (05C90) Genetics and epigenetics (92D10) Systems biology, networks (92C42)
Related Items (29)
Restricted trees: simplifying networks with bottlenecks ⋮ On the challenge of reconstructing level-1 phylogenetic networks from triplets and clusters ⋮ Classes of explicit phylogenetic networks and their biological and mathematical significance ⋮ Path lengths in tree-child time consistent hybridization networks ⋮ A pattern recognition-based approach for phylogenetic network construction with constrained recombination ⋮ The Sackin index of simplex networks ⋮ An efficiently computed lower bound on the number of recombinations in phylogenetic networks: theory and empirical study ⋮ Bounding the number of reticulations in a tree-child network that displays a set of trees ⋮ Counting and enumerating galled networks ⋮ ReCombinatorics: Combinatorial Algorithms for Studying the History of Recombination in Populations ⋮ Enumeration of rooted binary unlabeled galled trees ⋮ Counting and enumerating tree-child networks and their subclasses ⋮ Unique determination of some homoplasies at hybridization events ⋮ Reconstruction of some hybrid phylogenetic networks with homoplasies from distances ⋮ How far is my network from being edge-based? Proximity measures for edge-basedness of unrooted phylogenetic networks ⋮ Haplotype Inferring Via Galled-Tree Networks Is NP-Complete ⋮ Faster computation of the Robinson-Foulds distance between phylogenetic networks ⋮ Seeing the trees and their branches in the network is hard ⋮ Comparing and simplifying distinct-cluster phylogenetic networks ⋮ Reconstructing phylogenetic level-1 networks from nondense binet and trinet sets ⋮ Two novel closure rules for constructing phylogenetic super-networks ⋮ Tripartitions do not always discriminate phylogenetic networks ⋮ Optimal, efficient reconstruction of root-unknown phylogenetic networks with constrained and structured recombination ⋮ Phylogenetic networks from multi-labelled trees ⋮ Parallel Algorithm for Conflict Graph on OTIS-Triangular Array ⋮ 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 ⋮ Clustered SplitsNetworks
This page was built for publication: The Fine Structure of Galls in Phylogenetic Networks
