forked from mothur/mothur
-
Notifications
You must be signed in to change notification settings - Fork 0
/
classify.h
60 lines (42 loc) · 1.43 KB
/
classify.h
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
#ifndef CLASSIFY_H
#define CLASSIFY_H
/*
* classify.h
* Mothur
*
* Created by westcott on 11/3/09.
* Copyright 2009 Schloss Lab. All rights reserved.
*
*/
/* This class is a parent to bayesian, knn. */
#include "mothur.h"
#include "database.hpp"
#include "phylotree.h"
class Sequence;
/**************************************************************************************************/
class Classify {
public:
Classify();
virtual ~Classify(){};
virtual string getTaxonomy(Sequence*) = 0;
virtual string getSimpleTax() { return simpleTax; }
virtual bool getFlipped() { return flipped; }
virtual void generateDatabaseAndNames(string, string, string, int, float, float, float, float);
virtual void setDistName(string s) {} //for knn, so if distance method is selected with knn you can create the smallest distance file in the right place.
protected:
map<string, string> taxonomy; //name maps to taxonomy
//map<string, int> genusCount; //maps genus to count - in essence a list of how many seqs are in each taxonomy
map<string, int>::iterator itTax;
map<string, string>::iterator it;
Database* database;
PhyloTree* phyloTree;
string taxFile, templateFile, simpleTax;
vector<string> names;
int threadID;
bool flip, flipped;
int readTaxonomy(string);
vector<string> parseTax(string);
MothurOut* m;
};
/**************************************************************************************************/
#endif