Go to the SVN repository for this file.
78 for(
i=0;
i<nrt;
i++) spc->
rto[
i]=spc->
rt[
i];
83rtn=spc->
srt[
n];
for(
r=0;
r<nrt;
r++) rtn[
r]=0;
84nt=sai->
al[
n]-sli->
no[
n];
87 for(
i=nt;
i<=
ct;
i++) {
99 for(
r=0;
r<nrt;
r++) rtn[
r]=0;
101 ct=sai->
al[0]-sli->
no[0]-1;
105 for(
i=nt;
i<=
ct;
i++) {
107 if(
r<0)
continue;
111 ct=sai->
al[
n]-sli->
no[
n]-1;
112nt=sai->
al[
n-1]+sli->
co[
n-1]+1;
115 for(
i=nt;
i<=
ct;
i++) {
117 if(
r<0)
continue;
129rtn=spc->
lrt[
n+1];
130 for(
r=0;
r<nrt;
r++) rtn[
r]=0;
132nt=sai->
al[
n]+sli->
co[
n]+1;
134 ct=(
ct>=nqi) ? nqi-1 :
ct;
136 for(
i=nt;
i<=
ct;
i++) {
138 if(
r<0)
continue;
142nt=sai->
al[
n]+sli->
co[
n]+1;
143 ct=sai->
al[
n+1]-sli->
no[
n+1]-1;
146 for(
i=nt;
i<=
ct;
i++) {
148 if(
r<0)
continue;
158 for(
r=0;
r<nrt;
r++) spc->
rt[
r]=0;
168 for(
i=0;
i<nsc;
i++) {
169rtn=spc->
srt[
i];
for(
r=0;
r<nrt;
r++) spc->
rt[
r] += rtn[
r]; }
170 for(
i=0;
i<nlp;
i++) {
171rtn=spc->
lrt[
i];
for(
r=0;
r<nrt;
r++) spc->
rt[
r] += rtn[
r]; }
178j=0;
for(
i=0;
i<nrt;
i++)
if(spc->
rt[
i]!=spc->
rto[
i]) { j=1;
break; }
double r(size_t dimension_, const Int4 *score_, const double *prob_, double theta_)
int spci(Cor_Def *cdf, Qry_Seq *qsq, Cur_Loc *sli, Cur_Aln *sai, int n, Seg_Cmp *spc)
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4