compact_pedigree

Compact pedigree by merging full siblings

internal

Built on graph theory and the high-performance 'data.table' framework,
this package provides a comprehensive suite of tools for tidying, analyzing,
and visualizing animal pedigrees. By modeling pedigrees as directed acyclic
graphs using 'igraph', it ensures robust loop detection, efficient
generation assignment, and optimal sub-population splitting. Key features
include standardizing pedigree formats, flexible ancestry tracing, and
generating legible vector-based PDF graphs. A unique compaction algorithm
enables the visualization of massive pedigrees by grouping full-sib families.
Furthermore, the package implements high-performance C++ algorithms for
calculating and visualizing genetic relationship matrices (A, D, AA, and
their inverses) and inbreeding coefficients.

Sheng Luan

visPedigree

Tidying and Visualizing Animal Pedigrees

compact_pedigree function

<dl><dt>ped_node</dt>
<dd>A data.table of nodes.</dd>
<dt>compact</dt>
<dd>Logical, whether to compact.</dd>
<dt>h_ids</dt>
<dd>Highlighted IDs to exempt from compaction.</dd></dl>

Arguments

Compact pedigree by merging full siblings — compact_pedigree

<dl>

<dt>ped_node</dt>
<dd>A data.table of nodes.</dd>


<dt>compact</dt>
<dd>Logical, whether to compact.</dd>


<dt>h_ids</dt>
<dd>Highlighted IDs to exempt from compaction.</dd>

</dl>

compact_pedigree: Compact pedigree by merging full siblings

Description

Usage

Arguments