The fine structure of galls in phylogenetic networks
DOI10.1287/IJOC.1040.0099zbMATH Open1402.92313OpenAlexW2096967818MaRDI QIDQ2890447FDOQ2890447
Authors: Satish Eddhu, Charles Langley, 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
Recommendations
- Research in Computational Molecular Biology
- Phylogenetic networks
- Phylogenetic Networks
- Computational Science – ICCS 2005
- Distinguishing phylogenetic networks
- A space of phylogenetic networks
- The space of tree-based phylogenetic networks
- Mathematical Foundations of Computer Science 2005
- A class of phylogenetic networks reconstructable from ancestral profiles
SNPphylogenetic networksrecombinationancestral recombination graphmolecular evolutionbi-convex graph
Applications of graph theory (05C90) Genetics and epigenetics (92D10) Problems related to evolution (92D15) Systems biology, networks (92C42)
Cited In (33)
- Restricted trees: simplifying networks with bottlenecks
- Phylogenetic networks from multi-labelled trees
- Path lengths in tree-child time consistent hybridization networks
- A pattern recognition-based approach for phylogenetic network construction with constrained recombination
- Counting and enumerating tree-child networks and their subclasses
- Parallel Algorithm for Conflict Graph on OTIS-Triangular Array
- ReCombinatorics: Combinatorial Algorithms for Studying the History of Recombination in Populations
- How far is my network from being edge-based? Proximity measures for edge-basedness of unrooted phylogenetic networks
- Unique reconstruction of tree-like phylogenetic networks from distances between leaves
- On the challenge of reconstructing level-1 phylogenetic networks from triplets and clusters
- Reconstruction of some hybrid phylogenetic networks with homoplasies from distances
- Unique determination of some homoplasies at hybridization events
- Counting and enumerating galled networks
- Seeing the trees and their branches in the network is hard
- Classes of explicit phylogenetic networks and their biological and mathematical significance
- Research in Computational Molecular Biology
- Reconstruction of certain phylogenetic networks from the genomes at their leaves
- Conflict Resolution Algorithms for Deep Coalescence Phylogenetic Networks.
- Faster computation of the Robinson-Foulds distance between phylogenetic networks
- All that glisters is not galled
- Clustered SplitsNetworks
- The Sackin index of simplex networks
- Tripartitions do not always discriminate phylogenetic networks
- Optimal, efficient reconstruction of root-unknown phylogenetic networks with constrained and structured recombination
- Analysis and application of mutation network systems of multiple sequence alignments
- An efficiently computed lower bound on the number of recombinations in phylogenetic networks: theory and empirical study
- Two novel closure rules for constructing phylogenetic super-networks
- Comparing and simplifying distinct-cluster phylogenetic networks
- Haplotype Inferring Via Galled-Tree Networks Is NP-Complete
- Reconstructing phylogenetic level-1 networks from nondense binet and trinet sets
- Bounding the number of reticulations in a tree-child network that displays a set of trees
- Enumeration of rooted binary unlabeled galled trees
- Scanning phylogenetic networks is NP-hard
This page was built for publication: The fine structure of galls in phylogenetic networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2890447)
