Combinatorics of Pedigrees I: Counterexamples to a Reconstruction Question

DOI10.1137/060675964zbMath1211.05081arXivmath/0609264OpenAlexW2026943917WikidataQ124801228 ScholiaQ124801228MaRDI QIDQ3393428

Bhalchandra D. Thatte

Publication date: 20 August 2009

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0609264

zbMATH Keywords

reconstructionpedigrees

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (3)

Leaf-Reconstructibility of Phylogenetic Networks ⋮ Reconstructing pedigrees: Some identifiability questions for a recombination-mutation model ⋮ Not all phylogenetic networks are leaf-reconstructible

This page was built for publication: Combinatorics of Pedigrees I: Counterexamples to a Reconstruction Question