File: align.hpp

package info (click to toggle)
staden 2.0.0%2Bb11-4
  • links: PTS, VCS
  • area: main
  • in suites: bookworm, bullseye, buster
  • size: 21,556 kB
  • sloc: ansic: 240,603; tcl: 65,360; cpp: 12,854; makefile: 11,201; sh: 2,952; fortran: 2,033; perl: 63; awk: 46
file content (105 lines) | stat: -rw-r--r-- 2,803 bytes parent folder | download | duplicates (5)
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
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
/*
 * Copyright (c) Medical Research Council 2001. All rights reserved.
 *
 * Permission to use, copy, modify and distribute this software and its
 * documentation for any purpose is hereby granted without fee, provided that
 * this copyright and notice appears in all copies.
 *
 * This file was written as part of the Staden Package at the MRC Laboratory
 * of Molecular Biology, Hills Road, Cambridge, CB2 2QH, United Kingdom.
 *
 * MRC disclaims all warranties with regard to this software.
 *
 */



#ifndef _MUTLIB_ALIGN_HPP_
#define _MUTLIB_ALIGN_HPP_



#include <cassert>
#include <sp_alignment_structs.h>    // For alignment structures
#include <sp_alignment.h>            // For alignment constants
#include <matrix.hpp>                // For SimpleMatrix<T> object



class Alignment
{
 public:
   // Algorithms
   typedef enum
   {
      ALGORITHM_NORMAL      = SP_ALIGNMENT_ALGORITHM_A,
      ALGORITHM_BLOCK_ALIGN = SP_ALIGNMENT_ALGORITHM_B,
      ALGORITHM_POISSON     = SP_ALIGNMENT_ALGORITHM_C

   }algorithm_t;
   // Edge scoring
   typedef enum
   {
      EDGE_SCORE_LEFT  = SP_ALIGNMENT_LEFT_EDGE_GAPS_COUNT,
      EDGE_SCORE_RIGHT = SP_ALIGNMENT_BEST_RIGHT_EDGE

   }edge_score_t;
   // Support for multiple alignment
   enum
   {
      MAX_INPUT_SEQUENCES = 2
   };



 public:
   // Constructors/destructor
   Alignment();
  ~Alignment();



 public:
   // Services
   void   BandSize( int n )                               { assert(n>=0); m_nBand=n; }
   void   PadSymbol( int p )                              { assert(p);    m_nPadSymbol=p; }
   int    PadSymbol() const                               { return m_nPadSymbol; }
   void   GapPenalty( int nBegin, int nExtend )           { m_nGapPenaltyBegin=nBegin; m_nGapPenaltyExtend=nExtend; }
   void   EdgeScore( edge_score_t es );
   void   InputSequence( int n, const char* s, int l=-1 );
   void   Matrix( int** m, int n, bool AutoDestroy=true );
   int    Execute( algorithm_t a );
   double OutputScore() const;
   char*  OutputSequence( int n ) const;
   int    OutputSequenceLength( int n ) const;
   int    OutputSequenceLeftOverlap( int n ) const;
   int    OutputSequenceRightOverlap( int n ) const;
   void   DumpToFile( const char* s, bool AsInteger=false ) const;



 private:
   // Helpers
   void CreateDefaultMatrix();



 private:
   // Data
   int               m_nBand;
   sp::ALIGN_PARAMS* m_pParams;
   sp::OVERLAP*      m_pOverlap;
   SimpleMatrix<int> m_oMatrix;
   int               m_nPadSymbol;
   int               m_nEdgeScore;
   int               m_nGapPenaltyBegin;
   int               m_nGapPenaltyExtend;
   static bool       m_bDNALookupInitialised;
   const char*       m_pInputSequence[MAX_INPUT_SEQUENCES];
   int               m_nInputSequenceLength[MAX_INPUT_SEQUENCES];
};



#endif