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
|
/*
* Copyright (C) 2010-2012 Regents of the University of Michigan
*
* 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/>.
*/
#include "BaseUtilities.h"
#include <ctype.h>
#include "BaseAsciiMap.h"
bool BaseUtilities::isAmbiguous(char base)
{
switch(base)
{
case 'N':
case 'n':
case '.':
return(true);
default:
break;
};
// Not 'N', 'n', or '.', so return false.
return(false);
}
bool BaseUtilities::areEqual(char base1, char base2)
{
// If they are the same, return true.
if(base1 == base2)
{
return(true);
}
// If one of the bases is '=', return true.
if((base1 == '=') || (base2 == '='))
{
return(true);
}
// Check both in upercase.
if(toupper(base1) == toupper(base2))
{
// same in upper case.
return(true);
}
// The bases are different.
return(false);
}
// Get phred base quality from the specified ascii quality.
uint8_t BaseUtilities::getPhredBaseQuality(char charQuality)
{
if(charQuality == UNKNOWN_QUALITY_CHAR)
{
return(UNKNOWN_QUALITY_INT);
}
return(charQuality - 33);
}
char BaseUtilities::getAsciiQuality(uint8_t phredQuality)
{
if(phredQuality == UNKNOWN_QUALITY_INT)
{
return(UNKNOWN_QUALITY_CHAR);
}
return(phredQuality + 33);
}
void BaseUtilities::reverseComplement(std::string& sequence)
{
int start = 0;
int end = sequence.size() - 1;
char tempChar;
while(start < end)
{
tempChar = sequence[start];
sequence[start] = BaseAsciiMap::base2complement[(int)(sequence[end])];
sequence[end] = BaseAsciiMap::base2complement[(int)tempChar];
// Move both pointers.
++start;
--end;
}
// there was an odd number of entries, complement the middle one.
if(start == end)
{
tempChar = sequence[start];
sequence[start] = BaseAsciiMap::base2complement[(int)tempChar];
}
}
|
