File: exhaustiveSearch.cpp

package info (click to toggle)
fastml 3.11-4
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid, trixie
  • size: 5,772 kB
  • sloc: cpp: 48,522; perl: 3,588; ansic: 819; makefile: 386; python: 83; sh: 55
file content (48 lines) | stat: -rw-r--r-- 1,256 bytes parent folder | download | duplicates (5)
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
#include <fstream>
#include <iostream>
#include <string>
#include <iomanip>
using namespace std;

#include "nucJC.h"
#include "sequence.h"
#include "distribution.h"
#include "stochasticProcess.h"
#include "gammaDistribution.h"
#include "uniDistribution.h"
#include "trivialAccelerator.h"
#include "sequenceContainer.h"
#include "nucleotide.h"
#include "phylipFormat.h"
#include "likelihoodComputation.h"
#include "bestHKYparam.h"
#include "evaluateCharacterFreq.h"
#include "bblEM.h"
#include "allTrees.h"


int main(int argc,char*argv []) {
	cout<<"exhaustive search"<<endl;
	
	// getting the data.
	string seqFile1 = "nuc7.phylip.txt";
	ifstream in1(seqFile1.c_str());
	if (!in1) {errorMsg::reportError("unable to open input sequence file");}
	nucleotide myAlph; 
	sequenceContainer original1 = phylipFormat::read(in1,&myAlph);
	in1.close();

	distribution *dist =  new uniDistribution; 
	replacementModel *probMod=new nucJC;
	pijAccelerator * pijAcc = new trivialAccelerator(probMod); 
	stochasticProcess sp(dist, pijAcc);

	allTrees allTrees1(false);
	allTrees1.recursiveFind(&original1,&sp);
	cout<<" Log likelihood for best tree = "<<allTrees1.getBestScore()<<endl;
	allTrees1.getBestTree().output(cout);

	delete dist;
	delete probMod;
	return 0;
}