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
|
/*
A significant portion of this code is derived from Heng Li's BFC
repository: https://github.com/lh3/bfc
BFC is copyrighted by Heng Li with the following license:
The MIT License
Copyright (c) 2015 Broad Institute
Permission is hereby granted, free of charge, to any person obtaining
a copy of this software and associated documentation files (the
"Software"), to deal in the Software without restriction, including
without limitation the rights to use, copy, modify, merge, publish,
distribute, sublicense, and/or sell copies of the Software, and to
permit persons to whom the Software is furnished to do so, subject to
the following conditions:
The above copyright notice and this permission notice shall be
included in all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE.
*/
#include "SeqLib/BFC.h"
#include <fml/bfc.h>
#include <stdexcept>
#include <algorithm>
namespace SeqLib {
bool BFC::AddSequence(const char* seq, const char* qual, const char* name) {
// do the intial allocation
if (n_seqs == 0 && !m_seqs) {
m_seqs_size = 32;
m_seqs = (fml_seq1_t*)malloc(m_seqs_size * sizeof(fml_seq1_t));
}
// realloc if not enough space
else if (n_seqs >= m_seqs_size) {
m_seqs_size = 2 * m_seqs_size;
m_seqs = (fml_seq1_t*)realloc(m_seqs, m_seqs_size * sizeof(fml_seq1_t));
}
if (!m_seqs)
return false;
// make sure seq and qual are even valid (if qual provided)
if (strlen(qual) && seq && qual)
if (strlen(seq) != strlen(qual))
return false;
if (!strlen(seq))
return false;
fml_seq1_t *s;
s = &m_seqs[n_seqs];
s->seq = strdup(seq);
s->qual = 0;
if (strlen(qual)) {
s->qual = strdup(qual);
}
s->l_seq = strlen(seq);
n_seqs++;
m_names.push_back(strdup(name));
assert(m_names.size() == n_seqs);
return true;
}
bool BFC::ErrorCorrect() {
correct_reads();
return true;
}
bool BFC::Train() {
learn_correct();
return true;
}
bool BFC::GetSequence(std::string& s, std::string& q) {
if (m_idx >= n_seqs)
return false;
assert(m_idx < n_seqs);
assert(m_names.size() == n_seqs);
s = std::string(m_seqs[m_idx].seq);
q = std::string(m_names[m_idx]);
std::transform(s.begin(), s.end(), s.begin(), ::toupper);
++m_idx;
return true;
}
bool BFC::CorrectSequence(std::string& str, const std::string& q) {
assert(n_seqs == 0);
assert(m_names.size() == 0);
m_seqs = (fml_seq1_t*)malloc(1 * sizeof(fml_seq1_t));
n_seqs = 1;
//uint64_t size = 0;
//for (std::vector<char*>::const_iterator r = v.begin(); r != v.end(); ++r) {
// for (auto& r : v) {
fml_seq1_t *s;
s = &m_seqs[0];
s->seq = strdup(str.c_str());
s->qual = q.empty() || q.length() != str.length() ? NULL : strdup(q.c_str());
s->l_seq = str.length();
// do the error correction of this one sequence
correct_reads();
// add a dummy name
m_names.push_back(strdup("1"));
// send to uppercase, and return
std::string cstr = std::string(m_seqs[0].seq);
std::transform(cstr.begin(), cstr.end(), cstr.begin(), ::toupper);
str = cstr;
clear();
return true;
}
void free_char(char*& c) {
if (c) {
free (c);
c = NULL;
}
}
void BFC::clear() {
assert(m_names.size() == n_seqs);
for (size_t i = 0; i < n_seqs; ++i) {
free_char(m_names[i]);
free_char(m_seqs[i].seq);
free_char(m_seqs[i].qual);
}
if (m_seqs)
free(m_seqs);
m_seqs = 0;
n_seqs = 0;
m_names.clear();
m_seqs_size = 0;
m_idx = 0;
}
void BFC::learn_correct() {
// options
fml_opt_init(&fml_opt);
// if kmer is 0, fix
if (kmer <= 0) {
fml_opt_adjust(&fml_opt, n_seqs, m_seqs);
kmer = fml_opt.ec_k;
}
// initialize BFC options
for (size_t i = 0; i < n_seqs; ++i)
tot_len += m_seqs[i].l_seq; // compute total length
bfc_opt.l_pre = tot_len - 8 < 20? tot_len - 8 : 20;
// setup the counting of kmers
memset(&es, 0, sizeof(ec_step_t));
//kmer is learned before this
bfc_opt.k = kmer;
//es.opt = &bfc_opt, es.n_seqs = n_seqs, es.seqs = m_seqs, es.flt_uniq = flt_uniq;
// hold count info. also called bfc_ch_s. Composed of
// int k
// int l_pre
// cnthash_t **h
// h is of size 1<<l_pre (2^l_pre). It is array of hash tables
// h[i] is initialized with kh_init(cnt) which makes a cnthash_t
// bfc_ch_t *ch; // set in BFC.h
// do the counting
ch = fml_count(n_seqs, m_seqs, bfc_opt.k, bfc_opt.q, bfc_opt.l_pre, bfc_opt.n_threads);
#ifdef DEBUG_BFC
// size of random hash value
khint_t k;
int* ksize = (int*)calloc(1<<ch->l_pre, sizeof(int));
for (int i = 0; i < (1<<ch->l_pre); ++i) {
for (k = kh_begin(ch->h[i]); k != kh_end(ch->h[i]); ++k)
++ksize[i];
fprintf(stderr, "K: %d S: %d\n", i, ksize[i]);
}
#endif
}
void BFC::correct_reads() {
assert(kmer > 0);
es.ch = ch;
es.opt = &bfc_opt;
es.n_seqs = n_seqs;
es.seqs = m_seqs;
es.flt_uniq = flt_uniq;
// make the histogram?
// es.ch is unchanged (const)
int mode = bfc_ch_hist(es.ch, hist, hist_high);
for (int i = fml_opt.min_cnt; i < 256; ++i)
sum_k += hist[i], tot_k += i * hist[i];
#ifdef DEBUG_BFC
std::cerr << " sum_k " << sum_k << " tot_k " << tot_k << std::endl;
fprintf(stderr, "MODE: %d\n", mode);
for (int i = fml_opt.min_cnt; i < 256; ++i) {
fprintf(stderr, "hist[%d]: %d\n",i,hist[i]);
}
for (int i = fml_opt.min_cnt; i < 64; ++i) {
fprintf(stderr, "hist_high[%d]: %d\n",i,hist_high[i]);
}
#endif
kcov = (float)tot_k / sum_k;
bfc_opt.min_cov = (int)(BFC_EC_MIN_COV_COEF * kcov + .499);
bfc_opt.min_cov = bfc_opt.min_cov < fml_opt.max_cnt? bfc_opt.min_cov : fml_opt.max_cnt;
bfc_opt.min_cov = bfc_opt.min_cov > fml_opt.min_cnt? bfc_opt.min_cov : fml_opt.min_cnt;
#ifdef DEBUG_BFC
fprintf(stderr, "kcov: %f mincov: %d mode %d \n", kcov, bfc_opt.min_cov, mode);
#endif
// do the actual error correction
kmer_correct(&es, mode, ch);
return;
}
}
|