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 449 450 451 452 453 454 455 456 457 458
|
/*
* pintail.cpp
* Mothur
*
* Created by Sarah Westcott on 7/9/09.
* Copyright 2009 Schloss Lab UMASS Amherst. All rights reserved.
*
*/
#include "pintail.h"
#include "ignoregaps.h"
#include "eachgapdist.h"
//********************************************************************************************************************
//sorts lowest to highest
inline bool compareQuanMembers(quanMember left, quanMember right){
return (left.score < right.score);
}
//***************************************************************************************************************
Pintail::Pintail(string filename, string temp, bool f, string mask, string cons, string q, int win, int inc, string o, string version) : MothurChimera() {
try {
fastafile = filename;
templateFileName = temp; templateSeqs = readSeqs(temp);
filter = f;
setMask(mask);
consfile = cons;
quanfile = q;
window = win;
increment = inc;
outputDir = o;
distcalculator = new eachGapDist(1.0);
decalc = new DeCalculator();
doPrep(version);
}
catch(exception& e) {
m->errorOut(e, "Pintail", "Pintail");
exit(1);
}
}
//***************************************************************************************************************
Pintail::~Pintail() {
try {
delete distcalculator;
delete decalc;
}
catch(exception& e) {
m->errorOut(e, "Pintail", "~Pintail");
exit(1);
}
}
//***************************************************************************************************************
int Pintail::doPrep(string version) {
try {
mergedFilterString = "";
windowSizesTemplate.resize(templateSeqs.size(), window);
quantiles.resize(100); //one for every percent mismatch
quantilesMembers.resize(100); //one for every percent mismatch
//if the user does not enter a mask then you want to keep all the spots in the alignment
if (seqMask.length() == 0) { decalc->setAlignmentLength(templateSeqs[0]->getAligned().length()); }
else { decalc->setAlignmentLength(seqMask.length()); }
decalc->setMask(seqMask);
m->mothurOut("Getting conservation... "); cout.flush();
if (consfile == "") {
m->mothurOut("Calculating probability of conservation for your template sequences. This can take a while... I will output the frequency of the highest base in each position to a .freq file so that you can input them using the conservation parameter next time you run this command. Providing the .freq file will improve speed. "); cout.flush();
probabilityProfile = decalc->calcFreq(templateSeqs, templateFileName, version);
if (m->getControl_pressed()) { return 0; }
m->mothurOut("Done.\n");
}else { probabilityProfile = readFreq(); m->mothurOut("Done."); }
m->mothurOutEndLine();
//make P into Q
for (int i = 0; i < probabilityProfile.size(); i++) { probabilityProfile[i] = 1 - probabilityProfile[i]; } //
bool reRead = false;
//create filter if needed for later
if (filter) {
//read in all query seqs
vector<Sequence*> tempQuerySeqs = readSeqs(fastafile);
vector<Sequence*> temp;
//merge query seqs and template seqs
temp = templateSeqs;
for (int i = 0; i < tempQuerySeqs.size(); i++) { temp.push_back(tempQuerySeqs[i]); }
if (seqMask != "") {
reRead = true;
//mask templates
for (int i = 0; i < temp.size(); i++) {
if (m->getControl_pressed()) {
for (int i = 0; i < tempQuerySeqs.size(); i++) { delete tempQuerySeqs[i]; }
return 0;
}
decalc->runMask(temp[i]);
}
}
mergedFilterString = createFilter(temp, 0.5);
if (m->getControl_pressed()) {
for (int i = 0; i < tempQuerySeqs.size(); i++) { delete tempQuerySeqs[i]; }
return 0;
}
//reread template seqs
for (int i = 0; i < tempQuerySeqs.size(); i++) { delete tempQuerySeqs[i]; }
}
//quantiles are used to determine whether the de values found indicate a chimera
//if you have to calculate them, its time intensive because you are finding the de and deviation values for each
//combination of sequences in the template
if (quanfile != "") {
quantiles = readQuantiles();
}else {
if ((!filter) && (seqMask != "")) { //if you didn't filter but you want to mask. if you filtered then you did mask first above.
reRead = true;
//mask templates
for (int i = 0; i < templateSeqs.size(); i++) {
if (m->getControl_pressed()) { return 0; }
decalc->runMask(templateSeqs[i]);
}
}
if (filter) {
reRead = true;
for (int i = 0; i < templateSeqs.size(); i++) {
if (m->getControl_pressed()) { return 0; }
runFilter(templateSeqs[i]);
}
}
m->mothurOut("Calculating quantiles for your template. This can take a while... I will output the quantiles to a .quan file that you can input them using the quantiles parameter next time you run this command. Providing the .quan file will dramatically improve speed. "); cout.flush();
quantilesMembers = decalc->getQuantiles(templateSeqs, windowSizesTemplate, window, probabilityProfile, increment, 0, templateSeqs.size());
if (m->getControl_pressed()) { return 0; }
string noOutliers, outliers;
if ((!filter) && (seqMask == "")) {
noOutliers = util.getRootName(util.getSimpleName(templateFileName)) + "pintail.quan";
}else if ((!filter) && (seqMask != "")) {
noOutliers =util.getRootName(util.getSimpleName(templateFileName)) + "pintail.masked.quan";
}else if ((filter) && (seqMask != "")) {
noOutliers = util.getRootName(util.getSimpleName(templateFileName)) + "pintail.filtered." + util.getSimpleName(util.getRootName(fastafile)) + "masked.quan";
}else if ((filter) && (seqMask == "")) {
noOutliers = util.getRootName(util.getSimpleName(templateFileName)) + "pintail.filtered." + util.getSimpleName(util.getRootName(fastafile)) + "quan";
}
decalc->removeObviousOutliers(quantilesMembers, templateSeqs.size());
if (m->getControl_pressed()) { return 0; }
string outputString = "#" + current->getVersion() + "\n";
//adjust quantiles
for (int i = 0; i < quantilesMembers.size(); i++) {
vector<float> temp;
if (quantilesMembers[i].size() == 0) {
//in case this is not a distance found in your template files
for (int g = 0; g < 6; g++) {
temp.push_back(0.0);
}
}else{
sort(quantilesMembers[i].begin(), quantilesMembers[i].end());
//save 10%
temp.push_back(quantilesMembers[i][int(quantilesMembers[i].size() * 0.10)]);
//save 25%
temp.push_back(quantilesMembers[i][int(quantilesMembers[i].size() * 0.25)]);
//save 50%
temp.push_back(quantilesMembers[i][int(quantilesMembers[i].size() * 0.5)]);
//save 75%
temp.push_back(quantilesMembers[i][int(quantilesMembers[i].size() * 0.75)]);
//save 95%
temp.push_back(quantilesMembers[i][int(quantilesMembers[i].size() * 0.95)]);
//save 99%
temp.push_back(quantilesMembers[i][int(quantilesMembers[i].size() * 0.99)]);
}
//output quan value
outputString += toString(i+1);
for (int u = 0; u < temp.size(); u++) { outputString += "\t" + toString(temp[u]); }
outputString += "\n";
quantiles[i] = temp;
}
printQuanFile(noOutliers, outputString);
//free memory
quantilesMembers.clear();
m->mothurOut("Done.\n");
}
if (reRead) {
for (int i = 0; i < templateSeqs.size(); i++) { delete templateSeqs[i]; }
templateSeqs.clear();
templateSeqs = readSeqs(templateFileName);
}
return 0;
}
catch(exception& e) {
m->errorOut(e, "Pintail", "doPrep");
exit(1);
}
}
//***************************************************************************************************************
Sequence Pintail::print(ostream& out, ostream& outAcc) {
try {
int index = ceil(deviation);
//is your DE value higher than the 95%
string chimera;
if (index != 0) { //if index is 0 then its an exact match to a template seq
if (util.isEqual(quantiles[index][4], 0)) {
chimera = "Your template does not include sequences that provide quantile values at distance " + toString(index);
}else {
if (DE > quantiles[index][4]) { chimera = "Yes"; }
else { chimera = "No"; }
}
}else{ chimera = "No"; }
out << querySeq->getName() << '\t' << "div: " << deviation << "\tstDev: " << DE << "\tchimera flag: " << chimera << endl;
if (chimera == "Yes") {
m->mothurOut(querySeq->getName() + "\tdiv: " + toString(deviation) + "\tstDev: " + toString(DE) + "\tchimera flag: " + chimera+ "\n");
outAcc << querySeq->getName() << endl;
}
out << "Observed";
for (int j = 0; j < obsDistance.size(); j++) { out << '\t' << obsDistance[j]; }
out << endl;
out << "Expected";
for (int m = 0; m < expectedDistance.size(); m++) { out << '\t' << expectedDistance[m] ; }
out << endl;
return *querySeq;
}
catch(exception& e) {
m->errorOut(e, "Pintail", "print");
exit(1);
}
}
//***************************************************************************************************************
int Pintail::getChimeras(Sequence* query) {
try {
querySeq = query;
trimmed.clear();
windowSizes = window;
//find pairs has to be done before a mask
bestfit = findPairs(query);
if (m->getControl_pressed()) { return 0; }
//if they mask
if (seqMask != "") {
decalc->runMask(query);
decalc->runMask(bestfit);
}
if (filter) { //must be done after a mask
runFilter(query);
runFilter(bestfit);
}
//trim seq
decalc->trimSeqs(query, bestfit, trimmed);
//find windows
it = trimmed.begin();
windowsForeachQuery = decalc->findWindows(query, it->first, it->second, windowSizes, increment);
//find observed distance
obsDistance = decalc->calcObserved(query, bestfit, windowsForeachQuery, windowSizes);
if (m->getControl_pressed()) { return 0; }
Qav = decalc->findQav(windowsForeachQuery, windowSizes, probabilityProfile);
if (m->getControl_pressed()) { return 0; }
//find alpha
seqCoef = decalc->getCoef(obsDistance, Qav);
//calculating expected distance
expectedDistance = decalc->calcExpected(Qav, seqCoef);
if (m->getControl_pressed()) { return 0; }
//finding de
DE = decalc->calcDE(obsDistance, expectedDistance);
if (m->getControl_pressed()) { return 0; }
//find distance between query and closest match
it = trimmed.begin();
deviation = decalc->calcDist(query, bestfit, it->first, it->second);
delete bestfit;
return 0;
}
catch(exception& e) {
m->errorOut(e, "Pintail", "getChimeras");
exit(1);
}
}
//***************************************************************************************************************
vector<float> Pintail::readFreq() {
try {
//read in probabilities and store in vector
int pos; float num;
vector<float> prob;
set<int> h = decalc->getPos(); //positions of bases in masking sequence
ifstream in; util.openInputFile(consfile, in);
//read version
string line = util.getline(in); gobble(in);
while(!in.eof()){
in >> pos >> num;
if (h.count(pos) > 0) {
float Pi;
Pi = (num - 0.25) / 0.75;
//cannot have probability less than 0.
if (Pi < 0) { Pi = 0.0; }
//do you want this spot
prob.push_back(Pi);
}
gobble(in);
}
in.close();
return prob;
}
catch(exception& e) {
m->errorOut(e, "Pintail", "readFreq");
exit(1);
}
}
//***************************************************************************************************************
//calculate the distances from each query sequence to all sequences in the template to find the closest sequence
Sequence* Pintail::findPairs(Sequence* q) {
try {
Sequence* seqsMatches;
seqsMatches = decalc->findClosest(q, templateSeqs);
return seqsMatches;
}
catch(exception& e) {
m->errorOut(e, "Pintail", "findPairs");
exit(1);
}
}
//***************************************************************************************************************
vector< vector<float> > Pintail::readQuantiles() {
try {
int num;
float ten, twentyfive, fifty, seventyfive, ninetyfive, ninetynine;
vector< vector<float> > quan;
vector <float> temp; temp.resize(6, 0);
//to fill 0
quan.push_back(temp);
ifstream in; util.openInputFile(quanfile, in);
//read version
string line = util.getline(in); gobble(in);
while(!in.eof()){
in >> num >> ten >> twentyfive >> fifty >> seventyfive >> ninetyfive >> ninetynine;
temp.clear();
temp.push_back(ten);
temp.push_back(twentyfive);
temp.push_back(fifty);
temp.push_back(seventyfive);
temp.push_back(ninetyfive);
temp.push_back(ninetynine);
quan.push_back(temp);
gobble(in);
}
in.close();
return quan;
}
catch(exception& e) {
m->errorOut(e, "Pintail", "readQuantiles");
exit(1);
}
}
//***************************************************************************************************************/
void Pintail::printQuanFile(string file, string outputString) {
try {
ofstream outQuan;
util.openOutputFile(file, outQuan);
outQuan << outputString;
outQuan.close();
}
catch(exception& e) {
m->errorOut(e, "Pintail", "printQuanFile");
exit(1);
}
}
//***************************************************************************************************************/
|