Enumeration and simulation of marriage node graphs on zero-loop pedigrees

DOI10.1093/IMAMMB/20.3.261zbMATH Open1039.92030OpenAlexW2032272555WikidataQ52006704 ScholiaQ52006704MaRDI QIDQ4454058FDOQ4454058

Chris Cannings, Alun Thomas

Publication date: 7 March 2004

Published in: Mathematical Medicine and Biology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/imammb/20.3.261

zbMATH Keywords

graphical modellingexact simulationpeelingtriangulated graphspedigree analysis

Mathematics Subject Classification ID

Applications of graph theory (05C90) Problems related to evolution (92D15)

Cited In (3)

• Reconstructing pedigrees: a combinatorial perspective
• Simulating realistic zero loop pedigrees using a bipartite Prufer code and graphical modelling
• Title not available (Why is that?)

   Recommendations

• Simulating realistic zero loop pedigrees using a bipartite Prufer code and graphical modelling 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Improved maximum likelihood reconstruction of complex multi-generational pedigrees 👍 👎
• Reconstructing pedigrees: a combinatorial perspective 👍 👎

This page was built for publication: Enumeration and simulation of marriage node graphs on zero-loop pedigrees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4454058)