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 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710
|
////////////////////////////////////////////////////////////////
// MultiSequence.h
//
// Utilities for reading/writing multiple sequence data.
/////////////////////////////////////////////////////////////////
#ifndef MULTISEQUENCE_H
#define MULTISEQUENCE_H
#include <cctype>
#include <string>
#include <fstream>
#include <iostream>
#include <sstream>
#include <algorithm>
#include <set>
#include "SafeVector.h"
#include "Sequence.h"
#include "FileBuffer.h"
/////////////////////////////////////////////////////////////////
// MultiSequence
//
// Class for multiple sequence alignment input/output.
/////////////////////////////////////////////////////////////////
class MultiSequence {
SafeVector<Sequence *> *sequences;
public:
/////////////////////////////////////////////////////////////////
// MultiSequence::MultiSequence()
//
// Default constructor.
/////////////////////////////////////////////////////////////////
MultiSequence () : sequences (NULL) {}
/////////////////////////////////////////////////////////////////
// MultiSequence::MultiSequence()
//
// Constructor. Load MFA from a FileBuffer object.
/////////////////////////////////////////////////////////////////
MultiSequence (FileBuffer &infile) : sequences (NULL) {
LoadMFA (infile);
}
/////////////////////////////////////////////////////////////////
// MultiSequence::MultiSequence()
//
// Constructor. Load MFA from a filename.
/////////////////////////////////////////////////////////////////
MultiSequence (const string &filename) : sequences (NULL){
LoadMFA (filename);
}
/////////////////////////////////////////////////////////////////
// MultiSequence::~MultiSequence()
//
// Destructor. Gets rid of sequence objects contained in the
// multiple alignment.
/////////////////////////////////////////////////////////////////
~MultiSequence(){
// if sequences allocated
if (sequences){
// free all sequences
for (SafeVector<Sequence *>::iterator iter = sequences->begin(); iter != sequences->end(); ++iter){
assert (*iter);
delete *iter;
*iter = NULL;
}
// free sequence vector
delete sequences;
sequences = NULL;
}
}
/////////////////////////////////////////////////////////////////
// MultiSequence::LoadMFA()
//
// Load MFA from a filename.
/////////////////////////////////////////////////////////////////
void LoadMFA (const string &filename, bool stripGaps = false){
// try opening file
FileBuffer infile (filename.c_str());
if (infile.fail()){
cerr << "ERROR: Could not open file '" << filename << "' for reading." << endl;
exit (1);
}
// if successful, then load using other LoadMFA() routine
LoadMFA (infile, stripGaps);
infile.close();
}
/////////////////////////////////////////////////////////////////
// MultiSequence::LoadMFA()
//
// Load MSF from a FileBuffer object.
/////////////////////////////////////////////////////////////////
void ParseMSF (FileBuffer &infile, string header, bool stripGaps = false){
SafeVector<SafeVector<char> *> seqData;
SafeVector<string> seqNames;
SafeVector<int> seqLengths;
istringstream in;
bool valid = true;
bool missingHeader = false;
bool clustalW = false;
// read until data starts
while (!infile.eof() && header.find ("..", 0) == string::npos){
if (header.find ("CLUSTAL", 0) == 0 || header.find ("PROBCONS", 0) == 0){
clustalW = true;
break;
}
infile.GetLine (header);
if (header.find ("//", 0) != string::npos){
missingHeader = true;
break;
}
}
// read until end-of-file
while (valid){
infile.GetLine (header);
if (infile.eof()) break;
string word;
in.clear();
in.str(header);
// check if there's anything on this line
if (in >> word){
// clustalw name parsing
if (clustalW){
if (!isspace(header[0]) && find (seqNames.begin(), seqNames.end(), word) == seqNames.end()){
seqNames.push_back (word);
seqData.push_back (new SafeVector<char>());
seqLengths.push_back (0);
seqData[(int) seqData.size() - 1]->push_back ('@');
}
}
// look for new sequence label
if (word == string ("Name:")){
if (in >> word){
seqNames.push_back (word);
seqData.push_back (new SafeVector<char>());
seqLengths.push_back (0);
seqData[(int) seqData.size() - 1]->push_back ('@');
}
else
valid = false;
}
// check if this is sequence data
else if (find (seqNames.begin(), seqNames.end(), word) != seqNames.end()){
int index = find (seqNames.begin(), seqNames.end(), word) - seqNames.begin();
// read all remaining characters on the line
char ch;
while (in >> ch){
if (isspace (ch)) continue;
if (ch >= 'a' && ch <= 'z') ch = ch - 'a' + 'A';
if (ch == '.') ch = '-';
if (stripGaps && ch == '-') continue;
if (!((ch >= 'A' && ch <= 'Z') || ch == '*' || ch == '-')){
cerr << "ERROR: Unknown character encountered: " << ch << endl;
exit (1);
}
// everything's ok so far, so just store this character.
seqData[index]->push_back (ch);
seqLengths[index]++;
}
}
else if (missingHeader){
seqNames.push_back (word);
seqData.push_back (new SafeVector<char>());
seqLengths.push_back (0);
seqData[(int) seqData.size() - 1]->push_back ('@');
int index = (int) seqNames.size() - 1;
// read all remaining characters on the line
char ch;
while (in >> ch){
if (isspace (ch)) continue;
if (ch >= 'a' && ch <= 'z') ch = ch - 'a' + 'A';
if (ch == '.') ch = '-';
if (stripGaps && ch == '-') continue;
if (!((ch >= 'A' && ch <= 'Z') || ch == '*' || ch == '-')){
cerr << "ERROR: Unknown character encountered: " << ch << endl;
exit (1);
}
// everything's ok so far, so just store this character.
seqData[index]->push_back (ch);
seqLengths[index]++;
}
}
}
}
// check for errors
if (seqNames.size() == 0){
cerr << "ERROR: No sequences read!" << endl;
exit (1);
}
assert (!sequences);
sequences = new SafeVector<Sequence *>;
for (int i = 0; i < (int) seqNames.size(); i++){
if (seqLengths[i] == 0){
cerr << "ERROR: Sequence of zero length!" << endl;
exit (1);
}
Sequence *seq = new Sequence (seqData[i], seqNames[i], seqLengths[i], i, i);
sequences->push_back (seq);
}
}
/////////////////////////////////////////////////////////////////
// MultiSequence::LoadMFA()
//
// Load MFA from a FileBuffer object.
/////////////////////////////////////////////////////////////////
void LoadMFA (FileBuffer &infile, bool stripGaps = false){
// check to make sure that file reading is ok
if (infile.fail()){
cerr << "ERROR: Error reading file." << endl;
exit (1);
}
// read all sequences
while (true){
// get the sequence label as being the current # of sequences
// NOTE: sequence labels here are zero-based
int index = (!sequences) ? 0 : sequences->size();
// read the sequence
Sequence *seq = new Sequence (infile, stripGaps);
if (seq->Fail()){
// check if alternative file format (i.e. not MFA)
if (index == 0){
string header = seq->GetHeader();
if (header.length() > 0 && header[0] != '>'){
// try MSF format
ParseMSF (infile, header);
break;
}
}
delete seq;
break;
}
seq->SetLabel (index);
// add the sequence to the list of current sequences
if (!sequences) sequences = new SafeVector<Sequence *>;
sequences->push_back (seq);
}
// make sure at least one sequence was read
if (!sequences){
cerr << "ERROR: No sequences read." << endl;
exit (1);
}
}
/////////////////////////////////////////////////////////////////
// MultiSequence::AddSequence()
//
// Add another sequence to an existing sequence list
/////////////////////////////////////////////////////////////////
void AddSequence (Sequence *sequence){
assert (sequence);
assert (!sequence->Fail());
// add sequence
if (!sequences) sequences = new SafeVector<Sequence *>;
sequences->push_back (sequence);
}
/////////////////////////////////////////////////////////////////
// MultiSequence::RemoveSequence()
//
// Remove a sequence from the MultiSequence
/////////////////////////////////////////////////////////////////
void RemoveSequence (int index){
assert (sequences);
assert (index >= 0 && index < (int) sequences->size());
delete (*sequences)[index];
sequences->erase (sequences->begin() + index);
}
/////////////////////////////////////////////////////////////////
// MultiSequence::WriteMFA()
//
// Write MFA to the outfile. Allows the user to specify the
// number of columns for the output. Also, useIndices determines
// whether or not the actual sequence comments will be printed
// out or whether the artificially assigned sequence labels will
// be used instead.
/////////////////////////////////////////////////////////////////
void WriteMFA (ostream &outfile, int numColumns = 60, bool useIndices = false){
if (!sequences) return;
// loop through all sequences and write them out
for (SafeVector<Sequence *>::iterator iter = sequences->begin(); iter != sequences->end(); ++iter){
(*iter)->WriteMFA (outfile, numColumns, useIndices);
}
}
/////////////////////////////////////////////////////////////////
// MultiSequence::GetAnnotationChar()
//
// Return CLUSTALW annotation for column.
/////////////////////////////////////////////////////////////////
char GetAnnotationChar (SafeVector<char> &column){
SafeVector<int> counts (256, 0);
int allChars = (int) column.size();
for (int i = 0; i < allChars; i++){
counts[(unsigned char) toupper(column[i])]++;
}
allChars -= counts[(unsigned char) '-'];
if (allChars == 1) return ' ';
for (int i = 0; i < 256; i++) if ((char) i != '-' && counts[i] == allChars) return '*';
if (counts[(unsigned char) 'S'] +
counts[(unsigned char) 'T'] +
counts[(unsigned char) 'A'] == allChars)
return ':';
if (counts[(unsigned char) 'N'] +
counts[(unsigned char) 'E'] +
counts[(unsigned char) 'Q'] +
counts[(unsigned char) 'K'] == allChars)
return ':';
if (counts[(unsigned char) 'N'] +
counts[(unsigned char) 'H'] +
counts[(unsigned char) 'Q'] +
counts[(unsigned char) 'K'] == allChars)
return ':';
if (counts[(unsigned char) 'N'] +
counts[(unsigned char) 'D'] +
counts[(unsigned char) 'E'] +
counts[(unsigned char) 'Q'] == allChars)
return ':';
if (counts[(unsigned char) 'Q'] +
counts[(unsigned char) 'H'] +
counts[(unsigned char) 'R'] +
counts[(unsigned char) 'K'] == allChars)
return ':';
if (counts[(unsigned char) 'M'] +
counts[(unsigned char) 'I'] +
counts[(unsigned char) 'L'] +
counts[(unsigned char) 'V'] == allChars)
return ':';
if (counts[(unsigned char) 'M'] +
counts[(unsigned char) 'I'] +
counts[(unsigned char) 'L'] +
counts[(unsigned char) 'F'] == allChars)
return ':';
if (counts[(unsigned char) 'H'] +
counts[(unsigned char) 'Y'] == allChars)
return ':';
if (counts[(unsigned char) 'F'] +
counts[(unsigned char) 'Y'] +
counts[(unsigned char) 'W'] == allChars)
return ':';
if (counts[(unsigned char) 'C'] +
counts[(unsigned char) 'S'] +
counts[(unsigned char) 'A'] == allChars)
return '.';
if (counts[(unsigned char) 'A'] +
counts[(unsigned char) 'T'] +
counts[(unsigned char) 'V'] == allChars)
return '.';
if (counts[(unsigned char) 'S'] +
counts[(unsigned char) 'A'] +
counts[(unsigned char) 'G'] == allChars)
return '.';
if (counts[(unsigned char) 'S'] +
counts[(unsigned char) 'T'] +
counts[(unsigned char) 'N'] +
counts[(unsigned char) 'K'] == allChars)
return '.';
if (counts[(unsigned char) 'S'] +
counts[(unsigned char) 'T'] +
counts[(unsigned char) 'P'] +
counts[(unsigned char) 'A'] == allChars)
return '.';
if (counts[(unsigned char) 'S'] +
counts[(unsigned char) 'G'] +
counts[(unsigned char) 'N'] +
counts[(unsigned char) 'D'] == allChars)
return '.';
if (counts[(unsigned char) 'S'] +
counts[(unsigned char) 'N'] +
counts[(unsigned char) 'D'] +
counts[(unsigned char) 'E'] +
counts[(unsigned char) 'Q'] +
counts[(unsigned char) 'K'] == allChars)
return '.';
if (counts[(unsigned char) 'N'] +
counts[(unsigned char) 'D'] +
counts[(unsigned char) 'E'] +
counts[(unsigned char) 'Q'] +
counts[(unsigned char) 'H'] +
counts[(unsigned char) 'K'] == allChars)
return '.';
if (counts[(unsigned char) 'N'] +
counts[(unsigned char) 'E'] +
counts[(unsigned char) 'H'] +
counts[(unsigned char) 'Q'] +
counts[(unsigned char) 'R'] +
counts[(unsigned char) 'K'] == allChars)
return '.';
if (counts[(unsigned char) 'F'] +
counts[(unsigned char) 'V'] +
counts[(unsigned char) 'L'] +
counts[(unsigned char) 'I'] +
counts[(unsigned char) 'M'] == allChars)
return '.';
if (counts[(unsigned char) 'H'] +
counts[(unsigned char) 'F'] +
counts[(unsigned char) 'Y'] == allChars)
return '.';
return ' ';
}
/////////////////////////////////////////////////////////////////
// MultiSequence::WriteALN()
//
// Write ALN to the outfile. Allows the user to specify the
// number of columns for the output.
/////////////////////////////////////////////////////////////////
void WriteALN (ostream &outfile, int numColumns = 60){
if (!sequences) return;
outfile << "Probalign version 1.4 multiple sequence alignment" << endl;
int longestComment = 0;
SafeVector<SafeVector<char>::iterator> ptrs (GetNumSequences());
SafeVector<int> lengths (GetNumSequences());
for (int i = 0; i < GetNumSequences(); i++){
ptrs[i] = GetSequence (i)->GetDataPtr();
lengths[i] = GetSequence (i)->GetLength();
longestComment = max (longestComment, (int) GetSequence(i)->GetName().length());
}
longestComment += 4;
int writtenChars = 0;
bool allDone = false;
while (!allDone){
outfile << endl;
allDone = true;
// loop through all sequences and write them out
for (int i = 0; i < GetNumSequences(); i++){
if (writtenChars < lengths[i]){
outfile << GetSequence(i)->GetName();
for (int j = 0; j < longestComment - (int) GetSequence(i)->GetName().length(); j++)
outfile << ' ';
for (int j = 0; j < numColumns; j++){
if (writtenChars + j < lengths[i])
outfile << ptrs[i][writtenChars + j + 1];
else
break;
}
outfile << endl;
if (writtenChars + numColumns < lengths[i]) allDone = false;
}
}
// write annotation line
for (int j = 0; j < longestComment; j++)
outfile << ' ';
for (int j = 0; j < numColumns; j++){
SafeVector<char> column;
for (int i = 0; i < GetNumSequences(); i++)
if (writtenChars + j < lengths[i])
column.push_back (ptrs[i][writtenChars + j + 1]);
if (column.size() > 0)
outfile << GetAnnotationChar (column);
}
outfile << endl;
writtenChars += numColumns;
}
}
/////////////////////////////////////////////////////////////////
// MultiSequence::GetSequence()
//
// Retrieve a sequence from the MultiSequence object.
/////////////////////////////////////////////////////////////////
Sequence* GetSequence (int i){
assert (sequences);
assert (0 <= i && i < (int) sequences->size());
return (*sequences)[i];
}
/////////////////////////////////////////////////////////////////
// MultiSequence::GetSequence()
//
// Retrieve a sequence from the MultiSequence object
// (const version).
/////////////////////////////////////////////////////////////////
const Sequence* GetSequence (int i) const {
assert (sequences);
assert (0 <= i && i < (int) sequences->size());
return (*sequences)[i];
}
/////////////////////////////////////////////////////////////////
// MultiSequence::GetNumSequences()
//
// Returns the number of sequences in the MultiSequence.
/////////////////////////////////////////////////////////////////
int GetNumSequences () const {
if (!sequences) return 0;
return (int) sequences->size();
}
/////////////////////////////////////////////////////////////////
// MultiSequence::SortByHeader()
//
// Organizes the sequences according to their sequence headers
// in ascending order.
/////////////////////////////////////////////////////////////////
void SortByHeader () {
assert (sequences);
// a quick and easy O(n^2) sort
for (int i = 0; i < (int) sequences->size()-1; i++){
for (int j = i+1; j < (int) sequences->size(); j++){
if ((*sequences)[i]->GetHeader() > (*sequences)[j]->GetHeader())
swap ((*sequences)[i], (*sequences)[j]);
}
}
}
/////////////////////////////////////////////////////////////////
// MultiSequence::SortByLabel()
//
// Organizes the sequences according to their sequence labels
// in ascending order.
/////////////////////////////////////////////////////////////////
void SortByLabel () {
assert (sequences);
// a quick and easy O(n^2) sort
for (int i = 0; i < (int) sequences->size()-1; i++){
for (int j = i+1; j < (int) sequences->size(); j++){
if ((*sequences)[i]->GetSortLabel() > (*sequences)[j]->GetSortLabel())
swap ((*sequences)[i], (*sequences)[j]);
}
}
}
/////////////////////////////////////////////////////////////////
// MultiSequence::SaveOrdering()
//
// Relabels sequences so as to preserve the current ordering.
/////////////////////////////////////////////////////////////////
void SaveOrdering () {
assert (sequences);
for (int i = 0; i < (int) sequences->size(); i++)
(*sequences)[i]->SetSortLabel (i);
}
/////////////////////////////////////////////////////////////////
// MultiSequence::Project()
//
// Given a set of indices, extract all sequences from the current
// MultiSequence object whose index is included in the set.
// Then, project the multiple alignments down to the desired
// subset, and return the projection as a new MultiSequence
// object.
/////////////////////////////////////////////////////////////////
MultiSequence *Project (const set<int> &indices){
SafeVector<SafeVector<char>::iterator> oldPtrs (indices.size());
SafeVector<SafeVector<char> *> newPtrs (indices.size());
assert (indices.size() != 0);
// grab old data
int i = 0;
for (set<int>::const_iterator iter = indices.begin(); iter != indices.end(); ++iter){
oldPtrs[i++] = GetSequence (*iter)->GetDataPtr();
}
// compute new length
int oldLength = GetSequence (*indices.begin())->GetLength();
int newLength = 0;
for (i = 1; i <= oldLength; i++){
// check to see if there is a gap in every sequence of the set
bool found = false;
for (int j = 0; !found && j < (int) indices.size(); j++)
found = (oldPtrs[j][i] != '-');
// if not, then this column counts towards the sequence length
if (found) newLength++;
}
// build new alignments
for (i = 0; i < (int) indices.size(); i++){
newPtrs[i] = new SafeVector<char>(); assert (newPtrs[i]);
newPtrs[i]->push_back ('@');
}
// add all needed columns
for (i = 1; i <= oldLength; i++){
// make sure column is not gapped in all sequences in the set
bool found = false;
for (int j = 0; !found && j < (int) indices.size(); j++)
found = (oldPtrs[j][i] != '-');
// if not, then add it
if (found){
for (int j = 0; j < (int) indices.size(); j++)
newPtrs[j]->push_back (oldPtrs[j][i]);
}
}
// wrap sequences in MultiSequence object
MultiSequence *ret = new MultiSequence();
i = 0;
for (set<int>::const_iterator iter = indices.begin(); iter != indices.end(); ++iter){
ret->AddSequence (new Sequence (newPtrs[i++], GetSequence (*iter)->GetHeader(), newLength,
GetSequence (*iter)->GetSortLabel(), GetSequence (*iter)->GetLabel()));
}
return ret;
}
};
#endif
|