segment.cpp 30.9 KB
Newer Older
Mikaël Salson's avatar
Mikaël Salson committed
1
/*
2
  This file is part of Vidjil <http://www.vidjil.org>
3
  Copyright (C) 2011, 2012, 2013, 2014, 2015, 2016 by Bonsai bioinformatics
4 5 6 7 8
  at CRIStAL (UMR CNRS 9189, Université Lille) and Inria Lille
  Contributors: 
      Mathieu Giraud <mathieu.giraud@vidjil.org>
      Mikaël Salson <mikael.salson@vidjil.org>
      Marc Duez <marc.duez@vidjil.org>
Mikaël Salson's avatar
Mikaël Salson committed
9 10 11 12 13 14 15 16 17 18 19 20 21 22

  "Vidjil" is free software: you can redistribute it and/or modify
  it under the terms of the GNU General Public License as published by
  the Free Software Foundation, either version 3 of the License, or
  (at your option) any later version.

  "Vidjil" is distributed in the hope that it will be useful,
  but WITHOUT ANY WARRANTY; without even the implied warranty of
  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  GNU General Public License for more details.

  You should have received a copy of the GNU General Public License
  along with "Vidjil". If not, see <http://www.gnu.org/licenses/>
*/
Mikaël Salson's avatar
Mikaël Salson committed
23
#include <algorithm>    // std::sort
Mikaël Salson's avatar
Mikaël Salson committed
24 25 26 27
#include <cassert>
#include "segment.h"
#include "tools.h"
#include "affectanalyser.h"
Mikaël Salson's avatar
Mikaël Salson committed
28
#include <sstream>
29
#include <cstring>
Marc Duez's avatar
Marc Duez committed
30
#include <string>
Mikaël Salson's avatar
Mikaël Salson committed
31

32
#define NO_FORBIDDEN_ID (-1)
33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49

AlignBox::AlignBox() {
  del_left = 0 ;
  start = 0 ;
  end = 0 ;
  del_right = 0 ;

  ref_nb = 0 ;
  ref = "";
  ref_label = "";
}

string AlignBox::getSequence(string sequence) {
  return sequence.substr(start, end-start+1);
}


50 51 52 53 54 55 56 57 58 59 60
ostream &operator<<(ostream &out, const AlignBox &box)
{
  out << "[/" << box.del_left << " " ;
  out << "@" << box.start << " " ;
  out << box.ref_label << "(" << box.ref_nb << ") " ;
  out << "@" << box.end << " " ;
  out << box.del_right << "/]" ;

  return out ;
}

61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80
string codeFromBoxes(vector <AlignBox*> boxes, string sequence)
{
  string code = "";

  int n = boxes.size();

  for (int i=0; i<n; i++) {

    if (i>0) {
      code += " " + string_of_int(boxes[i-1]->del_right) + "/"
        // From box_left->end + 1 to box_right->start - 1
        + sequence.substr(boxes[i-1]->end + 1, boxes[i]->start - boxes[i-1]->end - 1)
        + "/" + string_of_int(boxes[i]->del_left) + " " ;
    }

    code += boxes[i]->ref_label ;
  }

  return code;
}
81

82

Mathieu Giraud's avatar
Mathieu Giraud committed
83
Segmenter::~Segmenter() {}
Mikaël Salson's avatar
Mikaël Salson committed
84

Mathieu Giraud's avatar
Mathieu Giraud committed
85
Sequence Segmenter::getSequence() const {
Mikaël Salson's avatar
Mikaël Salson committed
86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105
  Sequence s ;
  s.label_full = info ;
  s.label = label + " " + (reversed ? "-" : "+");
  s.sequence = revcomp(sequence, reversed);

  return s ;
}

string Segmenter::getJunction(int l) const {
  assert(isSegmented());

  int start = (getLeft() + getRight())/2 - l/2;
  
  if (start < 0 or start + l > (int)sequence.size())  // TODO: +l ou +l-1 ?
    return "" ;

  return getSequence().sequence.substr(start, l);
}

int Segmenter::getLeft() const {
106
  return box_V->end;
Mikaël Salson's avatar
Mikaël Salson committed
107 108 109
}
  
int Segmenter::getRight() const {
110
  return box_J->start;
Mikaël Salson's avatar
Mikaël Salson committed
111 112 113
}

int Segmenter::getLeftD() const {
114
  return box_D->start;
Mikaël Salson's avatar
Mikaël Salson committed
115 116 117
}
  
int Segmenter::getRightD() const {
118
  return box_D->end;
Mikaël Salson's avatar
Mikaël Salson committed
119 120 121 122 123 124 125 126 127 128 129 130 131 132
}

bool Segmenter::isReverse() const {
  return reversed;
}

bool Segmenter::isSegmented() const {
  return segmented;
}

bool Segmenter::isDSegmented() const {
  return dSegmented;
}

133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151

// E-values

void Segmenter::checkLeftRightEvaluesThreshold(double threshold, int strand)
{
  if (threshold == NO_LIMIT_VALUE)
    return ;

  if (evalue_left >= threshold && evalue_right >= threshold)
    because = UNSEG_TOO_FEW_ZERO ;
  else if ((strand == 1 ? evalue_left : evalue_right) >= threshold)
    because = UNSEG_TOO_FEW_V ;
  else if ((strand == 1 ? evalue_right : evalue_left) >= threshold)
    because = UNSEG_TOO_FEW_J ;
  else if (evalue >= threshold) // left and right are <= threshold, but their sum is > threshold
    because = UNSEG_TOO_FEW_ZERO ;
}


Mikaël Salson's avatar
Mikaël Salson committed
152 153 154 155 156 157 158 159
// Chevauchement

string Segmenter::removeChevauchement()
{
  assert(isSegmented());
  
  string chevauchement = "" ;

160
  if (box_V->end >= box_J->start)
Mikaël Salson's avatar
Mikaël Salson committed
161
    {
162 163 164 165
      int middle = (box_V->end + box_J->start) / 2 ;
      chevauchement = " !ov " + string_of_int (box_V->end - box_J->start + 1);
      box_V->end = middle ;
      box_J->start = middle+1 ;
Mikaël Salson's avatar
Mikaël Salson committed
166 167 168 169 170 171 172 173 174 175 176 177 178 179
    }

  return chevauchement ;
}

// Prettyprint


bool Segmenter::finishSegmentation() 
{
  assert(isSegmented());
  
  string seq = getSequence().sequence;
    
180 181 182 183 184
  seg_V = seq.substr(0, box_V->end+1) ;
  seg_N = seq.substr(box_V->end+1, box_J->start-box_V->end-1) ;  // Twice computed for FineSegmenter, but only once in KmerSegmenter !
  seg_J = seq.substr(box_J->start) ;
  box_D->start=0;
  box_D->end=0;
Mikaël Salson's avatar
Mikaël Salson committed
185 186 187 188 189 190 191 192 193 194 195 196 197

  info = "VJ \t" + string_of_int(FIRST_POS) + " " + info + " " + string_of_int(seq.size() - 1 + FIRST_POS) ;
  info += "\t" + code ;

  info = (reversed ? "- " : "+ ") + info ;

  return true ;
}

bool Segmenter::finishSegmentationD() 
{
  string seq = getSequence().sequence;

198 199 200 201
  seg_V = seq.substr(0, box_V->end+1) ; // From pos. 0 to box_V->end
  seg_J = seq.substr(box_J->start) ;
  seg_N = seq.substr(box_V->end+1, box_J->start-box_V->end-1) ;  // Twice computed for FineSegmenter, but only once in KmerSegmenter !
  seg_D  = seq.substr(box_D->start, box_D->end-box_D->start+1) ; // From Dstart to Dend
Mikaël Salson's avatar
Mikaël Salson committed
202
  
203 204 205 206
  info = "VDJ \t0 " + string_of_int(box_V->end) +
                " " + string_of_int(box_D->start) +
		" " + string_of_int(box_D->end) +
		" " + string_of_int(box_J->start) +
Mikaël Salson's avatar
Mikaël Salson committed
207 208 209 210 211 212 213 214 215
		" " + string_of_int(seq.size()-1+FIRST_POS) ;
		
  info += "\t" + code ;
  
  info = (reversed ? "- " : "+ ") + info ;

  return true ;
}

216 217
string Segmenter::getInfoLine() const
{
218
  string s = "" ;
219 220 221 222 223

  s += (segmented ? "" : "! ") + info ;
  s += " " + info_extra ;
  s += " " + segmented_germline->code ;
  s += " " + string(segmented_mesg[because]) ;
224 225 226 227

  if (evalue > NO_LIMIT_VALUE)
    s += " " + scientific_string_of_double(evalue);

228 229 230 231 232
  if (evalue_left > NO_LIMIT_VALUE)
    s += " " + scientific_string_of_double(evalue_left);
  if (evalue_right > NO_LIMIT_VALUE)
    s += "/" + scientific_string_of_double(evalue_right);

233 234 235
  return s ;
}

236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251
string KmerSegmenter::getInfoLineWithAffects() const
{
   stringstream ss;

   ss << "# "
      << right << setw(3) << score << " "
      << left << setw(30)
      << getInfoLine() ;

   if (getSegmentationStatus() != UNSEG_TOO_SHORT)
     ss << getKmerAffectAnalyser()->toString();

   return ss.str();
}


Mikaël Salson's avatar
Mikaël Salson committed
252 253
ostream &operator<<(ostream &out, const Segmenter &s)
{
254
  out << ">" << s.label << " " ;
255
  out << s.getInfoLine() << endl;
Mikaël Salson's avatar
Mikaël Salson committed
256 257 258 259 260 261 262 263 264

  if (s.segmented)
    {
      out << s.seg_V << endl ;
      out << s.seg_N << endl ;
      out << s.seg_J << endl ;
    }
  else
    {
265
      out << s.getSequence().sequence << endl ;
Mikaël Salson's avatar
Mikaël Salson committed
266 267 268 269 270 271 272 273
    }

  return out ;
}


// KmerSegmenter (Cheap)

274 275
KmerSegmenter::KmerSegmenter() { kaa = 0 ; }

276
KmerSegmenter::KmerSegmenter(Sequence seq, Germline *germline, double threshold, int multiplier)
Mikaël Salson's avatar
Mikaël Salson committed
277
{
278 279 280 281
  box_V = new AlignBox();
  box_D = new AlignBox();
  box_J = new AlignBox();

Mikaël Salson's avatar
Mikaël Salson committed
282 283 284
  label = seq.label ;
  sequence = seq.sequence ;
  info = "" ;
285
  info_extra = "seed";
Mikaël Salson's avatar
Mikaël Salson committed
286
  segmented = false;
287
  segmented_germline = germline ;
288
  system = germline->code; // useful ?
289
  reversed = false;
290
  because = NOT_PROCESSED ; // Cause of unsegmentation
291
  score = 0 ;
292
  evalue = NO_LIMIT_VALUE;
293 294
  evalue_left = NO_LIMIT_VALUE;
  evalue_right = NO_LIMIT_VALUE;
295

296
  int s = (size_t)germline->index->getS() ;
Mikaël Salson's avatar
Mikaël Salson committed
297
  int length = sequence.length() ;
Mikaël Salson's avatar
Mikaël Salson committed
298

299
  if (length < s) 
Mikaël Salson's avatar
Mikaël Salson committed
300
    {
Mathieu Giraud's avatar
Mathieu Giraud committed
301 302
      because = UNSEG_TOO_SHORT;
      kaa = NULL;
303
      return ;
Mikaël Salson's avatar
Mikaël Salson committed
304 305
    }
 
306
  kaa = new KmerAffectAnalyser(*(germline->index), sequence);
Mikaël Salson's avatar
Mikaël Salson committed
307 308
  
  // Check strand consistency among the affectations.
Mikaël Salson's avatar
Mikaël Salson committed
309 310 311 312 313 314 315 316 317
  int strand;
  int nb_strand[2] = {0,0};     // In cell 0 we'll put the number of negative
                                // strand, while in cell 1 we'll put the
                                // positives
  for (int i = 0; i < kaa->count(); i++) { 
    KmerAffect it = kaa->getAffectation(i);
    if (! it.isAmbiguous() && ! it.isUnknown()) {
      strand = affect_strand(it.affect);
      nb_strand[(strand + 1) / 2] ++; // (strand+1) / 2 → 0 if strand == -1; 1 if strand == 1
Mikaël Salson's avatar
Mikaël Salson committed
318 319 320
    }
  }

321 322
  score = nb_strand[0] + nb_strand[1] ; // Used only for non-segmented germlines

323 324
  reversed = (nb_strand[0] > nb_strand[1]) ;

325 326
  if ((germline->seg_method == SEG_METHOD_MAX12)
      || (germline->seg_method == SEG_METHOD_MAX1U))
327 328 329 330
    { // Pseudo-germline, MAX12 and MAX1U
      pair <KmerAffect, KmerAffect> max12 ;
      CountKmerAffectAnalyser ckaa(*(germline->index), sequence);

331 332 333 334 335

      set<KmerAffect> forbidden;
      forbidden.insert(KmerAffect::getAmbiguous());
      forbidden.insert(KmerAffect::getUnknown());

336
      if (germline->seg_method == SEG_METHOD_MAX12)
337 338 339
        // MAX12: two maximum k-mers (no unknown)
        {
          max12 = ckaa.max12(forbidden);
340

341 342 343 344 345 346
          if (max12.first.isUnknown() || max12.second.isUnknown())
            {
              because = UNSEG_TOO_FEW_ZERO ;
              return ;
            }
        }
347

348 349
      else
        // MAX1U: the maximum k-mers (no unknown) + unknown
350
        {
351 352 353 354 355 356 357 358 359
          CountKmerAffectAnalyser ckaa(*(germline->index), sequence);
          KmerAffect max = ckaa.max(forbidden);

          if (max.isUnknown())
            {
              because = UNSEG_TOO_FEW_ZERO ;
              return ;
            }
          max12 = make_pair(max, KmerAffect::getUnknown());
360 361
        }

362 363 364 365 366
      pair <KmerAffect, KmerAffect> before_after =  ckaa.sortLeftRight(max12);

      before = before_after.first ;
      after = before_after.second ;

367 368 369
      // This strand computation is only a heuristic, especially for chimera +/- reads
      // Anyway, it allows to gather such reads and their reverse complement into a unique window...
      // ... except when the read is quite different outside the window
370
      strand = reversed ? -1 : 1 ;
371 372 373 374 375
    }

  else
    { // Regular germline

376
  // Test on which strand we are, select the before and after KmerAffects
Mikaël Salson's avatar
Mikaël Salson committed
377
  if (nb_strand[0] == 0 && nb_strand[1] == 0) {
378
    because = UNSEG_TOO_FEW_ZERO ;
379
    return ;
Mikaël Salson's avatar
Mikaël Salson committed
380 381
  } else if (nb_strand[0] > RATIO_STRAND * nb_strand[1]) {
    strand = -1;
382 383
    before = KmerAffect(germline->affect_3, -1); 
    after = KmerAffect(germline->affect_5, -1);
Mikaël Salson's avatar
Mikaël Salson committed
384 385
  } else if (nb_strand[1] > RATIO_STRAND * nb_strand[0]) {
    strand = 1;
386 387
    before = KmerAffect(germline->affect_5, 1); 
    after = KmerAffect(germline->affect_3, 1);    
Mikaël Salson's avatar
Mikaël Salson committed
388 389
  } else {
    // Ambiguous information: we have positive and negative strands
390 391 392 393 394
    // and there is not enough difference to put them apart.
    if (nb_strand[0] + nb_strand[1] >= DETECT_THRESHOLD_STRAND)
      because = UNSEG_STRAND_NOT_CONSISTENT ;
    else
      because = UNSEG_TOO_FEW_ZERO ;
395
    return ;
Mikaël Salson's avatar
Mikaël Salson committed
396 397
  }

398
    } // endif Pseudo-germline
399
 
400
  computeSegmentation(strand, before, after, threshold, multiplier);
Mathieu Giraud's avatar
Mathieu Giraud committed
401
}
Mikaël Salson's avatar
Mikaël Salson committed
402

Mathieu Giraud's avatar
Mathieu Giraud committed
403
KmerSegmenter::~KmerSegmenter() {
404 405
  if (kaa)
    delete kaa;
406 407 408 409

  delete box_V;
  delete box_D;
  delete box_J;
410 411
}

412 413
KmerMultiSegmenter::KmerMultiSegmenter(Sequence seq, MultiGermline *multigermline, ostream *out_unsegmented,
                                       double threshold, int nb_reads_for_evalue)
414
{
415 416
  bool found_seg = false ; // Found a segmentation
  double best_evalue_seg = NO_LIMIT_VALUE ; // Best evalue, segmented sequences
417
  int best_score_unseg = 0 ; // Best score, unsegmented sequences
418
  the_kseg = NULL;
419
  multi_germline = multigermline;
420
  threshold_nb_expected = threshold;
421 422 423

  // E-value multiplier
  int multiplier = multi_germline->germlines.size() * nb_reads_for_evalue;
424
  
425 426 427 428 429
  // Iterate over the germlines
  for (list<Germline*>::const_iterator it = multigermline->germlines.begin(); it != multigermline->germlines.end(); ++it)
    {
      Germline *germline = *it ;

430
      KmerSegmenter *kseg = new KmerSegmenter(seq, germline, threshold, multiplier);
431
      bool keep_seg = false;
432

433 434 435
      if (out_unsegmented)
        {
          // Debug, display k-mer affectation and segmentation result for this germline
436
          *out_unsegmented << kseg->getInfoLineWithAffects() << endl ;
437 438
        }

439 440
      // Always remember the first kseg
      if (the_kseg == NULL)
441
        keep_seg = true;
442
      
443
      if (kseg->isSegmented())
444 445
        {
          // Yes, it is segmented
446
          // Should we keep the kseg ?
447
          if (!found_seg || (kseg->evalue < best_evalue_seg))
448
            {
449
              keep_seg = true;
450 451 452
              best_evalue_seg = kseg->evalue ;

              found_seg = true;
453
            }
454
        }
455 456 457 458 459 460 461
      else
        {
          // It is not segmented
          // Should we keep the kseg (with the unsegmentation cause) ?
            if (kseg->score > best_score_unseg)
            {              
              best_score_unseg = kseg->score ;
462
              if (!found_seg)
463 464 465 466
                keep_seg = true;
            }
        }
      
467
      if (keep_seg) {
468 469
        if (the_kseg)
          delete the_kseg;
470 471 472 473
        the_kseg = kseg;
      } else {
        delete kseg;
      }
474 475 476
    } // end for (Germlines)
}

477
KmerMultiSegmenter::~KmerMultiSegmenter() {
478 479
  if (the_kseg)
    delete the_kseg;
Mathieu Giraud's avatar
Mathieu Giraud committed
480 481
}

482 483
void KmerSegmenter::computeSegmentation(int strand, KmerAffect before, KmerAffect after,
                                        double threshold, int multiplier) {
484
  // Try to segment, computing 'box_V->end' and 'box_J->start'
485 486
  // If not segmented, put the cause of unsegmentation in 'because'

487
  affect_infos max;
488
  max = kaa->getMaximum(before, after);
Mikaël Salson's avatar
Mikaël Salson committed
489

490 491 492
  // We did not find a good segmentation point
  if (!max.max_found) {
    // We labeled it detected if there were both enough affect_5 and enough affect_3
493 494 495 496 497 498 499 500 501
    bool detected_before = (max.nb_before_left + max.nb_before_right >= DETECT_THRESHOLD);
    bool detected_after = (max.nb_after_left + max.nb_after_right >= DETECT_THRESHOLD);

    if (detected_before && detected_after)
      because = UNSEG_AMBIGUOUS ;
    else if ((strand == 1 && detected_before) || (strand == -1 && detected_after))
      because = UNSEG_TOO_FEW_J ;
    else if ((strand == 1 && detected_after) || (strand == -1 && detected_before))
      because = UNSEG_TOO_FEW_V ;
502
    else
503
      because = UNSEG_TOO_FEW_ZERO ;
504 505 506 507 508

    return ;
  }


509
  // E-values
510 511 512
  pair <double, double> pvalues = kaa->getLeftRightProbabilityAtLeastOrAbove();
  evalue_left = pvalues.first * multiplier ;
  evalue_right = pvalues.second * multiplier ;
513
  evalue = evalue_left + evalue_right ;
514

515
  checkLeftRightEvaluesThreshold(threshold, strand);
516

517
  if (because != NOT_PROCESSED)
518 519
    return ;

520 521
   // There was a good segmentation point

522 523
   box_V->end = max.first_pos_max;
   box_J->start = max.last_pos_max + 1;
524
   if (strand == -1) {
525 526 527
     int tmp = sequence.size() - box_V->end - 1;
     box_V->end = sequence.size() - box_J->start - 1;
     box_J->start = tmp;
528 529 530 531 532 533
   }

  // Yes, it is segmented
  segmented = true;
  because = reversed ? SEG_MINUS : SEG_PLUS ;

534
  info = string_of_int(box_V->end + FIRST_POS) + " " + string_of_int(box_J->start + FIRST_POS)  ;
535 536 537 538 539 540

  // removeChevauchement is called once info was already computed: it is only to output info_extra
  info_extra += removeChevauchement();
  finishSegmentation();

  return ;
Mathieu Giraud's avatar
Mathieu Giraud committed
541
}
Mikaël Salson's avatar
Mikaël Salson committed
542

543
KmerAffectAnalyser *KmerSegmenter::getKmerAffectAnalyser() const {
Mathieu Giraud's avatar
Mathieu Giraud committed
544 545
  return kaa;
}
Mikaël Salson's avatar
Mikaël Salson committed
546

547
int Segmenter::getSegmentationStatus() const {
Mathieu Giraud's avatar
Mathieu Giraud committed
548
  return because;
Mikaël Salson's avatar
Mikaël Salson committed
549 550
}

551 552 553 554 555
void Segmenter::setSegmentationStatus(int status) {
  because = status;
  segmented = (status == SEG_PLUS || status == SEG_MINUS);
}

Mikaël Salson's avatar
Mikaël Salson committed
556 557
// FineSegmenter

558

559
string check_and_resolve_overlap(string seq, int seq_begin, int seq_end,
560 561
                                 AlignBox *box_left, AlignBox *box_right,
                                 Cost segment_cost)
Mikaël Salson's avatar
Mikaël Salson committed
562
{
563
  // Overlap size
564
  int overlap = box_left->end - box_right->start + 1;
565 566 567

  if (overlap > 0)
    {
568 569
      string seq_left = seq.substr(seq_begin, box_left->end - seq_begin + 1);
      string seq_right = seq.substr(box_right->start, seq_end - box_right->start + 1);
570

Mikaël Salson's avatar
Mikaël Salson committed
571 572 573 574
      int score_r[overlap+1];
      int score_l[overlap+1];
      
      //LEFT
575
      DynProg dp_l = DynProg(seq_left, box_left->ref,
Mikaël Salson's avatar
Mikaël Salson committed
576
			   DynProg::Local, segment_cost);
577
      score_l[0] = dp_l.compute();
578

Mikaël Salson's avatar
Mikaël Salson committed
579 580
      
      //RIGHT
581
      // reverse right sequence
582
      string ref_right=string(box_right->ref.rbegin(), box_right->ref.rend());
583 584 585
      seq_right=string(seq_right.rbegin(), seq_right.rend());


586
      DynProg dp_r = DynProg(seq_right, ref_right,
Mikaël Salson's avatar
Mikaël Salson committed
587
			   DynProg::Local, segment_cost);
588
      score_r[0] = dp_r.compute();
589 590 591 592 593 594 595 596 597



      int trim_l[overlap+1];
      int trim_r[overlap+1];

      for(int i=0; i<=overlap; i++) {
        score_l[i] = i < seq_left.size()  ? dp_l.best_score_on_i(seq_left.size()  - i, trim_l + i) : MINUS_INF ;
        score_r[i] = i < seq_right.size() ? dp_r.best_score_on_i(seq_right.size() - i, trim_r + i) : MINUS_INF ;
Mikaël Salson's avatar
Mikaël Salson committed
598
      }
599

600 601 602 603 604 605

// #define DEBUG_OVERLAP
#ifdef DEBUG_OVERLAP
      cout << dp_l ;
      cout << dp_r ;

606 607
      cout << "seq:" << seq_left << "\t\t" << seq_right << endl;
      cout << "ref:" << ref_left << "\t\t" << ref_right << endl;
608 609 610 611 612 613 614 615
      for(int i=0; i<=overlap; i++)
        cout << i << "  left: " << score_l[i] << "/" << trim_l[i] << "     right: " << score_r[i] << "/" << trim_r[i] << endl;
#endif

      int score = MINUS_INF;
      int best_i = 0 ;
      int best_j = 0 ;

Mikaël Salson's avatar
Mikaël Salson committed
616

617
      // Find (i, j), with i+j >= overlap,
618
      // maximizing score_l[j] + score_r[i]
Mikaël Salson's avatar
Mikaël Salson committed
619 620
      for (int i=0; i<=overlap; i++){
	for (int j=overlap-i; j<=overlap; j++){
621
          int score_ij = score_l[i] + score_r[j];
622

623 624 625
	  if (score_ij > score) {
            best_i = i ;
            best_j = j ;
626 627
            box_left->del_right = box_left->ref.size() - trim_l[i];
	    box_right->del_left = box_right->ref.size() - trim_r[j];
628
	    score = score_ij;
Mikaël Salson's avatar
Mikaël Salson committed
629 630 631
	  }
	}
      }
632

633 634
      box_left->end -= best_i ;
      box_right->start += best_j ;
635 636

#ifdef DEBUG_OVERLAP
637
      cout << "overlap: " << overlap << ", " << "best_overlap_split: " << score
638 639
           << "    left: " << best_i << "-" << box_left->del_right << " @" << box_left->end
           << "    right:" << best_j << "-" << box_right->del_left << " @" << box_right->start
640
           << endl;
641
#endif
642 643
    } // end if (overlap > 0)

644 645
  // From box_left->end + 1 to box_right->start - 1
  return seq.substr(box_left->end + 1, box_right->start - box_left->end - 1);
Mikaël Salson's avatar
Mikaël Salson committed
646 647
}

Mikaël Salson's avatar
Mikaël Salson committed
648 649 650 651 652
bool comp_pair (pair<int,int> i,pair<int,int> j)
{
  return ( i.first > j.first);
}

653 654 655 656 657

/**
 * Align a read against a collection of sequences, maximizing the alignment 'score'
 * @param read:         the read
 * @param rep:          a collection of reference sequences
658
 * @param reverse_ref:  if true, reverse the reference sequences (VkVk)
659
 * @param reverse_both: if true, reverse both the read and the reference sequences (J segment)
660
 * @param local:        if true, Local alignment (D segment), otherwise LocalEndWithSomeDeletions and onlyBottomTriangle (V and J segments)
661
 * @param box:          the AligBox to fill
662
 * @param segment_cost: the cost used by the dynamic programing
663
 * @post  box is filled
664 665
 */

666 667
void align_against_collection(string &read, Fasta &rep, int forbidden_rep_id,
                              bool reverse_ref, bool reverse_both, bool local,
668
                             AlignBox *box, Cost segment_cost)
Mikaël Salson's avatar
Mikaël Salson committed
669 670 671
{
  
  int best_score = MINUS_INF ;
672
  box->ref_nb = MINUS_INF ;
Mikaël Salson's avatar
Mikaël Salson committed
673 674 675 676
  int best_best_i = (int) string::npos ;
  int best_best_j = (int) string::npos ;
  int best_first_i = (int) string::npos ;
  int best_first_j = (int) string::npos ;
677

Mikaël Salson's avatar
Mikaël Salson committed
678
  vector<pair<int, int> > score_r;
Mikaël Salson's avatar
Mikaël Salson committed
679 680 681

  DynProg::DynProgMode dpMode = DynProg::LocalEndWithSomeDeletions;
  if (local==true) dpMode = DynProg::Local;
682 683 684

  // With reverse_ref, the read is reversed to prevent calling revcomp on each reference sequence
  string sequence_or_rc = revcomp(read, reverse_ref);
Mikaël Salson's avatar
Mikaël Salson committed
685 686 687
  
  for (int r = 0 ; r < rep.size() ; r++)
    {
688 689 690
      if (r == forbidden_rep_id)
        continue;

691
      DynProg dp = DynProg(sequence_or_rc, rep.sequence(r),
Mikaël Salson's avatar
Mikaël Salson committed
692 693 694
			   dpMode, // DynProg::SemiGlobalTrans, 
			   segment_cost, // DNA
			   reverse_both, reverse_both);
695 696 697

      bool onlyBottomTriangle = !local ;
      int score = dp.compute(onlyBottomTriangle, BOTTOM_TRIANGLE_SHIFT);
Mikaël Salson's avatar
Mikaël Salson committed
698
      
Mikaël Salson's avatar
Mikaël Salson committed
699 700 701 702 703 704 705 706 707 708 709
      if (local==true){ 
	dp.backtrack();
      }
      
      if (score > best_score)
	{
	  best_score = score ;
	  best_best_i = dp.best_i ;
	  best_best_j = dp.best_j ;
	  best_first_i = dp.first_i ;
	  best_first_j = dp.first_j ;
710 711
	  box->ref_nb = r ;
	  box->ref_label = rep.label(r) ;
Mikaël Salson's avatar
Mikaël Salson committed
712
	}
Mikaël Salson's avatar
Mikaël Salson committed
713 714
	
	score_r.push_back(make_pair(score, r));
Mathieu Giraud's avatar
Mathieu Giraud committed
715 716 717 718 719 720

	// #define DEBUG_SEGMENT      

#ifdef DEBUG_SEGMENT	
	cout << rep.label(r) << " " << score << " " << dp.best_i << endl ;
#endif
Mikaël Salson's avatar
Mikaël Salson committed
721 722

    }
Mikaël Salson's avatar
Mikaël Salson committed
723
    sort(score_r.begin(),score_r.end(),comp_pair);
Mikaël Salson's avatar
Mikaël Salson committed
724

725 726 727 728
  box->ref = rep.sequence(box->ref_nb);
  box->del_right = reverse_both ? best_best_j : box->ref.size() - best_best_j - 1;
  box->del_left = best_first_j;
  box->start = best_first_i;
Mikaël Salson's avatar
Mikaël Salson committed
729
  
730
  box->score = score_r;
Mathieu Giraud's avatar
Mathieu Giraud committed
731 732

#ifdef DEBUG_SEGMENT	
733
  cout << "best: " << box->ref_label << " " << best_score ;
734
  cout << "del/del2/begin:" << (box->del_right) << "/" << (box->del_left) << "/" << (box->start) << endl;
Mathieu Giraud's avatar
Mathieu Giraud committed
735 736
  cout << endl;
#endif
737 738 739 740

  if (reverse_ref)
    // Why -1 here and +1 in dynprog.cpp /// best_i = m - best_i + 1 ;
    best_best_i = read.length() - best_best_i - 1 ;
741 742

  box->end = best_best_i ;
Mikaël Salson's avatar
Mikaël Salson committed
743 744 745 746 747 748 749
}

string format_del(int deletions)
{
  return deletions ? *"(" + string_of_int(deletions) + " del)" : "" ;
}

750
FineSegmenter::FineSegmenter(Sequence seq, Germline *germline, Cost segment_c,  double threshold, int multiplier)
Mikaël Salson's avatar
Mikaël Salson committed
751
{
752 753 754 755
  box_V = new AlignBox();
  box_D = new AlignBox();
  box_J = new AlignBox();

756 757
  segmented = false;
  dSegmented = false;
758
  because = NOT_PROCESSED ;
759
  segmented_germline = germline ;
760
  info_extra = "" ;
Mikaël Salson's avatar
Mikaël Salson committed
761 762 763
  label = seq.label ;
  sequence = seq.sequence ;
  segment_cost=segment_c;
764
  evalue = NO_LIMIT_VALUE;
765 766
  evalue_left = NO_LIMIT_VALUE;
  evalue_right = NO_LIMIT_VALUE;
Mikaël Salson's avatar
Mikaël Salson committed
767

768 769
  CDR3start = -1;
  CDR3end = -1;
770

771 772 773
  bool reverse_V = false ;
  bool reverse_J = false ;

774
  if ((germline->seg_method == SEG_METHOD_MAX12) || (germline->seg_method == SEG_METHOD_MAX1U))
775
    {
776
      // We check whether this sequence is segmented with MAX12 or MAX1U (with default e-value parameters)
777
      KmerSegmenter *kseg = new KmerSegmenter(seq, germline, THRESHOLD_NB_EXPECTED, 1);
778
      if (kseg->isSegmented())
779
        {
780 781 782 783 784
          reversed = kseg->isReverse();

          KmerAffect left = reversed ? KmerAffect(kseg->after, true) : kseg->before ;
          KmerAffect right = reversed ? KmerAffect(kseg->before, true) : kseg->after ;

785 786
          delete kseg ;

787 788 789
          reverse_V = (left.getStrand() == -1);
          reverse_J = (right.getStrand() == -1);

790
          code = "Unexpected ";
791

792 793 794 795
          code += left.toStringSigns() + germline->index->getLabel(left).name;
          code += "/";
          code += right.toStringSigns() + germline->index->getLabel(right).name;
          info_extra += " " + left.toString() + "/" + right.toString() + " (" + code + ")";
796 797 798 799 800

          if (germline->seg_method == SEG_METHOD_MAX1U)
            return ;

          germline->override_rep5_rep3_from_labels(left, right);
801
        }
802
      else
803 804 805 806
        {
          delete kseg ;
          return ;
        }
807
    }
808

809 810 811 812 813 814 815
  // Strand determination, with KmerSegmenter (with default e-value parameters)
  // Note that we use only the 'strand' component
  // When the KmerSegmenter fails, continue with positive strand
  // TODO: flag to force a strand / to test both strands ?

  KmerSegmenter *kseg = new KmerSegmenter(seq, germline, THRESHOLD_NB_EXPECTED, 1);
  reversed = kseg->isReverse();
816
  delete kseg ;
Mikaël Salson's avatar
Mikaël Salson committed
817
  
818
  sequence_or_rc = revcomp(sequence, reversed); // sequence, possibly reversed
819

Mathieu Giraud's avatar
Mathieu Giraud committed
820 821

  /* Segmentation */
822
  align_against_collection(sequence_or_rc, germline->rep_5, NO_FORBIDDEN_ID, reverse_V, reverse_V, false,
823
                                        box_V, segment_cost);
824

825
  align_against_collection(sequence_or_rc, germline->rep_3, NO_FORBIDDEN_ID, reverse_J, !reverse_J, false,
826
                                          box_J, segment_cost);
827 828 829 830 831

  // J was run with '!reverseJ', we copy the box informations from right to left
  // Should this directly be handled in align_against_collection() ?
  box_J->start = box_J->end ;
  box_J->del_left = box_J->del_right;
832

833
  /* E-values */
834 835
  evalue_left  = multiplier * sequence.size() * germline->rep_5.totalSize() * segment_cost.toPValue(box_V->score[0].first);
  evalue_right = multiplier * sequence.size() * germline->rep_3.totalSize() * segment_cost.toPValue(box_J->score[0].first);
836
  evalue = evalue_left + evalue_right ;
837 838

  /* Unsegmentation causes */
839
  if (box_V->end == (int) string::npos)
840
    {
841
      evalue_left = BAD_EVALUE ;
842
    }
843
      
844
  if (box_J->start == (int) string::npos)
845
    {
846
      evalue_right = BAD_EVALUE ;
847 848
    }

849 850
  checkLeftRightEvaluesThreshold(threshold, reversed ? -1 : 1);

851 852 853
  if (because != NOT_PROCESSED)
    {
      segmented = false;
854
      info = " @" + string_of_int (box_V->end + FIRST_POS) + "  @" + string_of_int(box_J->start + FIRST_POS) ;
Mikaël Salson's avatar
Mikaël Salson committed
855 856
      return ;
    }
857 858 859 860

  /* The sequence is segmented */
  segmented = true ;
  because = reversed ? SEG_MINUS : SEG_PLUS ;
861

Mikaël Salson's avatar
Mikaël Salson committed
862
    //overlap VJ
863
  seg_N = check_and_resolve_overlap(sequence_or_rc, 0, sequence_or_rc.length(),
864
                                    box_V, box_J, segment_cost);
865

866
  // Why could this happen ?
867 868
      if (box_J->start>=(int) sequence.length())
	  box_J->start=sequence.length()-1;
Mikaël Salson's avatar
Mikaël Salson committed
869

870
  // seg_N will be recomputed in finishSegmentation()
Mikaël Salson's avatar
Mikaël Salson committed
871

872 873 874
  vector <AlignBox*> boxes ;
  boxes.push_back(box_V);
  boxes.push_back(box_J);
875
  code = codeFromBoxes(boxes, sequence_or_rc);
Mikaël Salson's avatar
Mikaël Salson committed
876

877
  info = string_of_int(box_V->end + FIRST_POS) + " " + string_of_int(box_J->start + FIRST_POS) ;
Mikaël Salson's avatar
Mikaël Salson committed
878 879 880
  finishSegmentation();
}

881
bool FineSegmenter::FineSegmentD(Germline *germline,
882
                                 AlignBox *box_Y, AlignBox *box_DD, AlignBox *box_Z,
883
                                 int forbidden_id,
884
                                 int extend_DD_on_Y, int extend_DD_on_Z,
885
                                 double evalue_threshold, int multiplier){
886

887 888
    // Create a zone where to look for D, adding some nucleotides on both sides
    int l = box_Y->end - extend_DD_on_Y;
Mikaël Salson's avatar
Mikaël Salson committed
889 890 891
    if (l<0) 
      l=0 ;

892
    int r = box_Z->start + extend_DD_on_Z;
Mikaël Salson's avatar
Mikaël Salson committed
893

894 895 896 897
    string seq = getSequence().sequence; // segmented sequence, possibly rev-comped

    if (r > (int) seq.length())
      r = seq.length();
Mikaël Salson's avatar
Mikaël Salson committed
898
      
899
    string str = seq.substr(l, r-l);
Mikaël Salson's avatar
Mikaël Salson committed
900 901

    // Align
902
    align_against_collection(str, germline->rep_4, forbidden_id, false, false, true,
903
                                           box_DD, segment_cost);
904

905 906 907 908
    box_DD->start += l ;
    box_DD->end += l ;

    float evalue_D = multiplier * (r-l) * germline->rep_4.totalSize() * segment_cost.toPValue(box_DD->score[0].first);
909

910
    if (evalue_D > evalue_threshold)
911
      return false;
Mikaël Salson's avatar
Mikaël Salson committed
912 913
    
    //overlap VD
914 915
    seg_N1 = check_and_resolve_overlap(seq, 0, box_DD->end,
                                       box_Y, box_DD, segment_cost);
Mikaël Salson's avatar
Mikaël Salson committed
916 917
    
    //overlap DJ
918 919
    seg_N2 = check_and_resolve_overlap(seq, box_DD->start, seq.length(),
                                       box_DD, box_Z, segment_cost);
920 921 922 923

    return true;
}

924 925
void FineSegmenter::FineSegmentD(Germline *germline, bool several_D,
                                 double evalue_threshold, int multiplier){