Research in Computational Molecular Biology

DOI10.1007/b135594zbMath1119.92352OpenAlexW4376539797MaRDI QIDQ5706862

Vikas Bansal, Dan Gusfield

Publication date: 23 November 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b135594

zbMATH Keywords

SNPRecombinationPerfect PhylogenyMolecular EvolutionAncestral Recombination GraphGene-ConversionPhylogenetic Networks

Mathematics Subject Classification ID

Problems related to evolution (92D15) Biochemistry, molecular biology (92C40) Computational methods for problems pertaining to biology (92-08)

Related Items

Unrooted non-binary tree-based phylogenetic networks ⋮ An efficiently computed lower bound on the number of recombinations in phylogenetic networks: theory and empirical study ⋮ ReCombinatorics: Combinatorial Algorithms for Studying the History of Recombination in Populations ⋮ Reconstructing tree-child networks from reticulate-edge-deleted subnetworks ⋮ Fast algorithms for computing the tripartition-based distance between phylogenetic networks ⋮ The Structure of Level-k Phylogenetic Networks