win_size = w;
pathz.clear();
- cout << "nway: thres = " << threshold
- << ", soft threo = " << soft_thres << endl;
+ //cout << "nway: thres = " << threshold
+ // << ", soft threo = " << soft_thres << endl;
}
void
refined_pathz.clear();
- cout << "path number is: " << pathz.size() << endl;
+ //cout << "path number is: " << pathz.size() << endl;
pathz_i = pathz.begin();
// only try to extend when pathz isn't empty.
if (extending)
{
- //cout << "Raaaawwwrrr! I am extending\n";
win_ext_len++;
}
else
}
}
}
- cout << "r_path number is: " << refined_pathz.size() << endl;
+ //cout << "r_path number is: " << refined_pathz.size() << endl;
}
threshold = atoi (data.c_str());
file_data_line = file_data_line.substr(space_split_i+1);
- cout << "seq_num=" << species_num << " win=" << win_size;
- cout << " thres=" << threshold << endl;
+ //cout << "seq_num=" << species_num << " win=" << win_size;
+ //cout << " thres=" << threshold << endl;
// clear out the current data
refined_pathz.clear();
++new_nodes_i;
}
}
-// cout << " ****I have the power...\n";
-
/* use this if I ever get the friggin seqcomp match lists to sort...
if (binary_search(trans_check_nodes.begin(), trans_check_nodes.end(),
*new_nodes_i))
pathz.clear();
window_num = all_comparisons[0][1].size();
- cout << window_num << endl;
// loop thru all windows in first species
for (win_i = 0; win_i < window_num; win_i++)
{
new_nodes_end = new_nodes.end();
//if (new_nodes_i != new_nodes_end)
//cout << "* species 0 node: " << win_i << endl;
- // cout << "foookin hell\n";
path.push_back(0);
while(new_nodes_i != new_nodes_end)
{