forked from gpertea/stringtie
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathrlink.h
More file actions
448 lines (401 loc) · 14.5 KB
/
rlink.h
File metadata and controls
448 lines (401 loc) · 14.5 KB
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
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
#ifndef __RLINK_H__
#define __RLINK_H__
#include "GArgs.h"
#include "GStr.h"
#include "gff.h"
#include "GBam.h"
#include "GBitVec.h"
#include "time.h"
#include "tablemaker.h"
#include "GIntHash.hh"
#define MAX_NODE 1000000
#define DROP 0.5
#define CHI_WIN 100
#define CHI_THR 50
const double epsilon=0.00000001; //-E
const float trthr=1.0; // transfrag pattern threshold
const float MIN_VAL=-100000.0;
const int MAX_MAXCOMP=200; // is 200 too much, or should I set it up to 150?
const int longintron=20000; // don't trust introns longer than this unless there is higher evidence; 93.5% of all annotated introns are shorter than this
const int longintronanchor=25; // I need a higher anchor for long introns
const int max_trf_number=40000; // maximum number of transfrag accepted so that the memory doesn't blow up
extern bool singlePass;
//collect all refguide transcripts for a single genomic sequence
struct GRefData {
GList<GffObj> rnas; //all transcripts on this genomic seq
int gseq_id;
const char* gseq_name;
//GList<GTData> tdata; //transcript data (uptr holder for all rnas loaded here)
GRefData(int gid=-1):rnas(false,true,false),gseq_id(gid),gseq_name(NULL) {
gseq_id=gid;
if (gseq_id>=0)
gseq_name=GffObj::names->gseqs.getName(gseq_id);
}
void add(GffReader* gffr, GffObj* t) {
if (gseq_id>=0) {
if (gseq_id!=t->gseq_id)
GError("Error: invalid call to GRefData::add() - different genomic sequence!\n");
}
else { //adding first transcript, initialize storage
gseq_id=t->gseq_id;
gseq_name=t->getGeneName();
if (gffr->gseqStats[gseq_id]==NULL)
GError("Error: invalid genomic sequence data (%s)!\n",gseq_name);
rnas.setCapacity(gffr->gseqStats[gseq_id]->fcount);
}
rnas.Add(t);
t->isUsed(true);
}
bool operator==(GRefData& d){
return gseq_id==d.gseq_id;
}
bool operator<(GRefData& d){
return (gseq_id<d.gseq_id);
}
};
struct CBundlenode:public GSeg {
float cov;
int bid; // bundle node id in bnode -> to easy retrieve it
CBundlenode *nextnode; // next node in the same bundle
CBundlenode(int rstart=0, int rend=0, float _cov=0, int _bid=-1, CBundlenode *_nextnode=NULL):GSeg(rstart, rend),
cov(_cov),bid(_bid),nextnode(_nextnode) {}
};
// bundle data structure, holds all data needed for
// infering transcripts from a bundle
enum BundleStatus {
BUNDLE_STATUS_CLEAR=0, //available for loading/prepping
BUNDLE_STATUS_LOADING, //being prepared by the main thread (there can be only one)
BUNDLE_STATUS_READY //ready to be processed, or being processed
};
struct CBundle {
int len;
float cov;
float nread;
float multi;
int startnode; // id of start node in bundle of same strand
int lastnodeid; // id of last node added to bundle
CBundle(int _len=0, float _cov=0, float _nread=0,float _multi=0, int _start=-1, int _last=-1):
len(_len),cov(_cov),nread(_nread),multi(_multi), startnode(_start),lastnodeid(_last) {}
};
struct CTransfrag {
GVec<int> nodes;
GBitVec pattern;
float abundance;
bool real;
CTransfrag(GVec<int>& _nodes,GBitVec& bit, float abund=0, bool treal=true):nodes(_nodes),pattern(bit),abundance(abund),real(treal) {}
CTransfrag(float abund=0, bool treal=true):nodes(),pattern(),abundance(abund),real(treal) {}
};
struct CGuide {
CTransfrag *trf;
//char *id;
//CGuide(CTransfrag* _trf=NULL,char* _id=NULL):trf(_trf),id(_id) {}
GffObj* t;
CGuide(CTransfrag* _trf=NULL, GffObj* _t=NULL):trf(_trf),t(_t) {}
};
struct CGroup:public GSeg {
int color;
int grid;
float cov_sum;
float nread;
float multi;
float neg_prop; // proportion of negative reads assigned to group out of all positives and negatives
CGroup *next_gr;
CGroup(int rstart=0, int rend=0, int _color=-1, int _grid=0, float _cov_sum=0,float _nread=0,float _multi=0,float _neg_prop=0,
CGroup *_next_gr=NULL): GSeg(rstart, rend), color(_color), grid(_grid),
cov_sum(_cov_sum), nread(_nread),multi(_multi), neg_prop(_neg_prop), next_gr(_next_gr) { }
};
struct CPrediction:public GSeg {
int geneno;
GffObj* t_eq; //equivalent reference transcript (guide)
//char *id;
float cov;
char strand;
//float frag; // counted number of fragments associated with prediction
int tlen;
bool flag;
GVec<GSeg> exons;
GVec<float> exoncov;
CPrediction(int _geneno=0, GffObj* guide=NULL, int gstart=0, int gend=0, float _cov=0, char _strand='.',
int _len=0,bool f=true):GSeg(gstart,gend), geneno(_geneno),t_eq(guide),cov(_cov),strand(_strand),
//CPrediction(int _geneno=0, char* _id=NULL,int gstart=0, int gend=0, float _cov=0, char _strand='.', float _frag=0,
// int _len=0,bool f=true):GSeg(gstart,gend), geneno(_geneno),id(_id),cov(_cov),strand(_strand),frag(_frag),
tlen(_len),flag(f),exons(),exoncov() {}
CPrediction(CPrediction& c):GSeg(c.start, c.end), geneno(c.geneno),
// id(Gstrdup(c.id)), cov(c.cov), strand(c.strand), frag(c.frag), tlen(c.tlen), flag(c.flag),
t_eq(c.t_eq), cov(c.cov), strand(c.strand), tlen(c.tlen), flag(c.flag),
exons(c.exons), exoncov(c.exoncov) {}
~CPrediction() { //GFREE(id);
}
};
// this class keeps the gene predictions (linked bundle nodes initially)
struct CGene:public GSeg { // I don't necessarily need to make this a GSeg since I can get the start&end from the exons
char strand;
char* geneID;
char* geneName;
float cov; // this is the actual gene coverage
float covsum; // this is a sum of transcripts coverages -> this is what we need for FPKM and TPM estimations
GVec<GSeg> exons; // all possible exons in gene (those are bnodes in bundle)
CGene(int gstart=0, int gend=0, char _strand='.',char *gid=NULL, char *gname=NULL):GSeg(gstart,gend),
strand(_strand), geneID(gid), geneName(gname), exons() { cov=0; covsum=0;}
// getGeneID() and getGeneName() functions of gffobj return pointers to this attributes in gffobj so I don't need to clean them up here
};
struct CJunction;
struct CReadAln:public GSeg {
//DEBUG ONLY:
// GStr name;
// 0: strand; 1: NH; 2: pair's no; 3: coords of read; 4: junctions
char strand; // 1, 0 (unkown), -1 (reverse)
short int nh;
uint len;
float read_count; // keeps count for all reads (including paired and unpaired)
GVec<float> pair_count; // keeps count for all paired reads
GVec<int> pair_idx; // keeps indeces for all pairs
//int pair_idx;
GVec<GSeg> segs; //"exons"
GPVec<CJunction> juncs; //junction index in CJunction list
//DEBUG ONLY: (discard rname when no debugging needed)
CReadAln(char _strand=0, short int _nh=0,
int rstart=0, int rend=0, uint rlen=0 /*, const char* rname=NULL */): GSeg(rstart, rend), //name(rname),
strand(_strand),nh(_nh),len(rlen), read_count(0), pair_count(),pair_idx(),
//pair_idx(0),
segs(), juncs(false) { }
};
struct CGraphinfo {
int ngraph;
int nodeno;
CGraphinfo(int ng=-1,int nnode=-1):ngraph(ng),nodeno(nnode){}
};
struct CTreePat {
int nodeno;
int childno;
CTransfrag *tr;
CTreePat **nextpat;
CTreePat(int n=0,int cno=0):nodeno(n),childno(cno),tr(NULL),nextpat(NULL){
if(cno) {
GCALLOC(nextpat,cno*sizeof(CTreePat *));
for(int i=0;i<cno;i++) nextpat[i]=NULL;
}
}
void setchilds(int cno) {
if(cno && !nextpat) {
GCALLOC(nextpat,cno*sizeof(CTreePat *));
for(int i=0;i<cno;i++) nextpat[i]=NULL;
}
childno=cno;
}
void settree(int i, CTreePat *t) {
if(i<childno) nextpat[i]=t;
}
CTreePat *settree(int nextpos,int n,int cno) {
if(nextpos<childno) {
if(!nextpat[nextpos]) nextpat[nextpos]=new CTreePat(n,cno);
return(nextpat[nextpos]);
}
return(NULL);
}
};
struct CTrimPoint { // this can work as a guide keeper too, where pos is the guideidx, abundance is the flow, and start is the included status
uint pos;
float abundance;
bool start;
CTrimPoint(uint _pos=0,float abund=0.0,bool _start=true):pos(_pos),abundance(abund),start(_start) {}
};
struct CInterval {
uint pos; // interval start position
float val; // interval value
CInterval *next; // next interval;
CInterval(uint _pos=0,float _val=0,CInterval *_next=NULL):pos(_pos),val(_val),next(_next) {}
};
struct CTrInfo {
int trno;
float abundance;
float penalty;
CTrInfo(int tr=-1,float _abund=0.0, float _pen=0.0):trno(tr),abundance(_abund),penalty(_pen) {}
};
struct CNetEdge {
int link;
float rate;
bool fake;
CNetEdge(int lnk=0.0,float r=0.0, bool f=false):link(lnk),rate(r),fake(f){}
};
struct CComponent {
float size;
GVec<int> *set;
CComponent(float _size=0.0,GVec<int> *_set=NULL):size(_size),set(_set) {}
~CComponent() { if(set) delete set;}
};
struct CGraphnode:public GSeg {
int nodeid;
float cov;
float capacity; // sum of all transcripts abundances exiting and through node
float rate; // conversion rate between in and out transfrags of node
//float frag; // number of fragments included in node
GVec<int> child;
GVec<int> parent;
GBitVec childpat;
GBitVec parentpat;
GVec<int> trf; // transfrags that pass the node
//CGraphnode(int s=0,int e=0,unsigned int id=MAX_NODE,float nodecov=0,float cap=0,float r=0,float f=0):GSeg(s,e),nodeid(id),cov(nodecov),capacity(cap),rate(r),frag(f),child(),parent(),childpat(),parentpat(),trf(){}
CGraphnode(int s=0,int e=0,unsigned int id=MAX_NODE,float nodecov=0,float cap=0,float r=0):GSeg(s,e),
nodeid(id),cov(nodecov),capacity(cap),rate(r),child(),parent(),childpat(),parentpat(),trf(){}
};
// # 0: strand; 1: start; 2: end; 3: nreads; 4: nreads_good;
struct CJunction:public GSeg {
char strand; //-1,0,1
char guide_match; //exact match of a ref intron?
double nreads;
double nreads_good;
CJunction(int s=0,int e=0, char _strand=0):GSeg(s,e),
strand(_strand), guide_match(0), nreads(0),
nreads_good(0) {}
bool operator<(CJunction& b) {
if (start<b.start) return true;
if (start>b.start) return false;
if (end<b.end) return true;
if (end>b.end) return false;
if (strand>b.strand) return true;
return false;
}
bool operator==(CJunction& b) {
return (start==b.start && end==b.end && strand==b.strand);
}
};
struct GReadAlnData {
GBamRecord* brec;
char strand; //-1, 0, 1
int nh;
int hi;
GPVec<CJunction> juncs;
//GPVec< GVec<RC_ExonOvl> > g_exonovls; //>5bp overlaps with guide exons, for each read "exon"
GReadAlnData(GBamRecord* bamrec=NULL, char nstrand=0, int num_hits=0, int hit_idx=0):brec(bamrec),
strand(nstrand), nh(num_hits), hi(hit_idx), juncs(true) { } //, g_exonovls(true)
};
struct CTCov { //covered transcript info
int first_cov_exon;
int last_cov_exon;
int numt;
GffObj* guide;
bool whole;
CTCov(GffObj* t, int fex=-1, int lex=0, int ntr=0):first_cov_exon(fex), last_cov_exon(lex),
numt(ntr), guide(t), whole(false) {
whole = (first_cov_exon<0);
}
void print(FILE* f) {
if (whole) { //from get_covered()
guide->printTranscriptGff(f);
}
else { //from get_partial_covered()
bool partial=true;
if (last_cov_exon<0) {
if (guide->exons.Count()==1) partial=false;
last_cov_exon=first_cov_exon;
} else {
if(last_cov_exon-first_cov_exon+1==guide->exons.Count()) partial=false;
}
for(int i=first_cov_exon;i<=last_cov_exon;i++) {
if(partial) fprintf(f, "%s\tpartial\texon\t%u\t%u\t.\t%c\t.\ttranscript_id \"%s_part%d\";\n",guide->getGSeqName(),
guide->exons[i]->start,guide->exons[i]->end,guide->strand,guide->getID(), numt);
else fprintf(f, "%s\tcomplete\texon\t%u\t%u\t.\t%c\t.\ttranscript_id \"%s\";\n",guide->getGSeqName(),
guide->exons[i]->start,guide->exons[i]->end,guide->strand,guide->getID());
}
}
}
};
// bundle data structure, holds all input data parsed from BAM file
// - r216 regression
struct BundleData {
BundleStatus status;
//int64_t bamStart; //start of bundle in BAM file
int idx; //index in the main bundles array
int start;
int end;
//bool covSaturated;
unsigned long numreads; // number of reads in bundles
/*
float wnumreads; // NEW: weighted numreads; a multi-mapped read mapped in 2 places will contribute only 0.5
double sumreads; // sum of all reads' lengths in bundle
double sumfrag; // sum of all fragment lengths (this includes the insertion so it is an estimate)
float num_reads; // number of all reads in bundle that we considered (weighted)
float num_cov; // how many coverages we added (weighted) to obtain sumcov
float num_frag; // how many fragments we added to obtain sumfrag
double num_fragments3;
double sum_fragments3;
*/
double num_fragments; //aligned read/pairs
double frag_len;
double sum_cov; // sum of all transcripts coverages --> needed to compute TPMs
GStr refseq;
GList<CReadAln> readlist;
GVec<float> bpcov[3]; // this needs to be changed to a more inteligent way of storing the data
GList<CJunction> junction;
GPVec<GffObj> keepguides;
GPVec<CTCov> covguides;
GList<CPrediction> pred;
RC_BundleData* rc_data;
BundleData():status(BUNDLE_STATUS_CLEAR), idx(0), start(0), end(0),
//covSaturated(false),
numreads(0),
num_fragments(0), frag_len(0),sum_cov(0),
refseq(), readlist(false,true), //bpcov(1024),
junction(true, true, true),
keepguides(false), pred(false), rc_data(NULL) {
for(int i=0;i<3;i++) bpcov[i].setCapacity(1024);
}
void getReady(int currentstart, int currentend) {
start=currentstart;
end=currentend;
//refseq=ref;
status=BUNDLE_STATUS_READY;
}
void rc_init(GffObj* t, GPVec<RC_TData>* rc_tdata,
GPVec<RC_Feature>* rc_edata, GPVec<RC_Feature>* rc_idata) {
if (rc_data==NULL) {
rc_data = new RC_BundleData(t->start, t->end,
rc_tdata, rc_edata, rc_idata);
}
}
/* after reference annotation was loaded
void rc_finalize_refs() {
if (rc_data==NULL) return;
//rc_data->setupCov();
}
Not needed here, we update the coverage span as each transcript is added
*/
void keepGuide(GffObj* scaff, GPVec<RC_TData>* rc_tdata=NULL,
GPVec<RC_Feature>* rc_edata=NULL, GPVec<RC_Feature>* rc_idata=NULL);
//bool evalReadAln(GBamRecord& brec, char& strand, int nh); //, int hi);
bool evalReadAln(GReadAlnData& alndata, char& strand);
void Clear() {
keepguides.Clear();
pred.Clear();
readlist.Clear();
for(int i=0;i<3;i++) {
bpcov[i].Clear();
bpcov[i].setCapacity(1024);
}
junction.Clear();
start=0;
end=0;
status=BUNDLE_STATUS_CLEAR;
//covSaturated=false;
numreads=0;
num_fragments=0;
frag_len=0;
sum_cov=0;
delete rc_data;
rc_data=NULL;
}
~BundleData() {
Clear();
}
};
void processRead(int currentstart, int currentend, BundleData& bdata,
GHash<int>& hashread, GReadAlnData& alndata);
//GBamRecord& brec, char strand, int nh, int hi);
void countFragment(BundleData& bdata, GBamRecord& brec, int hi,int nh);
int printResults(BundleData* bundleData, int ngenes, int geneno, GStr& refname);
int infer_transcripts(BundleData* bundle, bool fast);
// --- utility functions
void printGff3Header(FILE* f, GArgs& args);
void printTime(FILE* f);
#endif