-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathcorrection.c
187 lines (160 loc) · 5.12 KB
/
correction.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
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
#include "correction.h"
/* call ede;
invdist the minimum inversion distance,
ngene the number of genes.
The function returns the EDE distance */
int
ede ( int invdist, int ngene )
{
double ll, tt, kk, pp, dval;
int newvalue;
kk = invdist / ( ngene + 0.0 );
if ( kk >= 0.999999999999 )
{ /* the distance correction has singularity at 1 */
kk = 0.999999999999;
}
if ( kk <= 1 - ede_c )
return invdist;
ll = ede_c * kk - ede_a;
tt = 4 * ede_a * ( 1 - kk ) * kk + ll * ll;
tt = ll + sqrt ( tt );
pp = tt / ( 2 * ( 1 - kk ) );
pp *= ngene;
dval = pp;
newvalue = ( int ) ceil ( dval );
/*if (newvalue-dval > 0) return newvalue-1; */
return newvalue;
}
/*********************************
IEBP
*/
/* Call iebp:
Bisection method to find the root
bpdist the breakpoint distance
ngene the number of genes
iwt not seen used, get rid, may need, who knows.
twt Pr(an event is a transposition)
(alpha in the IEBP paper)
vwt Pr(an event is an inverted transposition)
(beta in the IEBP paper)
signedmode =1 if signed, 0 if unsigned
circularmode =1 if circular, 0 if linear
Returns the IEBP distance correction.
*/
int
iebp ( int bpdist, int ngene, double twt, double vwt,
int signedmode, int circularmode )
{
int xl, xr, xm, yl, yr, ym;
/* what's for xm0 */
xl = 0;
yl = ( int ) iebpcurve ( xl, ngene, twt, vwt, signedmode, circularmode );
xr = XMAX * ngene;
yr = ( int ) iebpcurve ( xr, ngene, twt, vwt, signedmode, circularmode );
xm = ( xl + xr ) / 2;
ym = ( int ) iebpcurve ( xm, ngene, twt, vwt, signedmode, circularmode );
if ( bpdist == yl )
{
return xl;
}
if ( bpdist >= yr )
{
return xr;
}
while ( ( xr - xl ) >= 1 )
{
if ( ( ym - xm ) * ( yl - xm ) < 0 )
{ /*change dval to xm */
xr = xm;
yr = ym;
}
else
{
xl = xm;
yl = ym;
}
xm = ( xl + xr ) / 2;
ym = ( int ) iebpcurve ( xm, ngene, twt, vwt, signedmode,
circularmode );
}
return ( int ) xm;
}
/* The IEBP approximation: F_k
Do not call it directly. Call iebp instead.
*/
double
iebpcurve ( int bpdist, int ngene, double twt, double vwt,
int signmode, int circularmode )
{
double n, k, z, z0 = 0, ul, uh, ul0 = 0, uh0 = 0, el, eh, el0, eh0, f;
k = bpdist;
n = ngene;
if ( circularmode == 1 )
{
if ( signmode == 1 )
{
z = ( 2 + twt + vwt ) / n;
ul = 0;
uh = ( 2 * ( n - 2 ) + 4 * twt * ( n - 2 ) + 2 * vwt * ( n - 2 ) )
/ ( n * ( n - 1 ) * ( n - 2 ) );
}
else
{
z = ( 2 * ( n - 3 ) + twt * ( n - 3 ) + vwt * n )
/ ( ( n - 1 ) * ( n - 2 ) );
ul = ( 4 * ( n - 3 ) + 2 * twt * ( n - 3 ) + 2 * vwt * n )
/ ( ( n - 1 ) * ( n - 2 ) * ( n - 3 ) );
uh = ( 4 * ( n - 3 ) + 2 * twt * ( n - 3 ) + 2 * vwt * n )
/ ( ( n - 1 ) * ( n - 2 ) * ( n - 3 ) );
}
}
else
{
if ( signmode == 1 )
{
z = ( 2 + twt + vwt ) / ( n + 1 );
ul = 0;
uh = ( 2 * ( n - 1 ) + 4 * twt * ( n - 1 ) + vwt * ( n + 2 ) )
/ ( ( n + 1 ) * n * ( n - 1 ) );
z0 = ( 2 + twt + vwt ) / ( n + 1 );
ul0 = 0;
uh0 = ( 2 + 4 * twt + vwt ) / ( ( n + 1 ) * n );
}
else
{
z = ( 2 * ( n - 2 ) + twt * ( n - 2 ) + vwt * ( n - 5 ) )
/ ( n * ( n - 1 ) );
ul = ( 2 * ( 2 * n - 4 ) + 2 * twt * ( n - 2 ) +
2 * vwt * ( n + 1 ) ) / ( n * ( n - 1 ) * ( n - 2 ) );
uh = ( 2 * ( 2 * n - 4 ) + 2 * twt * ( n - 2 ) +
2 * vwt * ( n + 1 ) ) / ( n * ( n - 1 ) * ( n - 2 ) );
z0 = ( 2 * ( n + 1 ) + twt * ( n - 2 ) +
vwt * ( n + 1 ) ) / ( n * ( n + 1 ) );
ul0 =
( 2 * ( n + 1 ) * ( n - 2 ) -
2 * twt * ( n - 2 ) * ( n - 2 ) - vwt * ( n +
1 ) * ( 2 * n -
7 ) ) /
( ( n + 1 ) * n * ( n - 1 ) * ( n - 2 ) );
/* The RS&A draft (as of 2/26/01) has error:
in u0 min (ul0), the sign before beta should be minus.
*/
uh0 =
( 2 * ( n + 1 ) + 4 * twt * ( n - 2 ) +
4 * vwt * ( n + 1 ) ) / ( ( n + 1 ) * n * ( n - 1 ) );
}
}
el = z * ( 1 - pow ( 1 - z - ul, k ) ) / ( z + ul );
eh = z * ( 1 - pow ( 1 - z - uh, k ) ) / ( z + uh );
if ( circularmode == 1 )
{
f = n * ( el + eh ) / 2;
}
else
{
el0 = z0 * ( 1 - pow ( 1 - z0 - ul0, k ) ) / ( z0 + ul0 );
eh0 = z0 * ( 1 - pow ( 1 - z0 - uh0, k ) ) / ( z0 + uh0 );
f = ( n - 1 ) * ( el + eh ) / 2 + 2 * ( el0 + eh0 ) / 2;
}
return f;
}