This file is indexed.

/usr/include/Bpp/Seq/GeneticCode/GeneticCode.h is in libbpp-seq-dev 2.4.0-2.

This file is owned by root:root, with mode 0o644.

The actual contents of the file can be viewed below.

  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
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
//
// File: GeneticCode.h
// Created by: Julien Dutheil
// Created on: Mon Oct 13 15:37:25 2003
//

/*
  Copyright or © or Copr. Bio++ Development Team, (November 17, 2004)

  This software is a computer program whose purpose is to provide classes
  for sequences analysis.

  This software is governed by the CeCILL  license under French law and
  abiding by the rules of distribution of free software.  You can  use, 
  modify and/ or redistribute the software under the terms of the CeCILL
  license as circulated by CEA, CNRS and INRIA at the following URL
  "http://www.cecill.info". 

  As a counterpart to the access to the source code and  rights to copy,
  modify and redistribute granted by the license, users are provided only
  with a limited warranty  and the software's author,  the holder of the
  economic rights,  and the successive licensors  have only  limited
  liability. 

  In this respect, the user's attention is drawn to the risks associated
  with loading,  using,  modifying and/or developing or reproducing the
  software by the user in light of its specific status of free software,
  that may mean  that it is complicated to manipulate,  and  that  also
  therefore means  that it is reserved for developers  and  experienced
  professionals having in-depth computer knowledge. Users are therefore
  encouraged to load and test the software's suitability as regards their
  requirements in conditions enabling the security of their systems and/or 
  data to be ensured and,  more generally, to use and operate it in the 
  same conditions as regards security. 

  The fact that you are presently reading this means that you have had
  knowledge of the CeCILL license and that you accept its terms.
*/

#ifndef _GENETICCODE_H_
#define _GENETICCODE_H_

#include "../Transliterator.h"
#include "../Alphabet/CodonAlphabet.h"
#include "../Alphabet/ProteicAlphabet.h"
#include <Bpp/Exceptions.h>

namespace bpp
{

  /**
   * @brief Exception thrown when a stop codon is found.
   */
  class StopCodonException:
    public virtual Exception
  {
  private:
    std::string codon_;
			
  public:
    // Class constructor
    StopCodonException(const std::string& text, const std::string& codon);
	
    // Class destructor
    virtual ~StopCodonException() {}
		
  public:
    virtual const std::string& getCodon() const { return codon_; }
  };

  /**
   * @brief Partial implementation of the Transliterator interface for genetic code object.
   *
   * A genetic code object if a translator from a codon alphabet to a proteic alphabet.
   * Depending on the codon alphabet used, several genetic code can be implemented.
   *
   * @see CodonAlphabet, ProteicAlphabet
   */
  class GeneticCode:
    public AbstractTransliterator,
    public virtual Clonable
  {
  protected:
    CodonAlphabet codonAlphabet_;
    ProteicAlphabet proteicAlphabet_;
    std::map<int, int> tlnTable_;
	
  public:
    GeneticCode(const NucleicAlphabet* alphabet):
      AbstractTransliterator(),
      codonAlphabet_(alphabet),
      proteicAlphabet_(),
      tlnTable_()
    {}

    virtual ~GeneticCode() {}
	
    virtual GeneticCode* clone() const = 0;

  public:
    /**
     * @name Methods form the Transliterator interface.
     *
     * @{
     */
    const CodonAlphabet* getSourceAlphabet() const { return &codonAlphabet_; }
    const ProteicAlphabet* getTargetAlphabet() const { return &proteicAlphabet_; }
    virtual int translate(int state) const;		
    virtual std::string translate(const std::string& state) const;
    virtual Sequence* translate(const Sequence& sequence) const
    {
      return AbstractTransliterator::translate(sequence);	
    }
    /** @} */
		
  public:
    /**
     * @name Specific methods.
     *
     * @{
     */
    
    /**
     * @return The number of stop codons.
     */
    virtual size_t getNumberOfStopCodons() const = 0;

    /**
     * @return A vector will all int codes for stop codons.
     */
    virtual std::vector<int> getStopCodonsAsInt() const = 0;

    /**
     * @return A vector will all char codes for stop codons.
     */
    virtual std::vector<std::string> getStopCodonsAsChar() const = 0;

    /**
     * @brief Tells is a particular codon is a stop codon.
     *
     * @param state The numeric code for the state to test.
     * @return True if the state corresponds to a stop codon.
     */
    virtual bool isStop(int state) const = 0;

    /**
     * @brief Tells is a particular codon is a stop codon.
     *
     * @param state The character code for the state to test.
     * @return True if the state corresponds to a stop codon.
     */
    virtual bool isStop(const std::string& state) const = 0;
    
    /**
     * @brief Tells is a particular codon is a start codon.
     *
     * @param state The numeric code for the state to test.
     * @return True if the state corresponds to a start codon.
     */
    virtual bool isStart(int state) const {
      //Test:
      codonAlphabet_.intToChar(state); //throw exception if invalid state!
      return (state == 14);
    }

    /**
     * @brief Tells is a particular codon is a start codon.
     *
     * @param state The character code for the state to test.
     * @return True if the state corresponds to a start codon.
     */
    virtual bool isStart(const std::string& state) const {
      return isStart(codonAlphabet_.charToInt(state));
    }
 
    /**
     * @brief Tells is a particular codon is an alternative start codon.
     *
     * @param state The numeric code for the state to test.
     * @return True if the state corresponds to an alternative start codon.
     */
    virtual bool isAltStart(int state) const = 0;

    /**
     * @brief Tells is a particular codon is an alternative start codon.
     *
     * @param state The character code for the state to test.
     * @return True if the state corresponds to an alternative start codon.
     */
    virtual bool isAltStart(const std::string& state) const = 0;
    
    /**
     * @brief Tell if two codons are synonymous, that is, if they encode the same amino-acid.
     *
     * @param i The numeric code for the first codon.
     * @param j The numeric code for the second codon.
     * @return True if the two codons are synonymous.
     */
    bool areSynonymous(int i, int j) const
    {
      return (translate(i) == translate(j));
    }

    /**
     * @brief Tell if two codons are synonymous, that is, if they encode the same amino-acid.
     *
     * @param i The character code for the first codon.
     * @param j The character code for the second codon.
     * @return True if the two codons are synonymous.
     */
    bool areSynonymous(const std::string& i, const std::string& j) const
    {
      return (translate(i) == translate(j));
    }

    std::vector<int> getSynonymous(int aminoacid) const;
    
    std::vector<std::string> getSynonymous(const std::string& aminoacid) const;

    /**
     * @return True if the specified codon is fourfold degenerated
     * (that is, if a mutation in the fourth position does not change the aminoacid).
     * @author Benoit Nabholz, Annabelle Haudry
     * @param codon The codon to test.
     */
    bool isFourFoldDegenerated(int codon) const;

    /**
     * @brief Get the subsequence corresponding to the coding part of a given sequence.
     *
     * If lookForInitCodon if set to 'true', the subsequence will start at the first AUG motif,
     * otherwise the subsequence will start at the begining of the sequence.
     * The subsequence ends at the first stop codon (excluded) found, or the end of the sequence.
     *
     * The sequence may have a nucleotide or codon alphabet.
     * The subsequence has the same alphabet, name and comments of the input sequence.
     * In case of nucleotide sequence and if the lookForInitCodon option is checked, the phase
     * will be determined from the sequence.
     *
     * @param sequence The sequence to parse.
     * @param lookForInitCodon Tell if the AUG codon must be found.
     * @param includeInitCodon (if lookForInitCodon is true) tell if the init codon must be included in the subsequence.
     * @return A nucleotide/codon subsequence.
     */
    Sequence* getCodingSequence(const Sequence& sequence, bool lookForInitCodon = false, bool includeInitCodon = false) const;
    /** @} */
  };

} //end of namespace bpp.

#endif	//_GENETICCODE_H_