8 * Created by Sarah Westcott on 1/22/09.
9 * Copyright 2009 Schloss Lab UMASS Amherst. All rights reserved.
15 /* This class represents the treefile. */
19 Tree(string); //do not use tree generated by this constructor its just to extract the treenames, its a chicken before the egg thing that needs to be revisited.
21 Tree(TreeMap*); //to generate a tree from a file
22 Tree(TreeMap*, vector< vector<double> >&); //create tree from sim matrix
25 void getCopy(Tree*); //makes tree a copy of the one passed in.
26 void getSubTree(Tree*, vector<string>); //makes tree a that contains only the names passed in.
27 int getSubTree(Tree* originalToCopy, vector<string> seqToInclude, map<string, string> nameMap); //used with (int, TreeMap) constructor. SeqsToInclude contains subsample wanted - assumes these are unique seqs and size of vector=numLeaves passed into constructor. nameMap is unique -> redundantList can be empty if no namesfile was provided.
29 void assembleRandomTree();
30 void assembleRandomUnifracTree(vector<string>);
31 void assembleRandomUnifracTree(string, string);
33 void createNewickFile(string);
35 void setIndex(string, int);
36 int getNumNodes() { return numNodes; }
37 int getNumLeaves(){ return numLeaves; }
38 map<string, int> mergeUserGroups(int, vector<string>); //returns a map with a groupname and the number of times that group was seen in the children
41 void print(ostream&, string);
42 int findRoot(); //return index of root node
44 //this function takes the leaf info and populates the non leaf nodes
46 int assembleTree(string);
48 vector<Node> tree; //the first n nodes are the leaves, where n is the number of sequences.
49 map< string, vector<int> > groupNodeInfo; //maps group to indexes of leaf nodes with that group, different groups may contain same node because of names file.
53 int numNodes, numLeaves;
57 map<string, int>::iterator it, it2;
58 map<string, int> mergeGroups(int); //returns a map with a groupname and the number of times that group was seen in the children
59 map<string,int> mergeGcounts(int);
61 void addNamesToCounts(map<string, string>);
62 void randomTopology();
63 void randomBlengths();
64 void randomLabels(vector<string>);
65 //void randomLabels(string, string);
66 void printBranch(int, ostream&, string); //recursively print out tree
67 void parseTreeFile(); //parses through tree file to find names of nodes and number of them
68 //this is required in case user has sequences in the names file that are
69 //not included in the tree.
70 //only takes names from the first tree in the tree file and assumes that all trees use the same names.
71 int readTreeString(ifstream&);
72 int populateNewTree(vector<Node>&, int, int&);
73 void printBranch(int, ostream&, string, vector<Node>&);