mlocalS_str.h

Go to the documentation of this file.

#ifndef MLOCALS_STR_H
#define MLOCALS_STR_H

#include "../../../cadbc/cadbc.h"
#include "dynamicaln.h"
#include <iostream>
#include <utility>

class dyaln {
        private:
                //int s1namelen, s2namelen;
                //char *seq1name, *seq2name;
                //int seq1len, seq2len;      // the max allocated space
                //char *seq1str, *seq2str;  //calloc allcated
                struct SEQALN_SEQUENCE *seq1,*seq2; /* 1st & 2nd sequences */
                struct SEQALN_CONSTANTS *scoring; /*Parameters of scoring operation*/
                struct SEQALN_RESULTS *results;  /* Computation results. */
                struct SEQALN_IO *io;

                /* helper function */
                void allocateMem();
                void initParameter();  // initialize default behavior

                /* parameters the caller should set these values */
                char distrib_file1[51]; //="distr1.aa";  for profile comparison
                char distrib_file2[51]; // = "distr2.aa";  // we don't need them
                /* sorted residue frequence from big to small */
                pair<float, char> sortedFreq1[20], sortedFreq2[20];

        public:
                //dyaln(cadbc &db1, cadbc &db2);
                //dyaln(const char s1n[], const char s1str[], const char s2n[], const char s2str[]);
                dyaln();
                ~dyaln(); // { free(seq1str); free(seq2str); }
                void freeTrace() { freeTraceList(results); }

                /* return 0 for success */
                //int align(char* seq1name, char *seq2name);
                // if did not get enough memory, returns 1
                int align(const char s1n[], const char s1str[], const char s2n[], const char s2str[]);
                void setup();

                void outputTab(ostream &os);

                void outputTabPos(ostream &os);

                /* performs trace back inside */
                void outputAln(FILE* ou=stdout);

                void setMatrix(char m[]) { load_mat(m, scoring, io); }
                /* alpha -> gap open, beta -> gap extension */
                void setGapCost(int alpha, int beta);
                void setcsub(int cs) { scoring->csub=cs; }
                void setNaligns(int n) { scoring->naligns = n; }
                // returns the maxmum of the simpleness value
                bool isSimple(float &ms) const;
};

#endif