File: ShortReadUtil.h

package info (click to toggle)
perm 0.4.0-8
  • links: PTS, VCS
  • area: main
  • in suites: bookworm, forky, sid, trixie
  • size: 976 kB
  • sloc: cpp: 13,499; makefile: 98; sh: 12
file content (248 lines) | stat: -rw-r--r-- 4,964 bytes parent folder | download | duplicates (5)
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
#pragma once
#ifndef SHORT_READ_UTIL_H
#define SHORT_READ_UTIL_H

#include <ctype.h>
#include <string.h>
#include <stdio.h>
#include <stdlib.h>
#include <iostream>
using namespace std;

//TODO separate inline functions for single base and functions for short Read.

#define NT_SIZE 4

inline bool isACGT(char nt)
{
    switch (nt) {
    case 'a':
    case 'c':
    case 'g':
    case 't':
    case 'A':
    case 'C':
    case 'G':
    case 'T':
        return(true);
#ifdef DIPLOID
    case 'R':
        // G or A as puRine
    case 'Y':
        // T or C as pYrimidine
    case 'M':
        // aMino
    case 'K':
        // Keto
    case 'S':
        // Strong interaction
    case 'W':
        // Weak interaction
        return(true);
#endif
    default:
        return(false);
    }
}

inline int nt2Id(char nt)
{
    switch (nt) {
    case 'A':
    case 'a':
        return(0);
    case 'C':
    case 'c':
        return(1);
    case 'G':
    case 'g':
        return(2);
    case 'T':
    case 't':
        return(3);
    default:
        return(4);
    }
}

inline bool is0123(char nt)
{
    switch (nt) {
    case '0':
    case '1':
    case '2':
    case '3':
        return true;
    default:
        return false;
    }
}

inline
bool isNucleotide(char nt)
{
    switch (nt) {
    case 'a':
    case 'c':
    case 'g':
    case 't':
    case 'A':
    case 'C':
    case 'G':
    case 'T':
    case 'U':
    case 'u':
    case 'R':  // G or A as puRine
    case 'r':
    case 'Y':  // T or C as pYrimidine
    case 'y':
    case 'M':  // aMino
    case 'm':
    case 'N':  // unknown
    case 'n':
    case 'K':  // Keto
    case 'k':
    case 'S':  // Strong interaction
    case 's':
    case 'W':  // Weak interaction
    case 'w':
    case 'B':  // GTC
    case 'b':
    case 'D':  // GAT
    case 'd':
    case 'H':  // ACT
    case 'h':
    case 'V':  // GCA
    case 'v':
        return(true);
    default:
        return(false);
    }

}


/* Perform the WildCard comparison between two base. If match return true */
inline bool diNtWildCardComp(char nt1, char nt2)
{
    if (nt1 == nt2)
        return true;
    switch (nt1) {
    case 'R':
        if (nt2 == 'G' || nt2 == 'A' || nt2 == 'R')
            return true;
        break;
    case 'Y':
        if (nt2 == 'T' || nt2 == 'C' || nt2 == 'Y')
            return true;
        break;
    case 'M':
        if (nt2 == 'A' || nt2 == 'C' || nt2 == 'M')
            return true;
        break;
    case 'K':
        if (nt2 == 'G' || nt2 == 'T' || nt2 == 'K')
            return true;
        break;
    case 'S':
        if (nt2 == 'G' || nt2 == 'C' || nt2 == 'S')
            return true;
        break;
    case 'W':
        if (nt2 == 'T' || nt2 == 'A' || nt2 == 'W')
            return true;
        break;
    default:
        return false;
    }
    return false;
}
unsigned int diNtStrWildCardComp(char* read1, char* read2, unsigned int readlength);
unsigned int strComp(char* str1, char* str2, int l);
unsigned int strCompMarkDiff(char* str1, char* str2);

inline char complimentBase(char ntbase)
{
    switch (ntbase) {
    case 'a':
        return('t');
    case 'c':
        return('g');
    case 'g':
        return('c');
    case 't':
        return('a');
    case 'A':
        return('T');
    case 'C':
        return('G');
    case 'G':
        return('C');
    case 'T':
        return('A');
    default:
        return('N');
    }
}

inline char base2color(char nt, char color)
{
    switch (color) {
    case '1':
        switch (color) {
        case 'A':
            return('C');
        case 'C':
            return('A');
        case 'G':
            return('T');
        case 'T':
            return('G');
        default:
            return(nt);
        }
    case '2':
        switch (color) {
        case 'A':
            return('G');
        case 'C':
            return('T');
        case 'G':
            return('A');
        case 'T':
            return('C');
        default:
            return(nt);
        }
    case '3':
        switch (color) {
        case 'A':
            return('T');
        case 'C':
            return('G');
        case 'G':
            return('C');
        case 'T':
            return('A');
        default:
            return(nt);
        }
    default:  // include color 0
        return(nt);
    }
}

char getBaseFromColors(char nt, const char* colors, int pos);
void toUpperCase(char* caArray, int length);
void mutateBase(char* Base);
char* mutateRead(char* Kmer , unsigned int No_of_mutation);
char* mutatePairsOfConsecutiveBases(char* Kmer, unsigned int no_of_mutated_pairs);
bool isBadRead(const char* tkmer, unsigned int KmerLength);
bool isBadSOLiDRead(const char* Read, unsigned int ReadLength);
bool isBadRead(bool isSOLiD, const char* Read, unsigned int ReadLength);
//return the complement kmer from 5'->3', destroy the original kmer
char* reverseComplementKmer(char* Kmer);
char* reverseKmer(char* Kmer);
#endif