Optimal, efficient reconstruction of root-unknown phylogenetic networks with constrained and structured recombination

DOI10.1016/j.jcss.2004.12.009zbMath1068.92035OpenAlexW2082118300MaRDI QIDQ1775773

Dan Gusfield

Publication date: 4 May 2005

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2004.12.009

zbMATH Keywords

SNPRecombinationRecurrent mutationPhylogenetic networksAncestral recombination graphGene-conversionMolecular evolutionPerfect phylogeny

Mathematics Subject Classification ID

Problems related to evolution (92D15) Applications of graph theory (05C90) Circuits, networks (94C99) Computational methods for problems pertaining to biology (92-08)

Related Items (9)

An efficiently computed lower bound on the number of recombinations in phylogenetic networks: theory and empirical study ⋮ Algorithms for visualizing phylogenetic networks ⋮ ReCombinatorics: Combinatorial Algorithms for Studying the History of Recombination in Populations ⋮ Enumeration of rooted binary unlabeled galled trees ⋮ Haplotype Inferring Via Galled-Tree Networks Is NP-Complete ⋮ An analytical upper bound on the minimum number of recombinations in the history of SNP sequences in populations ⋮ Parallel Algorithm for Conflict Graph on OTIS-Triangular Array ⋮ All that glisters is not galled ⋮ Haplotype inferring via galled-tree networks using a hypergraph covering problem for special genotype matrices

Cites Work

• Unnamed Item
• Unnamed Item
• Reconstructing evolution of sequences subject to recombination using parsimony
• On the minimum number of recombination events in the evolutionary history of DNA se\-quences
• The Fine Structure of Galls in Phylogenetic Networks
• Algorithms on Strings, Trees and Sequences
• Efficient algorithms for inferring evolutionary trees

This page was built for publication: Optimal, efficient reconstruction of root-unknown phylogenetic networks with constrained and structured recombination