Some notes on the combinatorial properties of haplotype tagging

DOI10.1016/S0025-5564(03)00089-0zbMath1021.92024OpenAlexW2068807980WikidataQ52010144 ScholiaQ52010144MaRDI QIDQ1410355

Zoë Laidlaw, Carsten Wiuf, Michael P. H. Stumpf

Publication date: 14 October 2003

Published in: Mathematical Biosciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0025-5564(03)00089-0

zbMATH Keywords

single nucleotide polymorphismsSNPsblock recombinationhaplotype tagging

Mathematics Subject Classification ID

Problems related to evolution (92D15) Genetics and epigenetics (92D10) Structure theory of Boolean algebras (06E05)

Cites Work

• On the minimum number of topologies explaining a sample of DNA sequences
• On the number of segregating sites in genetical models without recombination
• An idealized concept of the true cladistic character
• Efficient algorithms for inferring evolutionary trees
• Unnamed Item
• Unnamed Item

This page was built for publication: Some notes on the combinatorial properties of haplotype tagging