"Fossies" - the Fresh Open Source Software Archive  

Source code changes of the file "src/commontrain.cc" between
augustus-3.3.2.tar.gz and augustus-3.3.3.tar.gz

About: AUGUSTUS is a program that predicts genes in eukaryotic genomic sequences.

commontrain.cc  (augustus-3.3.2):commontrain.cc  (augustus-3.3.3)
/*********************************************************************** /*
* file: commontrain.cc * commontrain.cc
* licence: Artistic Licence, see file LICENCE.TXT or
* http://www.opensource.org/licenses/artistic-license.php
* descr.: used in training of all models
* authors: Mario Stanke (mario@gobics.de)
* *
**********************************************************************/ * License: Artistic License, see file LICENSE.TXT or
* https://opensource.org/licenses/artistic-license-1.0
*/
#include "commontrain.hh" #include "commontrain.hh"
#include <iostream> #include <iostream>
void scaleDblVector(vector<Double>& v, Double sum) { void scaleDblVector(vector<Double>& v, Double sum) {
Double kumSum(0.0), factor; Double kumSum(0.0), factor;
for (int i=0; i<v.size(); i++) { for (int i=0; i<v.size(); i++) {
kumSum += v[i]; kumSum += v[i];
} }
skipping to change at line 146 skipping to change at line 144
/* /*
* search for the best place d to cut off * search for the best place d to cut off
*/ */
bestRelDiff = 1000.0; // = "infinity" bestRelDiff = 1000.0; // = "infinity"
d = 0; d = 0;
Double relDiff; Double relDiff;
/* /*
* start with dtemp as the positiion of the maximum of the length distributi on * start with dtemp as the position of the maximum of the length distributio n
* increase dtemp and check the size of the jump of the model-distribution * increase dtemp and check the size of the jump of the model-distribution
* if we introduce the cutoff at dtemp * if we introduce the cutoff at dtemp
*/ */
int numleD = 0, // number of intron with length <= dtemp int numleD = 0, // number of intron with length <= dtemp
numgD = 0, // number of intron with length > dtemp numgD = 0, // number of intron with length > dtemp
sumgD = 0; // sum of intron length > dtemp sumgD = 0; // sum of intron length > dtemp
for (int i=0; i < maxpos; i++) { for (int i=0; i < maxpos; i++) {
numleD += lencount[i]; numleD += lencount[i];
} }
for (int i = maxpos + 1; i < lencount.size(); i++) { for (int i = maxpos + 1; i < lencount.size(); i++) {
 End of changes. 3 change blocks. 
8 lines changed or deleted 6 lines changed or added

Home  |  About  |  Features  |  All  |  Newest  |  Dox  |  Diffs  |  RSS Feeds  |  Screenshots  |  Comments  |  Imprint  |  Privacy  |  HTTP(S)