A graph‐theoretic approach to the partition of individuals into full‐sib families
A graph‐theoretic approach to the partition of individuals into full‐sib families
复制标题
将个体划分为全同胞家庭的图论方法
作者：
J. Beyer;B. May
我们提出了一种利用单位点共显性标记数据将一代个体划分为全同胞家族的算法。两两似然比用于创建一个表示数据集中的全sib关系的图表。然后使用图论中的连通分量和最小割算法来寻找图中的全sib族。大规模模拟研究的结果表明，当应用于具有8个或更多位点的数据集时，该算法能够产生准确的分区。虽然当一个数据集中的等位基因频率和家族大小分布均匀时，该算法表现最好，但包含更多的基因座或每个基因座的等位基因，可以从这些分布高度倾斜的数据集中创建准确的分区。
We present an algorithm to partition a single generation of individuals into full‐sib families using single‐locus co‐dominant marker data. Pairwise likelihood ratios are used to create a graph that represents the full‐sib relationships within the data set. Connected‐component and minimum‐cut algorithms from the graph theory are then employed to find the full‐sib families within the graph. The results of a large‐scale simulation study show that the algorithm is able to produce accurate partitions when applied to data sets with eight or more loci. Although the algorithm performs best when the distribution of allele frequencies and family sizes in a data set is uniform, the inclusion of more loci or alleles per locus allows accurate partitions to be created from data sets in which these distributions are highly skewed.
影响因子：
3.3
作者：
M. Lynch;K. Ritland
通讯作者：
M. Lynch;K. Ritland