-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathensdef_constraint.cc
76 lines (67 loc) · 2.46 KB
/
ensdef_constraint.cc
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
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
/******************************************************************************
* Copyright (C) 2014 Juan Antonio Garcia Martin , Peter Clote, Ivan Dotu *
* *
* This program is free software: you can redistribute it and/or modify *
* it under the terms of the GNU General Public License as published by *
* the Free Software Foundation, either version 3 of the License, or *
* (at your option) any later version. *
* *
* This program is distributed in the hope that it will be useful, *
* but WITHOUT ANY WARRANTY; without even the implied warranty of *
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *
* GNU General Public License for more details. *
* *
* You should have received a copy of the GNU General Public License *
* along with this program. If not, see <http://www.gnu.org/licenses/>. *
******************************************************************************/
#include "ensdef_constraint.h"
#include "diversity_measures.h"
#include "misc.h"
#include <cstring>
namespace operations_research {
void EnsDefConstraint::InitialPropagate() {
int allBound =1;
vector<int64> freeVars;
for (int i = 1; i < size(); ++i) {
if (!vars_[i]->Bound()) {
allBound=0;
return;
}
}
if(allBound){
char seq[n+1];
double ens_defect=0;
for(int i = 0; i < size(); ++i) {
seq[i]=ToNucl(vars_[i]->Value());
}
seq[n]='\0';
double **outBpPr;
v->setSequence(seq);
if(cutPoint_==-1){
outBpPr=v->basePairProbsMatrix();
}
else{
outBpPr=v->basePairProbsMatrixCofold();
}
ens_defect=ensembleDefect(outBpPr,n,bpList_);
// cout << seq <<endl;
// for(int i=0; i< n; i++){
// cout << bpList_[i] << " ";
// }
// cout << endl;
// cout << "Ensemble defect constraint: " << ens_defect << " (Limits: " << min_ensdef_ <<" - " <<max_ensdef_ << ")"<< endl;
if(max_ensdef_!= NO_ED_LIMIT && max_ensdef_<ens_defect){
solver()->Fail();
free(outBpPr);
return;
}
if(min_ensdef_!= NO_ED_LIMIT && min_ensdef_>ens_defect){
solver()->Fail();
free(outBpPr);
return;
}
free(outBpPr);
return;
}
}
}