//use database to find closest seq
vector<int> closest = database->findClosestSequences(seq, num);
+
+ if (m->control_pressed) { return tax; }
vector<string> closestNames;
for (int i = 0; i < closest.size(); i++) {
int smallest = 100;
for (int i = 0; i < closest.size(); i++) {
+ if (m->control_pressed) { return "control"; }
string tax = taxonomy[closest[i]]; //we know its there since we checked in getTaxonomy
//start at the highest level all the closest seqs have
string common = "";
for (int i = (smallest-1); i >= 0; i--) {
+ if (m->control_pressed) { return "control"; }
string thistax = taxons[0][i];
int num = 0;