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
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
|
/*
* segemehl - a read aligner
* Copyright (C) 2008-2017 Steve Hoffmann and Christian Otto
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
#ifndef _MATHEMATICS_H_
#define _MATHEMATICS_H_
#include <stdlib.h>
#include <stdio.h>
#include "basic-types.h"
#include <math.h>
/*typedef struct
{
size_t k;
gsl_matrix *A;
gsl_matrix *dB;
} gsl_bspline_deriv_workspace;
*/
/* important for compiling with cygwin */
#undef log2
#define RANDUNIT ((rand()/(RAND_MAX + 1.0)))
//#define RANDINT(MAX) ((Uint)round(((double)MAX) * (rand()/((double)RAND_MAX + 1.0))))
#define RANDINT(MAX) ((Uint)round((((double)MAX+1) * (rand()/((double)RAND_MAX + 1.0)))-0.5))
#define MATRIX2D(X,NCOL,I,J) X[(I)*(NCOL)+(J)]
#define MATRIX3D(X,DIM_M,DIM_N,I,J,K) X[((I)*(DIM_M)+(J))*DIM_N+(K)]
#define MATRIX4D(X,DIM_M,DIM_N,DIM_Z,I,J,K,L) X[(((I)*(DIM_M)+(J))*DIM_N+(K))*DIM_Z+(L)]
#define VECTOR(X,I) ((X)->elements[I])
#define INITMATRIX(X,SIZE,TYPESIZE) initArray(X,SIZE,TYPESIZE)
#define INITMATRIX2D(X,M,N,TYPESIZE) initArray(X, (M)*(N), TYPESIZE)
#define INITMATRIX3D(X,M,N,L,TYPESIZE) initArray(X, (M)*(N)*(L), TYPESIZE)
#define INITVECTOR(V) (V)->elements=NULL;\
(V)->length=0
#define RESIZEVEC(V,N) initArray(V,N,sizeof(vectorelem))
#define LENGTHVEC(V) ((V)->length)
#define SWEEPVEC(V) {int m;\
for (m=0;m<LENGTHVEC(V);m++)\
VECTOR(V,mi)=0;}
#define APPENDVEC(S,V,E) appendvector(S,V,E)
#define SWAPVEC(I,J,V) { vectorelem msv; \
msv = (V)->elements[I];\
(V)->elements[I] = (V)->elements[J];\
(V)->elements[J] = msv; }
#define DESTRUCTVEC(S,V) destructVector((S),(V));
#define SWAPUINT(X,A,B) {Uint msu ;\
msu= X[A]; \
X[A] = X[B]; \
X[B]=msu; }
#define REVERSEVEC(A,B,V) {Uint mi;\
for(mi=0; mi<(B-A); mi++) {\
SWAPVEC(A+mi,B-mi,V);\
}}
#define EMPTYVEC(V) (V->elements==NULL)
#define MAX(A,B) (((A) >= (B)) ? (A) : (B))
#define DMAX(A,B) (double)MAX(A,B)
#define MAX3(A, B, C) MAX(MAX((A),(B)),(C))
#define MAX4(A, B, C, D) MAX(MAX(MAX((A),(B)),(C)),(D))
#define MAX5(A, B, C, D, E) MAX(MAX(MAX(MAX((A),(B)),(C)),(D)),(E))
#define MIN(A,B) (((A) <= (B)) ? (A) : (B))
#define DMIN(A,B) (double)MIN(A,B)
#define MIN3(A, B, C) MIN((MIN((A),(B))),(C))
#define MAX_DOUBLE 1e200
#define ABS(X) ((X)>=0?(X):-(X))
#define DABS(X) (double)ABS(X)
#define OVERLAP(A,B,C,D) (((A) >= (C) && (B) <= (D)) || \
((A) <= (D) && (B) >= (D)) || \
((B) >= (C) && (A) <= (C)))
#define CLOSEDINTERVAL(X,A,B) ((A) >= (X) && (X) <= (B))
#define OPENINTERVAL(X,A,B) ((A) > (X) && (X) < (B))
#define ISELEM(X,A,B) ((A) <= (X) && (X) <= (B))
#define DIST(A,B) ((A) >= (B) ? (A)-(B) : (B)-(A))
#define DISTREV(A,B) ((A) >= (B) ? (A)-(B) : 0)
#define DISTFWD(A,B) ((A) >= (B) ? 0 : (B)-(A))
#ifndef FLT_EPSILON
#define FLT_EPSILON 1.192092896e-06
#define DBL_EPSILON 2.2204460492503131e-016
#endif
#ifndef M_PI
#define M_PI 3.141592653589793238462643
#endif
#ifndef M_SQRT2
#define M_SQRT2 1.4142135623730950488016887
#endif
#ifndef ALLOCMEMORY
#include "memory.h"
#endif
#ifndef VECTORELEM
typedef Uint vectorelem;
#endif
typedef struct {
vectorelem *elements;
Lint length;
} vector_t;
typedef struct{
Uint noofbreaks;
Uint *breaks;
double RSS;
double LL;
double BIC;
} breakpoints_t;
typedef struct {
double *l;
Uint n;
} ecdf_t;
Lint llabs(Lint);
double ecdf (double x, ecdf_t *e);
ecdf_t* ecdf_init (double *x, Uint n);
void ecdf_destruct (ecdf_t *e);
Uint lowerbound(double *l, Uint, Uint, double);
Uint upperbound(double *l, Uint, Uint, double);
void *initArray(void *, int, size_t);
void dumpMatrix_int(int *, int, int);
void dumpMatrix_Uint(Uint *, Uint, Uint);
void dumpMatrix_flt(float *, int, int);
void dumpMatrix_dbl(double *, Uint, Uint);
void dumpMatrix3D_int(int *, int, int, int);
double *transpose(void* space, double *, Uint, Uint);
void appendvector(void *, vector_t *, vectorelem);
void dumpVector(vector_t *);
void destructVector(void *, vector_t *);
Uint uarraymax(Uint *, Uint);
int arraymax(int *, int);
int gcd(int, int);
double power(double, int);
double uniroot(double, double, double (*f)(double, void*), double, void*);
double BLAST_Expm1(double x);
Uint fak(Uint);
double* coldel (void *, double *, Uint, Uint, Uint);
double* rowdel (void *, double *, Uint, Uint, Uint);
Uint minvecdist(void *space, vector_t *vec, Uint i, Uint j);
int* intrev(int *n, Uint len);
double shannonentropy(void *space, char *seq, Uint len, Uint asize, Uint *encodetab);
double log2(double x);
double log10(double x);
double logadd(double a, double b);
double log10add(double a, double b);
double var_int (int *x, Uint n);
double poisson(double lambda, double x);
double logpoisson(double lambda, double x);
double multivarnorm (double *pt, double *mu, double *sd, Uint n);
double bivarnorm(double x, double y, double mu1, double mu2, double* cv);
double univarnormcdf (double x, double mu, double sd);
double randunivarnorm(double mu, double sd);
double gmm(void *space, double *pt, Uint m, Uint n, double *mu, double *sd, double *w, Uint g, Uint maxiter);
double var (double *x, Uint n);
void normalize (double *a, Uint n);
breakpoints_t * bl_RSSmatrix (void *space, double *x, Uint n, Uint h, Uint noofbreaks);
double* bl_RSS (void *space, double *x, Uint n, Uint u, Uint v);
void gevLmoment (double *data, Uint n, double *m, double *s, double *k);
double gammaln (double x);
double gevll (double *data, Uint n, double mu, double sigma, double kappa);
double* gevinvhessian(void *space, double *y, Uint n, double m, double s, double k,
double* dm, double* ds, double* dk, Uint *ex);
double gevmle(void *space, double *y, Uint n,
double *m, double *s, double *k, Uint maxiter, double ymin, double ymax);
double
gevcdf (double x, double mu, double si, double xi);
double gevvar (double mu, double s, double k);
void dumprecursionmatrix2D (FILE *dev, int **M, char**B, char**K, Uint m, Uint n, PairUint *mark);
Uint uarraysecond(Uint *arr, Uint l, Uint max);
double pbinom (double x, double n, double p, char lower);
Uint* bin(double *x, Uint n, double **breaks, Uint *nbins);
double* splines_periodic(double *x, double *y, Uint n);
double *quantiles(double *x, Uint n, double* q, Uint k);
double scalar (double* x, double *y, Uint m);
Uint dist_uint (Uint a, Uint b);
double logbinomialapprox(Uint n, Uint k);
char** getallwords (char *alphabet, Uint size, Uint wordlen, Uint *noofwords);
Uint baseconversion_DNA(char *sequence, Uint len) ;
double median(double *x, Uint n);
double median_char (char *x, Uint m) ;
#endif
|
