-
Notifications
You must be signed in to change notification settings - Fork 0
/
Rbuild.c
130 lines (119 loc) · 4.54 KB
/
Rbuild.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
/***********************************************************************************/
/* Program: Rbuild.c
By: Brad Duthie
Description: Uses kinship matrix from previous generation(s) to build new kinships.
This is called Rbuild.c, but it really is calculating kinships, not relatedness
Compile: gcc Rbuild.c -ansi -Wall -pedantic */
/***********************************************************************************/
#include <stdio.h>
#include <math.h>
#include "array.h"
void Rbuild(double **ID, double **Rmat, double **Rmof, int Liv, int OLiv){
int i, j;
int MomP, DadP, Om, Od;
double rMmuP, rDmuP, rval, w, x, y, z;
/* =====================================================================*/
/* Below finds the correct kinship value between all individuals except */
/* immigrants and their children */
/* =====================================================================*/
for(i=0; i<Liv; i++){
/* Find Mom position -- -1 if immigrant */
if(ID[i][5] < 0){
MomP = -1;
}else{
MomP = 0; /* printf("\t\t\t%f\n",Rmat[0][0]); */
while(ID[i][5]!=Rmat[MomP][0]){
MomP++;
}
}
/* Find Dad position -- -1 if immigrant */
if(ID[i][6] < 0){
DadP = -1;
}else{
DadP = 0; /* Below finds the matrix position of Dad */
while(ID[i][6]!=Rmat[DadP][0]){
DadP++;
}
}
if(MomP < 0 || DadP < 0){
Rmof[i][i+1] = 1;
}else{
Rmof[i][i+1] = 1 + Rmat[MomP][DadP+1];
}
for(j=0; j<i; j++){ /* Looking for R for each offspring... */
/* Find r between i Mom and j Mom (x) and Dad (y) */
/* Establish who the parents are =======================*/
if(ID[j][5] < 0){
Om = -1;
}else{
Om = 0; /* Other mom's position */
while(ID[j][5]!=Rmat[Om][0]){
Om++;
} /* Keeps looking up until hits Mom's Rmat pos */
}
if(ID[j][6] < 0){
Od = -1;
}else{
Od = 0; /* Other dad's position */
while(ID[j][6]!=Rmat[Od][0]){
Od++;
} /* Keeps looking up until hits Dad's Rmat pos */
}
if(ID[i][4] == 0 && ID[j][4] == 0){
if(Om < 0 || MomP < 0){ /* If one Mom Imm */
w = 0;
}else{ /* Must be unrelated (not on the table) */
if(MomP == Om){
w = 0.5 * Rmat[MomP][Om+1];
}else{
w = Rmat[MomP][Om+1];
}
}
if(Od < 0 || MomP < 0){ /* Same with Mom1 and Dad2 */
y = 0;
}else{
y = Rmat[MomP][Od+1];
}
if(Om < 0 || DadP < 0){
x = 0;
}else{
x = Rmat[DadP][Om+1];
}
if(Od < 0 || DadP < 0){
z = 0;
}else{
if(DadP == Od){
z = 0.5 * Rmat[DadP][Od+1];
}else{
z = Rmat[DadP][Od+1];
}
}
/* Now do the actual calculation */
rMmuP = 0.5 * (w + y);
rDmuP = 0.5 * (x + z);
rval = 0.5 * (rMmuP + rDmuP);
} /* r between i and j */
/* XXX For overlapping generations, the below code needs to be inside of the previous loop, else `rval' is not initialised and could be wrong. There then needs to be an else statement XXX */
Rmof[i][j+1] = rval;
Rmof[j][i+1] = rval;
}
}
/* Immigrants are only related to their descendents (par-off kinship = 0.25) */
/* Below sets the parent-offspring kinship to 0.25 for children of immigrants */
for(i=0; i<Liv; i++){
for(j=0; j<Liv; j++){
if(ID[i][5] == ID[j][0]){
if(ID[j][5]==-1){
Rmof[i][j+1] = 0.25;
Rmof[j][i+1] = 0.25;
}
}
if(ID[i][6] == ID[j][0]){
if(ID[j][5]==-1){
Rmof[i][j+1] = 0.25;
Rmof[j][i+1] = 0.25;
}
}
}
}
}