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
|
/*
* Copyright (C) 2010 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 "assert.h"
#include "ctype.h"
#include "stdio.h"
#include "Error.h"
#include "Generic.h"
#include "ReferenceSequence.h"
#include <algorithm>
#include <istream>
#include <fstream>
#include <sstream>
#include <stdexcept>
//
// Given a buffer with a fasta format contents, count
// the number of chromsomes in it and return that value.
//
bool getFastaStats(const char *fastaData, size_t fastaDataSize, uint32_t &chromosomeCount, uint64_t &baseCount)
{
chromosomeCount = 0;
baseCount = 0;
bool atLineStart = true;
//
// loop over the fasta file, essentially matching for the
// pattern '^>.*$' and counting them.
//
for (size_t fastaIndex = 0; fastaIndex < fastaDataSize; fastaIndex++)
{
switch (fastaData[fastaIndex])
{
case '\n':
case '\r':
atLineStart = true;
break;
case '>':
{
if (!atLineStart) break;
chromosomeCount++;
//
// eat the rest of the line
//
while (fastaIndex < fastaDataSize && fastaData[fastaIndex]!='\n' && fastaData[fastaIndex]!='\r')
{
fastaIndex++;
}
break;
}
default:
baseCount++;
atLineStart = false;
break;
}
}
return false;
}
#if 0
// turn this into a template on read/quality/etc...
int GenomeSequence::debugPrintReadValidation(
std::string &read,
std::string &quality,
char direction,
genomeIndex_t readLocation,
int sumQuality,
int mismatchCount,
bool recurse
)
{
int validateSumQ = 0;
int validateMismatchCount = 0;
int rc = 0;
std::string genomeData;
for (uint32_t i=0; i<read.size(); i++)
{
if (tolower(read[i]) != tolower((*this)[readLocation + i]))
{
validateSumQ += quality[i] - '!';
// XXX no longer valid:
if (direction=='F' ? i<24 : (i >= (read.size() - 24))) validateMismatchCount++;
genomeData.push_back(tolower((*this)[readLocation + i]));
}
else
{
genomeData.push_back(toupper((*this)[readLocation + i]));
}
}
assert(validateSumQ>=0);
if (validateSumQ != sumQuality && validateMismatchCount == mismatchCount)
{
printf("SUMQ: Original Genome: %s test read: %s : actual sumQ = %d, test sumQ = %d\n",
genomeData.c_str(),
read.c_str(),
validateSumQ,
sumQuality
);
rc++;
}
else if (validateSumQ == sumQuality && validateMismatchCount != mismatchCount)
{
printf("MISM: Original Genome: %s test read: %s : actual mismatch %d test mismatches %d\n",
genomeData.c_str(),
read.c_str(),
validateMismatchCount,
mismatchCount
);
rc++;
}
else if (validateSumQ != sumQuality && validateMismatchCount != mismatchCount)
{
printf("BOTH: Original Genome: %s test read: %s : actual sumQ = %d, test sumQ = %d, actual mismatch %d test mismatches %d\n",
genomeData.c_str(),
read.c_str(),
validateSumQ,
sumQuality,
validateMismatchCount,
mismatchCount
);
rc++;
}
if (recurse && abs(validateMismatchCount - mismatchCount) > (int) read.size()/2)
{
printf("large mismatch difference, trying reverse strand: ");
std::string reverseRead = read;
std::string reverseQuality = quality;
getReverseRead(reverseRead);
reverse(reverseQuality.begin(), reverseQuality.end());
rc = debugPrintReadValidation(reverseRead, reverseQuality, readLocation, sumQuality, mismatchCount, false);
}
return rc;
}
#endif
|
