An execution example. (a) A pedigree of 19 individuals with genotype data. (b) The corresponding pedigree graph G with a spanning tree T(G). Tree edges are solid lines and non-tree edges are dotted lines. (c) Locus graphs and forests. Nodes with thick borders are predetermined. (d) The corresponding constraint graph G*. Nodes and solid lines compose the initial constraint graph. The three dotted lines are path constraints that form a synthetic cycle of the non-tree edge B-F. (e) The final G*. All edges except B-F have weight zero; hB, F is a free variable.
Lai et al. BMC Bioinformatics 2012 13(Suppl 17):S19 doi:10.1186/1471-2105-13-S17-S19