/* thorfinn@binf.ku.dk part of angsd. gnu license, mit, bsd whatever free license BUGS: phat doesn't put data into freq->freq. Maybe this should be fixed, in either case, nobody is using the phat estimator */ #include #include #include #include "abcFreq.h" #include "abcSaf.h" #include "abcFilter.h" #include "analysisFunction.h" #include "aio.h" int abcFreq::emIter = EM_NITER; double abcFreq::EM_start = EM_START; double *abcFreq::indF = NULL; //simple phat estimator from the 200danes article, one site function double phatFun(suint *counts,int nFiles,double eps,char major,char minor) { double pis[nFiles]; double wis[nFiles]; if(major==minor) return 0.0; //if the site is variable for(int i=0;i(wis,nFiles)); return phatV; } //simple phat estimator will loop over all sites in the pars void phatLoop(funkyPars *pars,double eps,double nInd,freqStruct *freqs){ freqs->freq_phat = new double[pars->numSites]; for(int s=0;snumSites;s++) if(pars->keepSites[s]){ freqs->freq_phat[s] = phatFun(pars->counts[s],nInd,eps,pars->major[s],pars->minor[s]); } } void abcFreq::printArg(FILE *argFile){ fprintf(argFile,"------------------------\n%s:\n",__FILE__); fprintf(argFile,"-doMaf\t%d (Calculate persite frequencies \'.mafs.gz\')\n",doMaf); fprintf(argFile,"\t1: Frequency (fixed major and minor)\n"); fprintf(argFile,"\t2: Frequency (fixed major unknown minor)\n"); fprintf(argFile,"\t4: Frequency from genotype probabilities\n"); fprintf(argFile,"\t8: AlleleCounts based method (known major minor)\n"); fprintf(argFile,"\tNB. Filedumping is supressed if value is negative\n"); fprintf(argFile,"-doPost\t%d\t(Calculate posterior prob 3xgprob)\n",doPost); fprintf(argFile,"\t1: Using frequency as prior\n"); fprintf(argFile,"\t2: Using uniform prior\n"); fprintf(argFile,"\t3: Using SFS as prior (still in development)\n"); fprintf(argFile,"\t4: Using reference panel as prior (still in development), requires a site file with chr pos major minor af ac an\n"); fprintf(argFile,"Filters:\n"); fprintf(argFile,"\t-minMaf \t%f\t(Remove sites with MAF below)\n",minMaf); fprintf(argFile,"\t-SNP_pval\t%f\t(Remove sites with a pvalue larger)\n",angsd::to_pval(chisq1,SNP_pval)); fprintf(argFile,"\t-rmTriallelic\t%f\t(Remove sites with a pvalue lower)\n",rmTriallelic); fprintf(argFile,"\t-forceMaf\t%d\t(Write .mafs file when running -doAsso (by default does not output .mafs file with -doAsso))\n",forceMaf); fprintf(argFile,"\t-skipMissing\t%d\t(Set post to 0.33 if missing (do not use freq as prior))\n",skipMissing); fprintf(argFile,"Extras:\n"); fprintf(argFile,"\t-ref\t%s\t(Filename for fasta reference)\n",refName); fprintf(argFile,"\t-anc\t%s\t(Filename for fasta ancestral)\n",ancName); fprintf(argFile,"\t-eps\t%f [Only used for -doMaf &8]\n",eps); fprintf(argFile,"\t-beagleProb\t%d (Dump beagle style postprobs)\n",beagleProb); fprintf(argFile,"\t-indFname\t%s (file containing individual inbreedcoeficients)\n",indFname); fprintf(argFile,"\t-underFlowProtect\t%d (file containing individual inbreedcoeficients)\n",underflowprotect); fprintf(argFile,"NB These frequency estimators requires major/minor -doMajorMinor\n"); } //fancy little function int isPowerOfTwo (unsigned int x) { return ((x != 0) && ((x & (~x + 1)) == x)); } void abcFreq::getOptions(argStruct *arguments){ int inputtype = arguments->inputtype; skipMissing=angsd::getArg("-skipMissing",skipMissing,arguments); doMaf=angsd::getArg("-doMaf",doMaf,arguments); doPost=angsd::getArg("-doPost",doPost,arguments); if(doMaf==0 && doPost ==0) return; rmTriallelic=angsd::getArg("-rmTriallelic",rmTriallelic,arguments); forceMaf=angsd::getArg("-forceMaf",forceMaf,arguments); GL=angsd::getArg("-GL",GL,arguments); if(inputtype!=INPUT_VCF_GL && inputtype!=INPUT_GLF && inputtype!=INPUT_GLF3 && doPost && GL==0){ fprintf(stderr,"\t-> Potential problem: You are required to choose a genotype likelihood model (-GL) for estimating genotypes posteriors.\n"); exit(0); } doMajorMinor=angsd::getArg("-doMajorMinor",doMajorMinor,arguments); // fprintf(stderr,"%d %d\n",inputtype,INPUT_VCF_GL); if((doPost||doMaf) &&doMajorMinor==0 &&inputtype!=INPUT_VCF_GL){ if(doMaf!=4){ fprintf(stderr,"\t-> Potential problem: You are required to choose a major/minor estimator (-doMajorMinor)\n"); exit(0); } } if(doPost==1 &&doMaf==0){ fprintf(stderr,"\t-> Potential problem: You are required to choose a maf estimator (-doMaf) with -doPost 1\n"); exit(0); } indFname = angsd::getArg("-indF",indFname,arguments); if(indFname !=NULL) indF = angsd::readDouble(indFname,arguments->nInd); //gets -doAsso argument so can be disabled when running doAsso (but only for doAsso) doAsso = angsd::getArg("-doAsso",doAsso,arguments); if(doAsso !=NULL) ifDoAsso = 1; if(doMaf==0 )//&& doPost==0? return; underflowprotect=angsd::getArg("-underFlowProtect",underflowprotect,arguments); minMaf=angsd::getArg("-minMaf",minMaf,arguments); // ASSERT(minMaf<=1&&minMaf>=0); double tmp=-1; tmp=angsd::getArg("-SNP_pval",tmp,arguments); if(tmp!=-1){ SNP_pval = tmp; double pre = SNP_pval; // fprintf(stderr,"ind:%f :%p: \t",SNP_pval,chisq3); if(SNP_pval <=1){ if(abs(doMaf) ==2) SNP_pval = chisq1->invcdf(1-SNP_pval); if(abs(doMaf) ==1) SNP_pval = chisq1->invcdf(1-SNP_pval); } doSNP =1 ; fprintf(stderr,"\t-> SNP-filter using a pvalue: %e correspond to %f likelihood units\n",pre,SNP_pval); } if(rmTriallelic) SNP_pval_tri = chisq2->invcdf(1-rmTriallelic); refName = angsd::getArg("-ref",refName,arguments); ancName = angsd::getArg("-anc",ancName,arguments); if(abs(doMaf)&& !isPowerOfTwo((unsigned int) abs(doMaf))){ fprintf(stderr,"\n[%s] You have selected filters for maf/lrt\n",__FILE__); fprintf(stderr,"If you have selected more than one MAF estimator we will choose in following order\n"); fprintf(stderr,"\t1. knownminor EM\n"); fprintf(stderr,"\t2. unknownminor EM\n"); fprintf(stderr,"\t3. Posterior maf\n"); } if(doSNP && abs(doMaf)&8){ fprintf(stderr,"\t-> LRT based snp calling is not defined for count based maf estimates\n"); exit(0); } if(doSNP&&abs(doMaf)==0){ fprintf(stderr,"You've selected SNP-calling but no maf estimator please select -doMaf INT\n"); exit(0); } if(doSNP==1 && abs(doMaf)==0){ fprintf(stderr,"You've selected SNP_pval threshold please also select -doMaf \n"); exit(0); } if(minMaf>0.0 &&(abs(doMaf)==0)){ fprintf(stderr,"\nYou've selected minMaf but no MAF estimator, choose -doMaf\n\n"); exit(0); } if(rmTriallelic>0.0 &&(abs(doMaf)!=1)){ fprintf(stderr,"\n rmTriallelic only works with -doMaf 1 \n\n"); exit(0); } int doCounts =0; doCounts=angsd::getArg("-doCounts",doCounts,arguments); beagleProb=angsd::getArg("-beagleProb",beagleProb,arguments); minInd=angsd::getArg("-minInd",minInd,arguments); if(abs(doMaf)==0 &&doPost==0) return; if(inputtype!=INPUT_VCF_GP&&inputtype!=INPUT_BEAGLE&&inputtype!=INPUT_BGEN&&inputtype!=0&&doMajorMinor==0&&inputtype!=INPUT_VCF_GL){ fprintf(stderr,"You must specify \'-doMajorMinor\' to infer major/minor \n"); exit(0); } if((inputtype==INPUT_BEAGLE||inputtype==INPUT_BGEN)&&abs(doMaf)!=4){ fprintf(stderr,"\t-> Only \'-doMaf 4\' can be performed on posterior input\n"); exit(0); } if(doMaf & 4){ if(inputtype!=INPUT_BEAGLE && inputtype!=INPUT_BGEN && inputtype!=INPUT_VCF_GP ){ fprintf(stderr,"\t-> \'-doMaf 4\' can only be performed on genotype probabilities -dopost, -vcf-gp, -beagle \n"); exit(0); } } if((inputtype==INPUT_BAM || inputtype==INPUT_PILEUP )&& GL==0 &&doMaf!=8){ fprintf(stderr,"Error: For sequence data (BAM,pileups) likehoods (-GL) must be specified for frequency estimation\n"); exit(0); } if(doSNP&&abs(doMaf) &4){ fprintf(stderr,"Error: -doMaf 4 cannot be used for a likelihood ratio test (doSNP) \n"); exit(0); } if((inputtype==INPUT_BEAGLE||inputtype==INPUT_BGEN)&&doPost){ fprintf(stderr,"Error: Cannot estimate post (doPost) based on posterior probabilites\n"); exit(0); } if(abs(doMaf)&8&&doCounts==0){ fprintf(stderr,"Must supply -doCounts for MAF estimator based on counts\n"); exit(0); } if(beagleProb && doPost==0 &&inputtype!=INPUT_VCF_GP){ fprintf(stderr,"Must supply -doPost 1 to write beaglestyle postprobs\n"); exit(0); } if(doPost!=0 && doMajorMinor==0 &&INPUT_VCF_GL!=inputtype){ fprintf(stderr,"Do post requires major and minor: supply -doMajorMinor \n"); exit(0); } } //constructor abcFreq::abcFreq(const char *outfiles,argStruct *arguments,int inputtype){ chisq1=chisq2=chisq3=NULL; chisq1 = new Chisqdist(1); chisq2 = new Chisqdist(2); chisq3 = new Chisqdist(3); skipMissing = 1; underflowprotect =0; minInd = 0; inputIsBeagle =0; beagleProb = 0; //<-output for beagleprobs minMaf =-1.0; SNP_pval = 1; nInd = arguments->nInd; eps = 0.001; outfileZ2 = NULL; outfileZ = NULL; indFname = NULL; doMaf=0; rmTriallelic=0; GL=0; doSNP=0; doPost=0; bufstr.s=NULL;bufstr.l=bufstr.m=0; //emIter=EM_NITER; //these are static see top of this file //EM_start = EM_START; //these are static see top of this file doMajorMinor=0; refName = NULL; ancName = NULL; //new flags where maf calculation can be disabled when doing doAsso doAsso = NULL; ifDoAsso = 0; forceMaf = 0; if(arguments->argc==2){ if(!strcasecmp(arguments->argv[1],"-doMaf")||!strcasecmp(arguments->argv[1],"-doPost")){ printArg(stdout); exit(0); }else return; } getOptions(arguments); if(doMaf==0 && doPost==0){ shouldRun[index]=0; return; } printArg(arguments->argumentFile); if(doMaf>0){ //make output files const char* postfix; postfix=".mafs.gz"; // does not write file if doing asso - unless forceMaf flag if(!ifDoAsso || forceMaf){ outfileZ = aio::openFileBG(outfiles,postfix); } if(beagleProb){ postfix=".beagle.gprobs.gz"; outfileZ2 = aio::openFileBG(outfiles,postfix); } }else doMaf=abs(doMaf); //print header kputs("chromo\tposition\tmajor\tminor\t",&bufstr); if(refName!=NULL||arguments->inputtype==INPUT_PILEUP) kputs("ref\t",&bufstr); if(ancName) kputs("anc\t",&bufstr); if(doMaf &1) kputs("knownEM\t",&bufstr); if(doMaf &2) kputs("unknownEM\t",&bufstr); if(doMaf &4) kputs("PPmaf\t",&bufstr); if(doMaf &8) kputs("phat\t",&bufstr); if(doSNP){ if(doMaf &1) kputs("pK-EM\t",&bufstr); if(doMaf &2) kputs("pu-EM\t",&bufstr); } kputs("nInd\n",&bufstr); if(outfileZ!=NULL){ aio::bgzf_write(outfileZ,bufstr.s,bufstr.l); bufstr.l=0; } if(beagleProb){ kputs("marker\tallele1\tallele2",&bufstr); for(int i=0;inInd;i++){ kputs("\tInd",&bufstr); kputw(i,&bufstr); kputs("\tInd",&bufstr); kputw(i,&bufstr); kputs("\tInd",&bufstr); kputw(i,&bufstr); } kputc('\n',&bufstr); aio::bgzf_write(outfileZ2,bufstr.s,bufstr.l); bufstr.l=0; } } abcFreq::~abcFreq(){ if(outfileZ!=NULL){ bgzf_close(outfileZ); } if(outfileZ2!=NULL){ bgzf_close(outfileZ2); } free(refName); free(ancName); delete [] indF; delete chisq1; delete chisq2; delete chisq3; free(bufstr.s); } void abcFreq::print(funkyPars *pars) { if(outfileZ==NULL&&outfileZ2==NULL) return; freqStruct *freq =(freqStruct *) pars->extras[index]; for(int s=0;snumSites;s++) { if(pars->keepSites[s]==0) continue; //plugin chr,pos,major,minor kputs(header->target_name[pars->refId],&bufstr);kputc('\t',&bufstr); kputw(pars->posi[s]+1,&bufstr);kputc('\t',&bufstr); kputc(intToRef[pars->major[s]],&bufstr);kputc('\t',&bufstr); kputc(intToRef[pars->minor[s]],&bufstr);kputc('\t',&bufstr); //plugin ref, anc if exists if(pars->ref!=NULL) {kputc(intToRef[pars->ref[s]],&bufstr);kputc('\t',&bufstr);} if(pars->anc!=NULL) {kputc(intToRef[pars->anc[s]],&bufstr);kputc('\t',&bufstr);} if(doMaf &1) ksprintf(&bufstr,"%f\t",freq->freq_EM[s]); if(doMaf &2) ksprintf(&bufstr,"%f\t",freq->freq_EM_unknown[s]); if(doMaf &4) ksprintf(&bufstr,"%f\t",freq->freq_post[s]); if(doMaf &8) ksprintf(&bufstr,"%f\t",freq->freq_phat[s]); if(doSNP){ if(doMaf &1) ksprintf(&bufstr,"%e\t",angsd::to_pval(chisq1,freq->lrt_EM[s])); if(doMaf &2) ksprintf(&bufstr,"%e\t",angsd::to_pval(chisq1,freq->lrt_EM_unknown[s])); } kputw(pars->keepSites[s],&bufstr);kputc('\n',&bufstr); } if(outfileZ!=NULL){ aio::bgzf_write(outfileZ,bufstr.s,bufstr.l); bufstr.l=0; } if(beagleProb){ //beagle format for(int s=0;snumSites;s++) { if(pars->keepSites[s]==0) continue; // fprintf(stderr,"keepsites=%d\n",pars->keepSites[s]); kputs(header->target_name[pars->refId],&bufstr); kputc('_',&bufstr); kputw(pars->posi[s]+1,&bufstr); kputc('\t',&bufstr); kputw(pars->major[s],&bufstr); kputc('\t',&bufstr); kputw(pars->minor[s],&bufstr); int major = pars->major[s]; int minor = pars->minor[s]; aio::doAssert(major!=4&&minor!=4,1,AT,""); for(int i=0;i<3*pars->nInd;i++) { ksprintf(&bufstr, "\t%f",pars->post[s][i]); } kputc('\n',&bufstr); } //valgrind on osx complains here check if prob on unix int ret=aio::bgzf_write(outfileZ2,bufstr.s,bufstr.l); bufstr.l=0; //fprintf(stderr,"ret.l:%d bufstr.l:%zu\n",ret,bufstr.l); } } void abcFreq::clean(funkyPars *pars) { if(doMaf==0&&doPost==0) return; freqStruct *freq =(freqStruct *) pars->extras[index]; //cleaning delete [] freq->lrt;//maybe in doSNP delete [] freq->freq_EM; delete [] freq->freq_EM_unknown; delete [] freq->freq_post; delete [] freq->freq_phat; delete [] freq->lrt_tri; delete [] freq->lrt_EM; delete [] freq->lrt_EM_unknown; delete freq; if(pars->post!=NULL){ for(int i=0;inumSites;i++){ delete [] pars->post[i]; } delete [] pars->post; pars->post =NULL; } } freqStruct *allocFreqStruct(){ freqStruct *freq = new freqStruct; freq->freq_EM=NULL; freq->freq_EM_unknown= NULL; freq->freq_post = NULL; freq->freq_phat = NULL; freq->lrt_tri=NULL; freq->lrt_EM=NULL; freq->lrt_EM_unknown=NULL; freq->lrt = NULL; return freq; } //filipes void make_post_F(double *like,double *post,double freqEst,int nInd,int skipMissing){ //fprintf(stderr,"[%s]\n",__FUNCTION__); double *indF = abcFreq::indF; for(int i=0;iextras[index] = freq; extern abc **allMethods; // abcFilter *abcf=(abcFilter *) allMethods[0]; filt *fl = ((abcFilter *) allMethods[0])->fl; if(doMaf!=0) { if(doMaf&8){ phatLoop(pars,eps,nInd,freq); freq->freq = freq->freq_phat; } if(doMaf&4){ postFreq(pars,freq); freq->freq = freq->freq_post; } if((doMaf& 2 ) || (doMaf & 1)){ // doMaf =1 or doMaf 2 likeFreq(pars,freq); } for(int s=0;snumSites;s++){ if(pars->keepSites[s]==0) continue; if(freq->freq[s] < minMaf) pars->keepSites[s]=0; else if(freq->freq[s] > 1 - minMaf) pars->keepSites[s]=0; if(doSNP && (freq->lrt[s] < SNP_pval)) pars->keepSites[s]=0; if(rmTriallelic && (freq->lrt_tri[s] > SNP_pval_tri)) pars->keepSites[s]=0; if(minInd>0&&pars->keepSites[s]keepSites[s] = 0; } } if(doPost) { aio::doAssert(pars->likes!=NULL,1,AT,""); double **post = new double*[pars->numSites]; double **like=angsd::get3likes(pars); for(int s=0;snumSites;s++){ post[s] = new double [3*pars->nInd]; if(pars->keepSites[s]==0){ delete [] like[s]; continue; } if(doPost==1) //maf prior make_post(like[s],post[s],freq->freq[s],pars->nInd,skipMissing); else if(doPost==2) {//uniform prior for(int i=0;inInd;i++){ double norm = angsd::addProtect3(like[s][i*3+0],like[s][i*3+1],like[s][i*3+2]); for(int g=0;g<3;g++) post[s][i*3+g]=exp(like[s][i*3+g]-norm); } } else if(doPost==3){//uniform prior if(algoGeno(pars->likes[s],refToInt[pars->major[s]],refToInt[pars->minor[s]],pars->nInd,underflowprotect,abcSaf::prior,post[s])) fprintf(stderr,"\t-> Problem calling genotypes at: (%s,%d)\n",header->target_name[pars->refId],pars->posi[s]+1); } else if(doPost==4){ aio::doAssert(fl!=NULL,1,AT,""); //af for this pos: fl->af[pars->posi[s]] //an for this pos: fl->an[pars->posi[s]] //ac for this pos: fl->ac[pars->posi[s]] // fprintf(stderr,"chr: %s pos: %d freq:%f\n",header->target_name[pars->refId],pars->posi[s]+1,fl->af[pars->posi[s]]); if(fl->keeps[pars->posi[s]]==0) make_post(like[s],post[s],freq->freq[s],pars->nInd,skipMissing); else{ double exp_obs_allels_in_ngs= freq->freq[s]*pars->keepSites[s]; // fprintf(stderr,"pars->keepSite:%d\n",pars->k) double aac = fl->ac[pars->posi[s]]; double aan = fl->an[pars->posi[s]]; double af = (aac+exp_obs_allels_in_ngs)/(1.0*(aan+pars->keepSites[s])); fprintf(stderr,"aac:%f aan:%f nal_in_ngs:%f af:%f\n",aac,aan,exp_obs_allels_in_ngs,af); make_post(like[s],post[s],af,pars->nInd,skipMissing); } } else{ fprintf(stderr,"[%s] doPost must be 1 or 2 \n",__FUNCTION__); exit(0); } delete [] like[s]; } pars->post = post; delete[] like; } } /* Estimate the allele frequency from the posterior probabilities */ void abcFreq::postFreq(funkyPars *pars,freqStruct *freq){ if(freq->freq_post==NULL) freq->freq_post = new double[pars->numSites]; for(int s=0;snumSites;s++){ freq->freq_post[s]=0; for(int i=0;inInd;i++){ freq->freq_post[s] += pars->post[s][i*3+1]+2*pars->post[s][i*3+2]; } freq->freq_post[s] = freq->freq_post[s]/(pars->nInd*2); } } void abcFreq::likeFreq(funkyPars *pars,freqStruct *freq){//method=1: bfgs_known ;method=2 em;method=4 bfgs_unknown //here only the likelihoods for the three genotypes are used. double **loglike = NULL; if(inputIsBeagle==1) loglike= pars->likes; else loglike=angsd::get3likesRescale(pars); aio::doAssert(loglike!=NULL,1,AT,""); if(doSNP) freq->lrt = new double[pars->numSites]; if(rmTriallelic) freq->lrt_tri = new double[pars->numSites]; if(doMaf &1){ freq->freq_EM = new double[pars->numSites]; if(doSNP) freq->lrt_EM = new double[pars->numSites]; } if(doMaf &2){ freq->freq_EM_unknown =new double[pars->numSites]; if(doSNP) freq->lrt_EM_unknown =new double[pars->numSites]; } // number of individuals with data int *keepInd = pars->keepSites; int keepList[pars->nInd]; //loop though all sites and check if we have data. for(int s=0;snumSites;s++) { if(keepInd[s]==0)//if we dont have any information continue; keepInd[s]=0;// for(int i=0 ; inInd ;i++) {//DRAGON CHECK THIS keepList[i]=1; //also discard if all gls are the same if(loglike[s][i*3+0]+loglike[s][i*3+1]+loglike[s][i*3+2]>-0.0001||((loglike[s][i*3]==loglike[s][i*3+1] )&& (loglike[s][i*3]==loglike[s][i*3+2]))){ keepList[i]=0; } else{ keepInd[s]++; } } if(keepInd[s]==0)//if we dont have any information continue; if(doMaf &1) { double mstart = EM_start; if(freq->freq_phat!=NULL) mstart = freq->freq_phat[s]; freq->freq_EM[s]=emFrequency(loglike[s],pars->nInd,emIter,mstart,keepList,keepInd[s]); if(doSNP){ freq->lrt_EM[s]= 2*likeFixedMinor(0.0,loglike[s],pars->nInd)-2*likeFixedMinor(freq->freq_EM[s],loglike[s],pars->nInd); if(freq->lrt_EM[s]<0) freq->lrt_EM[s]=0; } } if( doMaf &2) { double mstart = EM_start; if(freq->freq_phat!=NULL) mstart = freq->freq_phat[s]; freq->freq_EM_unknown[s]=emFrequencyNoFixed(pars->likes[s],pars->nInd,emIter,mstart,keepList,keepInd[s],pars->major[s],pars->posi[s]); if(doSNP){ freq->lrt_EM_unknown[s] = 2*likeNoFixedMinor(0.0,pars->likes[s],pars->nInd,pars->major[s])-2*likeNoFixedMinor(freq->freq_EM_unknown[s],pars->likes[s],pars->nInd,pars->major[s]); if(freq->lrt_EM_unknown[s]<0) freq->lrt_EM_unknown[s]=0; } } if(rmTriallelic!=0){ double lrtTri=0; if(freq->freq_EM[s]>0.0001) lrtTri=isMultiAllelic(pars->likes[s],pars->nInd,emIter,freq->freq_EM[s],keepList,keepInd[s],pars->major[s],pars->minor[s]); freq->lrt_tri[s] = lrtTri; } } if(inputIsBeagle!=1){ for(int i=0;inumSites;i++) delete [] loglike[i]; delete [] loglike; } if(doMaf & 2) freq->freq = freq->freq_EM_unknown; if(doMaf & 1) freq->freq = freq->freq_EM; //thorfinn april 16 2012 for(int s=0;snumSites;s++){ if((doMaf &2) && doSNP ) freq->lrt[s]=freq->lrt_EM_unknown[s]; else if((doMaf &1) && doSNP) freq->lrt[s]=freq->lrt_EM[s]; } } double abcFreq::emFrequencyNoFixed_ext(double *loglike,int numInds,int *keep,int keepInd,int major,int posi){ return emFrequencyNoFixed(loglike,numInds, emIter,EM_start, keep,keepInd,major,posi); } double abcFreq::emFrequencyNoFixed_F(double *loglike,int numInds, int iter,double start,int *keep,int keepInd,int major,int posi){ int iMinor[3]; int n=0; for(int i=0;i<4;i++){ if(i!=major){ iMinor[n]=i; n++; } } double **loglikeGeno; loglikeGeno =new double*[3]; for(int j=0;j<3;j++){ loglikeGeno[j] = new double[numInds*3]; for(int i=0;i1-accu2)) break; temp_p=p; if(std::isnan(p)){ fprintf(stderr,"[%s] caught nan at position: %d\n",__FUNCTION__,posi); for(int j=0;j<3;j++) fprintf(stderr,"w%d %f ",j,weight[j]); fflush(stderr); for(int i=0;i1-accu2)) break; temp_p=p; if(std::isnan(p)){ fprintf(stderr,"[%s] caught nan at position: %d will exit\n",__FUNCTION__,posi+1); for(int j=0;j<3;j++) fprintf(stderr,"w%d %f ",j,weight[j]); fflush(stderr); for(int i=0;iaccu || temp_freq[j]-freq[j]>accu)) doBreak=0; if(doBreak) break; } double likeAlt = likeMultiAllelic(freq,loglike,numInds,keep); double freq2[4]; for(int j=0;j<4;j++) freq2[j] = 0; freq2[minor] = freqStandard; freq2[major] = 1-freqStandard; double likeNull = likeMultiAllelic(freq2,loglike,numInds,keep); //exit(0); // fprintf(stderr,"%f\t%f\t%f\t%f\tl=%f\t%f\tf=%f\t%d\t%d\t\n",freq[0],freq[1],freq[2],freq[3],likeAlt,likeNull,freqStandard,major,minor); // fprintf(stderr,"%f\t%f\t%f\t%f\tl=%f\t%f\tf=%f\t%d\t%d\t\n",freq2[0],freq2[1],freq2[2],freq2[3],likeAlt,likeNull,freqStandard,major,minor); return( 2*(likeNull - likeAlt)); } ///////////////// double abcFreq::likeMultiAllelic(double *freq,double *loglikes,int numInds,int *keep){ double totalLike=0; double W[10]; for(int i=0;i1-accu2)) break; temp_p=p; } if(std::isnan(p)){ fprintf(stderr,"[%s] caught nan will not exit\n",__FUNCTION__); fprintf(stderr,"logLike (3*nInd). nInd=%d\n",numInds); //print_array(stderr,loglike,3*numInds); fprintf(stderr,"keepList (nInd)\n"); //print_array(stderr,keep,numInds); fprintf(stderr,"used logLike (3*length(keep))=%d\n",keepInd); for(int ii=0;0&&ii1-accu2)) break; temp_p=p; } if(std::isnan(p)){ fprintf(stderr,"[%s] caught nan will not exit\n",__FUNCTION__); fprintf(stderr,"logLike (3*nInd). nInd=%d\n",numInds); //print_array(stderr,loglike,3*numInds); fprintf(stderr,"keepList (nInd)\n"); //print_array(stderr,keep,numInds); fprintf(stderr,"used logLike (3*length(keep))=%d\n",keepInd); for(int ii=0;1&&ii1;j--){ double tmp; if(underFlowProtect==1) tmp =angsd::addProtect3(PAA+hj[j-2],PAa+hj[j-1],Paa+hj[j]); else tmp = PAA*hj[j-2]+PAa*hj[j-1]+Paa*hj[j]; if(std::isnan(tmp)){ fprintf(stderr,"jis nan:%d\n",j ); hj[j] = 0; break; }else hj[j] =tmp; } if(underFlowProtect==1){ hj[1] = angsd::addProtect2(Paa+hj[1],PAa+hj[0]); hj[0] = Paa+hj[0]; } else{ hj[1] = Paa*hj[1] + PAa*hj[0]; hj[0] = Paa*hj[0]; } } }//after recursion //if we are underflowprotecting ht hj is in logspace // print_array(stdout,hj,2*numInds+1,!underFlowProtect); for(int i=0;i<(2*numInds+1);i++){ //fprintf(stdout,"BICO: %f\n",log(bico(2*numInds,i))); if(underFlowProtect) hj[i] = (hj[i]-abcSaf::lbicoTab[i]); else hj[i] = exp(log(hj[i])-abcSaf::lbicoTab[i]); } //fprintf(stdout,"the full after update hj\n"); // print_array(stdout,hj,2*numInds+1,underFlowProtect); double denominator = 0; if(underFlowProtect) denominator = log(denominator); for(int i=0;i<=2*numInds;i++) if(underFlowProtect) denominator = angsd::addProtect2(denominator,pest[i]+angsd::addProtect2(hj[i],hj[2*numInds-i])); else denominator += exp(pest[i]) * (hj[i] +hj[2*numInds-i]); // fprintf(stderr,"denom:%e\n",denominator); int whichGeno[numInds]; double whichProb[numInds]; for(int select=0;select1;j--){ // fprintf(stderr,"j=%d\n",j); //print_array(hj,2*numInds+1); double tmp; if(underFlowProtect==1) tmp =angsd::addProtect3(PAA+hj[j-2],PAa+hj[j-1],Paa+hj[j]); else tmp = PAA*hj[j-2]+PAa*hj[j-1]+Paa*hj[j]; if(std::isnan(tmp)){ fprintf(stderr,"jis nan:%d\n",j ); hj[j] = 0; break; }else hj[j] =tmp; } if(underFlowProtect==1){ hj[1] = angsd::addProtect2(Paa+hj[1],PAa+hj[0]); hj[0] = Paa+hj[0]; } else{ hj[1] = Paa*hj[1] + PAa*hj[0]; hj[0] = Paa*hj[0]; } } //ifunderflowprotect then hj is in logspace }//after recursion for(int i=0;i<(2*(numInds-1)+1);i++){ //fprintf(stdout,"BICO: %f\n",log(bico(2*numInds,i))); if(underFlowProtect) hj[i] = (hj[i]-angsd::lbico(2*(numInds-1),i)); else hj[i] = exp(log(hj[i])-angsd::lbico(2*(numInds-1),i)); } //now do all the genocalling for individual =select // fprintf(stderr,"seelct=%d\tmyMaj=%d\tmyMin=%d\tAA_offset=%d Aa_offset=%d aa_offset=%d\n",select,p.major,p.minor,AA_offset,Aa_offset,aa_offset); double *asdf = hj; //print_array(stdout,asdf,2*numInds-1,!underFlowProtect); double *res = postp+3*select; //is always logged for (int j=0;j<3;j++) {//loop through 3 genotypes double g; if(j==0) g=liks[10*select+angsd::majorminor[major_offset][major_offset]]; else if(j==1) g=liks[10*select+angsd::majorminor[major_offset][minor_offset]]; else g=liks[10*select+angsd::majorminor[minor_offset][minor_offset]]; double tmp=0; if(underFlowProtect) tmp = log(tmp); for(int r=0;r<2*numInds-1;r++){ // fprintf(stderr,"mycomb2:%f\tpes1: %f\tpes2: %f\n",myComb2(numInds,r+j,j),pest[r+j],pest[2*numInds-r-j]); if(underFlowProtect) //tmp = angsd::addProtect2(tmp, log(myComb2(numInds,r+j,j)) + (asdf[r])+pest[r+j]+pest[2*numInds-r-j]); tmp = angsd::addProtect2(tmp, log(abcSaf::myComb2Tab[r+j][j]) + (asdf[r])+pest[r+j]+pest[2*numInds-r-j]); else{ //fprintf(stderr,"r+j:%d\tj:%d\nold:%f\nnew:%f",r+j,j,myComb2(numInds,r+j,j), myComb2Tab[r+j][j]); //exit(0); //tmp += myComb2(numInds,r+j,j)*(asdf[r])*(exp(pest[r+j])+exp(pest[2*numInds-r-j])); tmp += abcSaf::myComb2Tab[r+j][j]*(asdf[r])*(exp(pest[r+j])+exp(pest[2*numInds-r-j])); } } //g is directly from glf file, tmp is in log depending on underflowprotect if(underFlowProtect) res[j]=g+(tmp); else res[j]=g+log(tmp); // fprintf(stderr,"j:%d log(g)=%f tmp=%f g*tmp=%f res[%d]=%f logres[%d]=%f \n",j,g,log(tmp),(g*tmp),j,res[j],j,log(res[j])); //res is always in log //CODE BELOW IS A CHECK #if 0 double tmp1=0; double tmp2=0; if(underFlowProtect){ tmp1 = log(tmp1); tmp2 = log(tmp2); } for(int r=j;r<=2*numInds-2+j;r++) { // fprintf(stderr,"tmp1: r=%d index: %d\n",r,r-j); //fprintf(stderr,"logcomb: %f\n",myComb2(numInds,r,j)); // fprintf(stderr,"tmp1 in preloop: %f\n",tmp1); if(underFlowProtect) tmp1 = angsd::addProtect2(tmp1, log(myComb2Tab[r][j])+ asdf[r-j]+pest[r]); else tmp1 += myComb2Tab[r][j]*(asdf[r-j])*exp(pest[r]); //fprintf(stderr,"tmp1 in reloop: %f\n",tmp1); } for(int r=2-j;r<=2*numInds-j;r++){ //fprintf(stderr,"tmp2: r=%d index=%d\n",r,r-2+j); //fprintf(stderr,"logcomb: %f\n",myComb2(numInds,r,2-j)); if(underFlowProtect) tmp2 = angsd::addProtect2(tmp2,log(myComb2Tab[r][2-j])+ asdf[(2*(numInds-1))-(r-2+j)]+ pest[r]); else tmp2 += myComb2Tab[r][2-j]*(asdf[2*(numInds-1)-(r-2+j)])*exp(pest[r]); } // fprintf(stderr,"tmp1: %f tmp2: %f\n",(tmp1),(tmp2)); double res2;//always log if(underFlowProtect) res2 = g+(angsd::addProtect2(tmp1,tmp2)); else res2 = g+log(tmp1+tmp2); //fprintf(stdout,"%f vs %f\n",res[j],res2); if(1&&!isSame(res[j],res2,0.000001)){ fprintf(stdout,"%f vs %f\n",res[j],res2); } //check that is sums to one according the model if(underFlowProtect) fprintf(stdout,"\tASDFASDFASDF: %f\n",log((res2-denominator))); else fprintf(stdout,"\tASDFASDFASDF: %f\n",log(exp(res2)/denominator)); //CODE ABOVE IS CHECK #endif }//after the loop of the tree genoypes double shouldBeOne =0; if(underFlowProtect) shouldBeOne = exp(res[0]-(denominator))+exp(res[1]-(denominator))+exp(res[2]-(denominator)); else shouldBeOne = exp(res[0]-log(denominator))+exp(res[1]-log(denominator))+exp(res[2]-log(denominator)); //fprintf(stderr,"this should be one: %f\n",shouldBeOne); if((fabs(shouldBeOne-1)>0.000001)){ return 1; } // print_array(stdout,res,3,0); //logrescale(res,3); double mySum=exp(res[0])+exp(res[1])+exp(res[2]); for(int i=0;i<3;i++) res[i] =exp(res[i])/mySum; //print_array(sfsfile,res,3,0); delete [] hj; }//after select loop return 0; }