#include "fullmatrix.h"
/**************************************************************************/
+
//This constructor reads a distance matrix file and stores the data in the matrix.
FullMatrix::FullMatrix(ifstream& filehandle) {
try{
globaldata = GlobalData::getInstance();
groupmap = globaldata->gGroupmap;
- float minSoFar = 0.0;
string name, group;
filehandle >> numSeqs >> name;
group = groupmap->getGroup(name);
if(group == "not found") { cout << "Error: Sequence '" << name << "' was not found in the group file, please correct." << endl; exit(1); }
- index[0].groupname = group;
+ index.resize(numSeqs);
+ index[0].groupName = group;
index[0].seqName = name;
//determine if matrix is square or lower triangle
//if it is square read the distances for the first sequence
char d;
+ bool square;
while((d=filehandle.get()) != EOF){
//is d a number meaning its square
square = true;
filehandle.putback(d);
- if (numSeqs >= 2) {
- //save first distance that is not distance to itself as minimum
- filehandle >> matrix[0][0] >> minSoFar;
- matrix[0][1] = minSoFar;
- }
-
- for(int i=2;i<numSeqs;i++){
+ for(int i=0;i<numSeqs;i++){
filehandle >> matrix[0][i];
- if (matrix[0][i] < minSoFar) { minSoFar = matrix[0][i]; }
}
- index[0].minDist = minSoFar;
break;
}
//sort sequences so they are gathered in groups for processing
sortGroups(0, numSeqs-1);
-
+
+ groups.push_back(index[0].groupName);
+ sizes.push_back(1);
+ int groupCount = 0;
+
+ for(int i=1;i<numSeqs;i++){
+ if(index[i].groupName == index[i-1].groupName){ sizes[groupCount]++; }
+ else{
+ sizes.push_back(1);
+ groups.push_back(index[i].groupName);
+ groupCount++;
+ }
+ }
+
}
catch(exception& e) {
cout << "Standard Error: " << e.what() << " has occurred in the FullMatrix class Function FullMatrix. Please contact Pat Schloss at pschloss@microbio.umass.edu." << "\n";
try {
Progress* reading;
- reading = new Progress("Reading matrix: ", numSeqs * numSeqs);
+ reading = new Progress("Reading matrix: ", numSeqs * numSeqs);
int count = 0;
- float distance, minSoFar;
- minSoFar = 0.0;
+
string group, name;
for(int i=1;i<numSeqs;i++){
filehandle >> name;
group = groupmap->getGroup(name);
- index[i].groupname = group;
+ index[i].groupName = group;
index[i].seqName = name;
- filehandle >> minSoFar;
- matrix[i][0] = minSoFar;
-
if(group == "not found") { cout << "Error: Sequence '" << name << "' was not found in the group file, please correct." << endl; exit(1); }
- for(int j=1;j<numSeqs;j++){
- filehandle >> distance;
+ for(int j=0;j<numSeqs;j++){
+ filehandle >> matrix[i][j];
- if ((distance < minSoFar) && (i != j)) { minSoFar = distance; }
-
- matrix[i][j] = distance;
count++;
reading->update(count);
}
-
- //save minimum value for each row
- index[i].minDist = minSoFar;
}
reading->finish();
delete reading;
void FullMatrix::readLTMatrix(ifstream& filehandle) {
try {
Progress* reading;
- reading = new Progress("Reading matrix: ", numSeqs * (numSeqs - 1) / 2);
+ reading = new Progress("Reading matrix: ", numSeqs * (numSeqs - 1) / 2);
int count = 0;
- float distance, minSoFar;
- minSoFar = 0.0;
+ float distance;
string group, name;
filehandle >> name;
group = groupmap->getGroup(name);
- index[i].groupname = group;
+ index[i].groupName = group;
index[i].seqName = name;
-
- filehandle >> minSoFar;
- matrix[i][0] = minSoFar;
if(group == "not found") { cout << "Error: Sequence '" << name << "' was not found in the group file, please correct." << endl; exit(1); }
- for(int j=1;j<i;j++){
+ for(int j=0;j<i;j++){
filehandle >> distance;
-
- if (distance < minSoFar) { minSoFar = distance; }
matrix[i][j] = distance; matrix[j][i] = distance;
count++;
reading->update(count);
}
- //save minimum value for each row
- index[i].minDist = minSoFar;
}
reading->finish();
delete reading;
}
/**************************************************************************/
+
void FullMatrix::sortGroups(int low, int high){
try{
int i = low;
int j = high;
- int y = 0;
+ float y = 0;
string name;
/* compare value */
//what group does this row belong to
- string z = index[(low + high) / 2].groupname;
+ string z = index[(low + high) / 2].groupName;
/* partition */
do {
/* find member above ... */
- while(index[i].groupname < z) i++;
+ while(index[i].groupName < z) i++;
/* find element below ... */
- while(index[j].groupname > z) j--;
+ while(index[j].groupName > z) j--;
if(i <= j) {
/* swap rows*/
}
//swap map elements
- z = index[i].groupname;
- index[i].groupname = index[j].groupname;
- index[j].groupname = z;
+ z = index[i].groupName;
+ index[i].groupName = index[j].groupName;
+ index[j].groupName = z;
name = index[i].seqName;
index[i].seqName = index[j].seqName;
}
/**************************************************************************/
-int FullMatrix::getNumSeqs(){ return numSeqs; }
+
+float FullMatrix::get(int i, int j){ return matrix[i][j]; }
+
+/**************************************************************************/
+
+vector<string> FullMatrix::getGroups(){ return groups; }
+
+/**************************************************************************/
+
+vector<int> FullMatrix::getSizes(){ return sizes; }
+
+/**************************************************************************/
+
+int FullMatrix::getNumGroups(){ return groups.size(); }
+
+/**************************************************************************/
+
+int FullMatrix::getNumSeqs(){ return numSeqs; }
+
/**************************************************************************/
-//print out matrix
+
void FullMatrix::printMatrix(ostream& out) {
try{
for (int i = 0; i < numSeqs; i++) {
- out << "row " << i << " group = " << index[i].groupname << " name = " << index[i].seqName << endl;
+ out << "row " << i << " group = " << index[i].groupName << " name = " << index[i].seqName << endl;
for (int j = 0; j < numSeqs; j++) {
out << matrix[i][j] << " ";
}
}
}
+
/**************************************************************************/