kmerstore.h 14.7 KB
Newer Older
Mikaël Salson's avatar
Mikaël Salson committed
1 2 3 4 5 6 7 8
#ifndef KMERSTORE_H
#define KMERSTORE_H

#include <map>
#include <string>
#include <list>
#include <stdexcept>
#include <stdint.h>
9
#include <math.h>
Mikaël Salson's avatar
Mikaël Salson committed
10 11 12 13 14 15 16 17 18 19
#include "fasta.h"
#include "tools.h"

using namespace std;

class Kmer {
public:
  unsigned int count;

  Kmer();
20 21 22 23

  /**
   * This constructor is used via a IKmerStore<Kmer> index (hence the argument list)       
   */
24
  Kmer(const string &label, int strand=1);
25

Mikaël Salson's avatar
Mikaël Salson committed
26 27
  Kmer &operator+=(const Kmer &);
  static bool hasRevcompSymetry();
28 29 30 31 32

  /**
   * @return true if the element is the same as when initialised with default constructor.
   */
  bool isNull();
Mikaël Salson's avatar
Mikaël Salson committed
33 34 35 36 37 38 39 40 41 42 43 44 45
} ;
ostream &operator<<(ostream &os, const Kmer &kmer);


/* K-mer indexing */

template <class T> class IKmerStore
{
protected:
  bool revcomp_indexed;
  int k; // weight of the seed
  int s; // span of the seed (s >= k)
  string seed ;
46
  size_t nb_kmers_inserted;
47
  size_t max_size_indexing;
Mikaël Salson's avatar
Mikaël Salson committed
48 49 50 51 52

public:

  virtual ~IKmerStore();

53 54
  static int last_id;
  int id; // id of this index
55
  int refs; // number of germlines using this index
56

57
  list< pair <T, Fasta> > labels;
58

Mikaël Salson's avatar
Mikaël Salson committed
59 60 61
  /**
   * @param input: A single FASTA file
   * @param label: label that must be associated to the given files
62
   * @param seed: the seed to use for indexing. By default it will be the seed of the index
63
   * @post All the sequences in the FASTA files have been indexed, and the label is stored in the list of labels
Mikaël Salson's avatar
Mikaël Salson committed
64
   */
65
  void insert(Fasta& input, const string& label="", int keep_only = 0, string seed = "");
Mikaël Salson's avatar
Mikaël Salson committed
66 67 68 69

  /**
   * @param input: A list of FASTA files
   * @param label: label that must be associated to the given files
70
   * @param seed: the seed to use for indexing. By default it will be the seed of the index
71
   * @post All the sequences in the FASTA files have been indexed, and the label is stored in the list of labels
Mikaël Salson's avatar
Mikaël Salson committed
72
   */
73
  void insert(list<Fasta>& input, const string& label="", int keep_only = 0, string seed = "");
Mikaël Salson's avatar
Mikaël Salson committed
74 75 76 77
  
  /**
   * @param input: A sequence to be cut in k-mers
   * @param label: label that must be associated to the given files
78 79 80 81
   * @param keep_only: if > 0 will keep at most the last keep_only nucleotides
   *                   of the sequence. if < 0 will keep at most the first
   *                   keep_only nucleotides of the sequence. if == 0,
   *                   will keep all the sequence.
82
   * @param seed: the seed to use for indexing. By default it will be the seed of the index
Mikaël Salson's avatar
Mikaël Salson committed
83 84
   * @post All the k-mers in the sequence have been indexed.
   */
85
  void insert(const seqtype &sequence,
86
              const string &label,
87 88
              bool ignore_extended_nucleotides=true, int keep_only = 0,
              string seed="");
Mikaël Salson's avatar
Mikaël Salson committed
89 90 91 92 93

  /**
   * @param word: a k-mer
   * @return the value for the kmer as stored in the structure (don't do revcomp)
   */ 
94
  virtual T& get(seqtype &word) = 0;
Mikaël Salson's avatar
Mikaël Salson committed
95

96 97 98
  /**
   * @return the percentage of kmers that are set in the index
   */
99
  float getIndexLoad(T kmer) const;
100 101
  float getIndexLoad() const;

102 103 104 105 106 107
  /**
   * @return the given integer (size of a read),
   *         but limit this size to max_size_indexing if it was defined
   */
  int atMostMaxSizeIndexing(int n) const;

108 109 110
  /**
   * @return probability that the number of kmers is 'at_least' or more in a sequence of length 'length'
   */
111
  double getProbabilityAtLeastOrAbove(T kmer, int at_least, int length) const;
112

Mikaël Salson's avatar
Mikaël Salson committed
113 114 115 116 117 118 119 120 121 122
  /**
   * @return the value of k
   */
  int getK() const;

  /**
   * @return the value of s
   */
  int getS() const;

123 124 125 126 127
  /**
   * @return the seed used
   */
  string getSeed() const;

128 129 130 131
  /**
   * @param kmer: a kmer
   * @return one label associated with the kmer
   */
132
  Fasta getLabel(T kmer) const;
133

Mikaël Salson's avatar
Mikaël Salson committed
134 135 136 137
  /**
   * @param seq: a sequence
   * @param no_revcomp: force not to revcomp the sequence, even if
   *                    the index was built with revcomp.
138 139
   * @return a vector of length seq.length() - smallestAnalysableLength() + 1
   * containing for each position the corresponding value in the index.
Mikaël Salson's avatar
Mikaël Salson committed
140
   */
141
  virtual vector<T> getResults(const seqtype &seq, bool no_revcomp=false, string seed="") = 0;
Mikaël Salson's avatar
Mikaël Salson committed
142

143 144 145 146 147 148 149
  /**
   * @return the smallest analysable sequence length by the index. For an
   * index just storing k-mers it will obviously be getK(). But for more
   * sophisticated data structures it could be 1 for instance.
   */
  size_t smallestAnalysableLength() const;

Mikaël Salson's avatar
Mikaël Salson committed
150 151 152 153 154 155 156 157 158 159 160
  /**
   * @return true iff the revcomp is indexed
   */
  bool isRevcomp() const;

  /**
   * @param string: a k-mer
   * @return the value in the index associated to the given k-mer.
   *         isRevcomp() ==> the revcomp of the k-mer may be considered
   * @pre word.length() == this->k
   */
161
  virtual T& operator[](seqtype& word) = 0;
Mikaël Salson's avatar
Mikaël Salson committed
162 163
};

164
template<class T> int IKmerStore<T>::last_id = 0;
Mikaël Salson's avatar
Mikaël Salson committed
165 166 167 168 169

template <class T> 
class MapKmerStore : public IKmerStore<T>
{
public:	
170
  map<seqtype, T> store;
Mikaël Salson's avatar
Mikaël Salson committed
171 172 173 174 175 176 177

  /**
   * @param bool: if true, will also index revcomp
   * @param seed: the seed
   */
  MapKmerStore(string seed, bool=false);
  MapKmerStore(int k, bool=false);
178

179
  vector<T> getResults(const seqtype &seq, bool no_revcomp=false, string seed="");
180 181
  T& get(seqtype &word);
  T& operator[](seqtype & word);
182 183 184

 private:
  void init();
Mikaël Salson's avatar
Mikaël Salson committed
185 186 187 188 189 190 191
};

template <class T> 
class ArrayKmerStore : public IKmerStore<T>
{
  T* store;
	
192
  int index(const seqtype& word) const;
193 194 195 196 197 198 199 200

  /**
   * Allocates memory for store
   * @throws bad_alloc: when there is not enough memory or when the
   *                    the total number of kmers cannot be stored in an 
   *                    unsigned int
   */
  void init();
Mikaël Salson's avatar
Mikaël Salson committed
201 202 203 204 205 206 207 208
public:
  /**
   * @param bool: if true, will also index revcomp
   * @param seed: the seed
   */
  ArrayKmerStore(string seed, bool=false);
  ArrayKmerStore(int k, bool=false);
  ~ArrayKmerStore();
209

210
  vector<T> getResults(const seqtype &seq, bool no_revcomp=false, const string seed="");
211 212
  T& get(seqtype &word);
  T& operator[](seqtype & word);
213
  T& operator[](int word);
Mikaël Salson's avatar
Mikaël Salson committed
214 215 216 217 218 219 220 221 222 223
};


// IKmerStore

template<class T>
IKmerStore<T>::~IKmerStore(){}

template<class T> 
void IKmerStore<T>::insert(list<Fasta>& input,
224
                           const string &label,
225 226
                           int keep_only,
                           string seed){
Mikaël Salson's avatar
Mikaël Salson committed
227
  for(list<Fasta>::iterator it = input.begin() ; it != input.end() ; it++){
228
    insert(*it, label, keep_only, seed);
Mikaël Salson's avatar
Mikaël Salson committed
229 230 231 232 233
  }
}

template<class T> 
void IKmerStore<T>::insert(Fasta& input,
234
                           const string &label,
235 236
                           int keep_only,
                           string seed){
Mikaël Salson's avatar
Mikaël Salson committed
237
  for (int r = 0; r < input.size(); r++) {
238
    insert(input.sequence(r), label, true, keep_only, seed);
Mikaël Salson's avatar
Mikaël Salson committed
239
  }
240

241
  labels.push_back(make_pair(T(label, 1), input)) ;
242 243

  if (revcomp_indexed  && ! T::hasRevcompSymetry()) {
244
    labels.push_back(make_pair(T(label, -1), input)) ;
245
  }
Mikaël Salson's avatar
Mikaël Salson committed
246 247 248
}

template<class T> 
249
void IKmerStore<T>::insert(const seqtype &sequence,
250
                           const string &label,
251
                           bool ignore_extended_nucleotides,
252 253
                           int keep_only,
                           string seed){
254 255 256 257 258 259 260
  size_t start_indexing = 0;
  size_t end_indexing = sequence.length();
  if (keep_only > 0 && sequence.length() > (size_t)keep_only) {
    start_indexing = sequence.length() - keep_only;
  } else if (keep_only < 0 && sequence.length() > (size_t) -keep_only) {
    end_indexing = -keep_only;
  }
261

262 263 264 265
  if (seed.empty())
    seed = this->seed;

  size_t seed_span = seed.length();
266 267 268 269 270
  size_t size_indexing = end_indexing - start_indexing;
  if (size_indexing > max_size_indexing) {
    max_size_indexing = size_indexing;
  }

271 272
  for(size_t i = start_indexing ; i + seed_span < end_indexing + 1 ; i++) {
    seqtype substr = sequence.substr(i, seed_span);
273
    seqtype kmer = spaced(substr, seed);
274

275
    if (ignore_extended_nucleotides && has_extended_nucleotides(kmer))
276 277
      continue;

Mikaël Salson's avatar
Mikaël Salson committed
278 279
    int strand = 1;
    if (revcomp_indexed && T::hasRevcompSymetry()) {
280
      seqtype rc_kmer = revcomp(kmer);
Mikaël Salson's avatar
Mikaël Salson committed
281 282 283 284 285
      if (rc_kmer.compare(kmer) < 0) {
        strand = -1;
        kmer = rc_kmer;
      }
    }
286 287 288 289 290
    T &this_kmer = this->get(kmer);
    if (this_kmer.isNull()) {
      nb_kmers_inserted++;
    }
    this_kmer += T(label, strand);
Mikaël Salson's avatar
Mikaël Salson committed
291
    if (revcomp_indexed && ! T::hasRevcompSymetry()) {
292
      seqtype rc_kmer = spaced(revcomp(substr), seed);
293 294 295 296
      T &this_rc_kmer = this->get(rc_kmer);
      if (this_rc_kmer.isNull())
        nb_kmers_inserted++;
      this_rc_kmer += T(label, -1);
Mikaël Salson's avatar
Mikaël Salson committed
297 298 299
    }
  }
}
300

301 302 303
template<class T>
void IKmerStore<T>::finish_building() {}

304 305
template<class T>
float IKmerStore<T>::getIndexLoad(const T kmer) const {
306
  return kmer.isUnknown() ? 1 - getIndexLoad() : getIndexLoad();
307
}
308 309
template<class T>
float IKmerStore<T>::getIndexLoad() const {
310
  return nb_kmers_inserted / pow(4.0, k);
311
}
Mikaël Salson's avatar
Mikaël Salson committed
312

313 314 315 316 317 318 319
template<class T>
int IKmerStore<T>::atMostMaxSizeIndexing(int n) const {
  if (!max_size_indexing || n < max_size_indexing)
    return n ;

  return max_size_indexing ;
}
320 321

template<class T>
322
double IKmerStore<T>::getProbabilityAtLeastOrAbove(const T kmer, int at_least, int length) const {
323 324 325

  // n: number of kmers in the sequence
  int n = length - getS() + 1;
326
  float index_load = getIndexLoad(kmer) ;
327 328 329 330 331 332 333 334 335 336 337 338 339 340 341

  double proba = 0;
  double probability_having_system = pow(index_load, at_least);
  double probability_not_having_system = pow(1 - index_load, n - at_least);
  for (int i=at_least; i<=n; i++) {
    proba += nChoosek(n, i) * probability_having_system * probability_not_having_system;
    probability_having_system *= index_load;
    probability_not_having_system /= (1 - index_load);
  }

  return proba;
}



Mikaël Salson's avatar
Mikaël Salson committed
342 343 344 345 346 347 348 349 350 351
template<class T>
int IKmerStore<T>::getK() const {
  return k;
}

template<class T>
int IKmerStore<T>::getS() const {
  return s;
}

352 353 354 355 356
template<class T>
string IKmerStore<T>::getSeed() const {
  return seed;
}

357
template<class T>
358 359
Fasta IKmerStore<T>::getLabel(T kmer) const {
  for (typename list< pair<T, Fasta> >::const_iterator it = labels.begin(); it != labels.end(); ++it)
360 361
    if (it->first == kmer)
      return it->second ;
362
  return FASTA_AMBIGUOUS ;
363
}
364 365

// .getResults()
Mikaël Salson's avatar
Mikaël Salson committed
366
template<class T>
367
vector<T> MapKmerStore<T>::getResults(const seqtype &seq, bool no_revcomp, string seed) {
368

Mikaël Salson's avatar
Mikaël Salson committed
369
  string local_seed = seed;
370
  if (! seed.size())
Mikaël Salson's avatar
Mikaël Salson committed
371 372
    local_seed = IKmerStore<T>::seed;
  int s = local_seed.size();
373

Mikaël Salson's avatar
Mikaël Salson committed
374 375 376 377 378
  if ((int)seq.length() < s - 1) {
    return vector<T>(0);
  }
  vector<T> result(seq.length() - s + 1);
  for (size_t i=0; i + s < seq.length() + 1; i++) {
Mikaël Salson's avatar
Mikaël Salson committed
379
    seqtype kmer = spaced(seq.substr(i, s), local_seed);
380
    //    seqtype kmer = seq.substr(i, s);
Mikaël Salson's avatar
Mikaël Salson committed
381
    // cout << kmer << endl << kmer0 << endl << endl ;
382
    if (IKmerStore<T>::revcomp_indexed && no_revcomp) {
Mikaël Salson's avatar
Mikaël Salson committed
383 384 385 386 387 388 389 390
      result[i] = get(kmer);
    } else {
      result[i] = (*this)[kmer];
    }
  }
  return result;
}

391
template<class T>
392
vector<T> ArrayKmerStore<T>::getResults(const seqtype &seq, bool no_revcomp, string seed) {
Mikaël Salson's avatar
Mikaël Salson committed
393 394

  string local_seed = seed;
395
  if (! seed.size())
Mikaël Salson's avatar
Mikaël Salson committed
396 397
    local_seed = IKmerStore<T>::seed;
  int s = local_seed.size();
398 399 400 401 402 403 404 405 406 407 408 409

  int N = (int)seq.length();

  if (N < s - 1) {
    return vector<T>(0);
  }
  vector<T> result(N - s + 1);

  /* Read once the sequence, convert it to int* */
  int* intseq = new int[N];
  for (int i=0; i<N; i++)
    {
410
      intseq[i] = nuc_to_int(seq[i]);
411 412 413 414
    }

  /* Compute results */
  for (size_t i=0; (int) i+s < N+1; i++) {
Mikaël Salson's avatar
Mikaël Salson committed
415
    int kmer = spaced_int(intseq + i, local_seed);
416 417 418 419
    if (IKmerStore<T>::revcomp_indexed && no_revcomp) {
      result[i] = store[kmer]; // getfromint(kmer); // store[kmer];
      // cout << i << "/" << N << "  " << kmer << result[i] << endl ;
    } else {
420
      result[i] = (*this)[kmer]; // Deals with revcomp
421 422 423 424 425 426 427
    }
  }

  delete[] intseq ;
  return result;
}

Mikaël Salson's avatar
Mikaël Salson committed
428 429 430 431 432 433

template<class T>
bool IKmerStore<T>::isRevcomp() const {
  return revcomp_indexed;
}

434 435 436 437 438
template<class T>
size_t IKmerStore<T>::smallestAnalysableLength() const {
  return getK();
}

Mikaël Salson's avatar
Mikaël Salson committed
439 440 441 442 443 444 445 446 447
// MapKmerStore

template <class T>
MapKmerStore<T>::MapKmerStore(string seed, bool revcomp){
  this->seed = seed;   
  int k = seed_weight(seed);
  this->k = k;
  this->s = seed.size();
  this->revcomp_indexed = revcomp;
448
  init();
Mikaël Salson's avatar
Mikaël Salson committed
449 450 451 452 453 454 455 456
}

template <class T>
MapKmerStore<T>::MapKmerStore(int k, bool revcomp){
  this->seed = seed_contiguous(k);
  this->k = k;
  this->s = k;
  this->revcomp_indexed = revcomp;
457 458 459 460 461 462
  init();
}

template <class T>
void MapKmerStore<T>::init() {
  this->nb_kmers_inserted = 0;
463
  this->max_size_indexing = 0;
Mikaël Salson's avatar
Mikaël Salson committed
464 465 466
}

template <class T> 
467
T& MapKmerStore<T>::get(seqtype& word){
Mikaël Salson's avatar
Mikaël Salson committed
468 469 470 471
  return store[word];
}

template <class T> 
472
T& MapKmerStore<T>::operator[](seqtype& word){
Mikaël Salson's avatar
Mikaël Salson committed
473
  if (this->isRevcomp() && T::hasRevcompSymetry()) {
474
    seqtype rc_kmer = revcomp(word);
Mikaël Salson's avatar
Mikaël Salson committed
475 476 477 478 479 480 481 482 483
    if (rc_kmer.compare(word) < 0)
      word = rc_kmer;
  }
  return store[word];
}

// ArrayKmerStore

template <class T> 
484
ArrayKmerStore<T>::ArrayKmerStore(int k, bool revcomp) {
Mikaël Salson's avatar
Mikaël Salson committed
485 486 487 488
  this->seed = seed_contiguous(k);
  this->k = k;
  this->s = k;
  this->revcomp_indexed = revcomp;
489
  init();
Mikaël Salson's avatar
Mikaël Salson committed
490 491 492 493 494 495 496 497 498 499
}


template <class T> 
ArrayKmerStore<T>::ArrayKmerStore(string seed, bool revcomp){
  this->seed = seed; 
  int k = seed_weight(seed);
  this->k = k;
  this->s = seed.size();
  this->revcomp_indexed = revcomp;
500 501 502 503 504
  init();
}

template <class T>
void ArrayKmerStore<T>::init() {
505
  this->nb_kmers_inserted = 0;
506
  this->max_size_indexing = 0;
507
  if ((size_t)(this->k << 1) >= sizeof(int) * 8)
Mikaël Salson's avatar
Mikaël Salson committed
508
    throw std::bad_alloc();
509
  store = new T[(unsigned int)1 << (this->k << 1)];
Mikaël Salson's avatar
Mikaël Salson committed
510 511 512 513 514 515 516 517 518 519 520 521 522 523
  if (! store)
    throw std::bad_alloc();
}

template <class T> 
ArrayKmerStore<T>::~ArrayKmerStore(){
  delete [] store;
}

/**	Returns index of word in an array of size 4^k
	Considering B(A) = 0, B(C) = 1, B(T) = 2, B(G) = 3
	index_word = \sum_{i=0}^{k-1}B(word[i])*4^(k-i-1)
**/
template <class T> 
524
int ArrayKmerStore<T>::index(const seqtype& word) const{
Mikaël Salson's avatar
Mikaël Salson committed
525
  return dna_to_int(word, this->k);
Mikaël Salson's avatar
Mikaël Salson committed
526 527 528
}

template <class T> 
529
T& ArrayKmerStore<T>::get(seqtype& word){
Mikaël Salson's avatar
Mikaël Salson committed
530 531 532 533
  return store[index(word)];
}

template <class T> 
534
T& ArrayKmerStore<T>::operator[](seqtype& word){
535 536 537 538 539
  return (*this)[index(word)];
}

template <class T> 
T& ArrayKmerStore<T>::operator[](int word){
Mikaël Salson's avatar
Mikaël Salson committed
540
  if (this->isRevcomp() && T::hasRevcompSymetry()) {
541 542
    int rc_kmer = revcomp_int(word, IKmerStore<T>::k);
    if (rc_kmer < word)
Mikaël Salson's avatar
Mikaël Salson committed
543 544
      word = rc_kmer;
  }
545
  return store[word];
Mikaël Salson's avatar
Mikaël Salson committed
546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566
}


/**
 * KmerStoreFactory is a factory that allows to create an index that best fits
 * your needs!
 */
class KmerStoreFactory {
 public:
  template<class T>
    static IKmerStore<T> *createIndex(string seed, bool revcomp=false);
  template<class T>
    static IKmerStore<T> *createIndex(int k, bool revcomp=false);
};

template<class T>
IKmerStore<T> *KmerStoreFactory::createIndex(string seed, bool revcomp) {
  IKmerStore<T> *index;
  try{
    index = new ArrayKmerStore<T>(seed, revcomp);
  }catch(exception e){
567
    cout << "  (using a MapKmer to fit into memory)" << endl;
Mikaël Salson's avatar
Mikaël Salson committed
568 569
    index = new MapKmerStore<T>(seed, revcomp);
  }
570 571 572

  index->id = ++IKmerStore<T>::last_id;

Mikaël Salson's avatar
Mikaël Salson committed
573 574 575 576 577 578 579 580 581
  return index;
}

template<class T>
IKmerStore<T> *KmerStoreFactory::createIndex(int k, bool revcomp) {
  return createIndex<T>(seed_contiguous(k), revcomp);
}

#endif