/usr/include/seqan/align/align_dynprog.h is in seqan-dev 1.3-1ubuntu2.
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 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 | // ==========================================================================
// SeqAn - The Library for Sequence Analysis
// ==========================================================================
// Copyright (c) 2006-2010, Knut Reinert, FU Berlin
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are met:
//
// * Redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimer.
// * Redistributions in binary form must reproduce the above copyright
// notice, this list of conditions and the following disclaimer in the
// documentation and/or other materials provided with the distribution.
// * Neither the name of Knut Reinert or the FU Berlin nor the names of
// its contributors may be used to endorse or promote products derived
// from this software without specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
// AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
// ARE DISCLAIMED. IN NO EVENT SHALL KNUT REINERT OR THE FU BERLIN BE LIABLE
// FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
// DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
// SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
// CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
// LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
// OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
// DAMAGE.
//
// ==========================================================================
#ifndef SEQAN_HEADER_ALIGN_DYNPROG_H
#define SEQAN_HEADER_ALIGN_DYNPROG_H
namespace SEQAN_NAMESPACE_MAIN
{
//////////////////////////////////////////////////////////////////////////////
//needleman wunsch alignment
template <typename TScoreValue, unsigned DIMENSION, typename TString>
TScoreValue
_needlemanWunsch(Matrix<TScoreValue, DIMENSION> & matrix_,
TString const & str1_,
TString const & str2_,
Score<TScoreValue, Simple> const & score_)
{
SEQAN_CHECKPOINT
typedef Matrix<TScoreValue, DIMENSION> TMatrix;
typedef typename Size<TMatrix>::Type TSize;
typedef typename Iterator<TMatrix, Standard>::Type TMatrixIterator;
typedef typename Iterator<TString const, Rooted>::Type TStringIterator;
typedef typename Value<TString const>::Type TValue;
//-------------------------------------------------------------------------
//define some variables
TSize str1_length = length(str1_);
TSize str2_length = length(str2_);
TStringIterator x_begin = begin(str1_) - 1;
TStringIterator x_end = end(str1_) - 1;
TStringIterator y_begin = begin(str2_) - 1;
TStringIterator y_end = end(str2_) - 1;
TStringIterator x = x_end;
TStringIterator y;
TScoreValue score_match = scoreMatch(score_);
TScoreValue score_mismatch = scoreMismatch(score_);
TScoreValue score_gap = scoreGapExtend(score_);
TScoreValue h = 0;
TScoreValue border_ = score_gap;
TScoreValue v = border_;
setDimension(matrix_, 2);
setLength(matrix_, 0, str1_length + 1);
setLength(matrix_, 1, str2_length + 1);
resize(matrix_);
TMatrixIterator col_ = end(matrix_) - 1;
TMatrixIterator finger1;
TMatrixIterator finger2;
//-------------------------------------------------------------------------
// init
finger1 = col_;
*finger1 = 0;
for (x = x_end; x != x_begin; --x)
{
goPrevious(finger1, 0);
*finger1 = border_;
border_ += score_gap;
}
//-------------------------------------------------------------------------
//fill matrix
border_ = 0;
for (y = y_end; y != y_begin; --y)
{
TValue cy = *y;
h = border_;
border_ += score_gap;
v = border_;
finger2 = col_; //points to last column
goPrevious(col_, 1); //points to this column
finger1 = col_;
*finger1 = v;
for (x = x_end; x != x_begin; --x)
{
goPrevious(finger1, 0);
goPrevious(finger2, 0);
if (*x == cy)
{
v = h + score_match;
h = *finger2;
}
else
{
TScoreValue s1 = h + score_mismatch;
h = *finger2;
TScoreValue s2 = score_gap + ((h > v) ? h : v);
v = (s1 > s2) ? s1 : s2;
}
*finger1 = v;
}
}
return v;
}
//////////////////////////////////////////////////////////////////////////////
//traceback through needleman wunsch matrix
template <typename TTargetSource, typename TTargetSpec, typename TScoreValue, unsigned DIMENSION>
void
_needlemanWunschTrace(Align<TTargetSource, TTargetSpec> & target_,
Iter< Matrix<TScoreValue, DIMENSION>, PositionIterator > source_,
Score<TScoreValue, Simple> const & score_)
{
SEQAN_CHECKPOINT
typedef Iter< Matrix<TScoreValue, DIMENSION>, PositionIterator > TMatrixIterator;
typedef Segment<TTargetSource, InfixSegment> TTargetSourceSegment;
TTargetSourceSegment str_0 = sourceSegment(row(target_, 0));
TTargetSourceSegment str_1 = sourceSegment(row(target_, 1));
typedef typename Position<Matrix<TScoreValue, DIMENSION> >::Type TPosition;
TPosition pos_0 = coordinate(source_, 0);
TPosition pos_1 = coordinate(source_, 1);
typedef Align<TTargetSource, TTargetSpec> TAlign;
typedef typename Row<TAlign>::Type TRow;
typedef typename Iterator<TRow, Standard>::Type TTargetIterator;
TTargetIterator target_0 = iter(row(target_, 0), pos_0);
TTargetIterator target_1 = iter(row(target_, 1), pos_1);
typedef typename Iterator<TTargetSourceSegment, Standard>::Type TStringIterator;
TStringIterator it_0 = iter(str_0, pos_0);
TStringIterator it_0_end = end(str_0);
TStringIterator it_1 = iter(str_1, pos_1);
TStringIterator it_1_end = end(str_1);
TScoreValue score_diff = scoreMismatch(score_) - scoreGapExtend(score_);
//-------------------------------------------------------------------------
//follow the trace until the border is reached
while ((it_0 != it_0_end) && (it_1 != it_1_end))
{
bool gv;
bool gh;
if (*it_0 == *it_1)
{
gv = gh = true;
}
else
{
TMatrixIterator it_ = source_;
goNext(it_, 0);
TScoreValue v = *it_;
goNext(it_, 1);
TScoreValue d = *it_;
it_ = source_;
goNext(it_, 1);
TScoreValue h = *it_;
gv = (v >= h) | (d + score_diff >= h);
gh = (h > v) | (d + score_diff >= v);
}
if (gv)
{
++it_0;
goNext(source_, 0);
}
else
{
insertGap(target_0);
}
if (gh)
{
++it_1;
goNext(source_, 1);
}
else
{
insertGap(target_1);
}
++target_0;
++target_1;
}
}
///////////////////////////////////////////////////////////////////////////////////////
//Gotoh
//Global alignment with affine gap costs
template <typename TScoreValue, unsigned DIMENSION, typename TString>
TScoreValue
_gotoh(Matrix<TScoreValue, DIMENSION> & diag_matrix_,
Matrix<TScoreValue, DIMENSION> & vert_matrix_,
Matrix<TScoreValue, DIMENSION> & hori_matrix_,
TString const & str1_,
TString const & str2_,
Score<TScoreValue, Simple> const & score_)
{
SEQAN_CHECKPOINT
typedef Matrix<TScoreValue, DIMENSION> TMatrix;
typedef typename Size<TMatrix>::Type TSize;
typedef typename Iterator<TMatrix, Rooted>::Type TMatrixIterator;
typedef typename Iterator<TString const, Rooted>::Type TStringIterator;
typedef typename Value<TString const>::Type TValue;
//-------------------------------------------------------------------------
//define some variables
TSize str1_length = length(str1_);
TSize str2_length = length(str2_);
TStringIterator x_begin = begin(str1_) - 1;
TStringIterator x_end = end(str1_) - 1;
TStringIterator y_begin = begin(str2_) - 1;
TStringIterator y_end = end(str2_) - 1;
TStringIterator x = x_end;
TStringIterator y;
TScoreValue score_match = scoreMatch(score_);
TScoreValue score_mismatch = scoreMismatch(score_);
TScoreValue score_gap_open = scoreGapOpen(score_);
TScoreValue score_gap_extend = scoreGapExtend(score_);
TScoreValue border_ = score_gap_open;
TScoreValue v;
setDimension(diag_matrix_, 2);
setLength(diag_matrix_, 0, str1_length + 1);
setLength(diag_matrix_, 1, str2_length + 1);
resize(diag_matrix_);
setDimension(vert_matrix_, 2);
setLength(vert_matrix_, 0, str1_length + 1);
setLength(vert_matrix_, 1, str2_length + 1);
resize(vert_matrix_);
setDimension(hori_matrix_, 2);
setLength(hori_matrix_, 0, str1_length + 1);
setLength(hori_matrix_, 1, str2_length + 1);
resize(hori_matrix_);
TMatrixIterator diag_col_ = end(diag_matrix_) - 1;
TMatrixIterator diag_finger1;
TMatrixIterator diag_finger2;
TMatrixIterator vert_col_ = end(vert_matrix_) - 1;
TMatrixIterator vert_finger1;
TMatrixIterator vert_finger2;
TMatrixIterator hori_col_ = end(hori_matrix_) - 1;
TMatrixIterator hori_finger1;
TMatrixIterator hori_finger2;
//-------------------------------------------------------------------------
// init
diag_finger1 = diag_col_;
*diag_finger1 = 0;
vert_finger1 = vert_col_;
*vert_finger1 = -1000000;
hori_finger1 = hori_col_;
*hori_finger1 = -1000000;
for (x = x_end; x != x_begin; --x)
{
goPrevious(diag_finger1, 0);
*diag_finger1 = border_;
goPrevious(hori_finger1, 0);
*hori_finger1 = border_;
goPrevious(vert_finger1, 0);
*vert_finger1 = -1000000;//-inf
border_ += score_gap_extend;
}
//------------------------------------------------------------------------
//fill matrix
border_ = score_gap_open;
for (y = y_end; y != y_begin; --y)
{
TValue cy = *y;
v = border_;
vert_finger2 = vert_col_; //points to last column
goPrevious(vert_col_, 1); //points to this column
vert_finger1 = vert_col_;
*vert_finger1 = v; //initialize first column
diag_finger2 = diag_col_;
goPrevious(diag_col_, 1);
diag_finger1 = diag_col_;
*diag_finger1 = v; //initialize first column
hori_finger2 = hori_col_;
goPrevious(hori_col_, 1);
hori_finger1 = hori_col_;
*hori_finger1 = -1000000; //initialize first column
for (x = x_end; x != x_begin; --x)
{
//compute entry in diag_matrix
goPrevious(diag_finger1, 0);
v = (*diag_finger2 > *vert_finger2) ? *diag_finger2 : *vert_finger2;
v = (*hori_finger2 > v) ? *hori_finger2 : v;
if (*x == cy) *diag_finger1 = v + score_match;
else *diag_finger1 = v + score_mismatch;
//compute entry in hori_matrix
v = *hori_finger1;
goPrevious(hori_finger1, 0);
v += score_gap_extend;
goPrevious(diag_finger2, 1);
*hori_finger1 = (v > (*diag_finger2 + score_gap_open)) ? v : (*diag_finger2 + score_gap_open);
goPrevious(hori_finger2, 0);
//compute entry in vert_matrix
goPrevious(vert_finger2, 0);
goPrevious(vert_finger1, 0);
v = *vert_finger2 + score_gap_extend;
goNext(diag_finger2, 1);
goPrevious(diag_finger2, 0);
*vert_finger1 = (v > (*diag_finger2 + score_gap_open)) ? v : (*diag_finger2 + score_gap_open);
}
border_ += score_gap_extend;
}
v = (*vert_finger1 > *hori_finger1) ? *vert_finger1 : *hori_finger1;
v = (*diag_finger1 > v) ? *diag_finger1 : v;
return v;
}
//////////////////////////////////////////////////////////////////////////////
//gotoh trace
template <typename TTargetSource, typename TTargetSpec, typename TScoreValue, unsigned DIMENSION>
void
_gotohTrace(Align<TTargetSource, TTargetSpec> & target_,
Matrix<TScoreValue, DIMENSION> & diag_matrix_,
Matrix<TScoreValue, DIMENSION> & vert_matrix_,
Matrix<TScoreValue, DIMENSION> & hori_matrix_,
Score<TScoreValue, Simple> const & score_)
{
SEQAN_CHECKPOINT
typedef Iter<Matrix<TScoreValue, DIMENSION>, PositionIterator > TMatrixIterator;
typedef typename Position<Matrix<TScoreValue, DIMENSION> >::Type TPosition;
typedef Align<TTargetSource, TTargetSpec> TAlign;
typedef typename Row<TAlign>::Type TRow;
typedef typename Iterator<TRow, Standard>::Type TTargetIterator;
typedef Segment<TTargetSource, InfixSegment> TTargetSourceSegment;
typedef typename Iterator<TTargetSource, Standard>::Type TStringIterator;
TTargetSourceSegment str_0 = sourceSegment(row(target_, 0));
TTargetSourceSegment str_1 = sourceSegment(row(target_, 1));
typename Size<TTargetSourceSegment>::Type dim_0_len = length(str_0) + 1;
//typename Size<TTargetSourceSegment>::Type dim_1_len = length(str_1) + 1;
TScoreValue score_gap_open = scoreGapOpen(score_);
TScoreValue score_gap_diff = score_gap_open;
//TScoreValue score_gap_extend = scoreGapExtend(score_);
TMatrixIterator diag_source_ = begin(diag_matrix_);
TMatrixIterator hori_source_ = begin(hori_matrix_);
TMatrixIterator vert_source_ = begin(vert_matrix_);
TPosition pos_0 = coordinate(diag_source_, 0);
TPosition pos_1 = coordinate(diag_source_, 1);
TPosition pos = position(diag_source_);
TTargetIterator target_0 = iter(row(target_, 0), pos_0, Standard());
TTargetIterator target_1 = iter(row(target_, 1), pos_1, Standard());
TStringIterator it_0 = iter(str_0, pos_0, Standard());
TStringIterator it_0_end = end(str_0);
TStringIterator it_1 = iter(str_1, pos_1, Standard());
TStringIterator it_1_end = end(str_1);
// indicate which matrix we are in
bool hori = false, vert = false, diag = false;
if (*diag_source_ > *hori_source_)
if (*diag_source_ > *vert_source_) diag = true;
else vert = true;
else
if (*hori_source_ > *vert_source_) hori = true;
else vert = true;
//-------------------------------------------------------------------------
//follow the trace until the border is reached
while ((it_0 != it_0_end) && (it_1 != it_1_end))
{
if(diag)
{
++it_0;
++it_1;
pos += dim_0_len + 1;
if (getValue(diag_matrix_,pos) >= getValue(hori_matrix_,pos))
{
if (getValue(diag_matrix_,pos) < getValue(vert_matrix_,pos))
{
vert = true;
diag = false;
}
}
else
{
diag = false;
if (getValue(hori_matrix_,pos) >= getValue(vert_matrix_,pos)) hori = true;
else vert = true;
}
}
else
{
if(vert)
{
++it_1;
insertGap(target_0);
pos += dim_0_len;
if (getValue(diag_matrix_,pos) + score_gap_diff >= getValue(vert_matrix_,pos))
{
diag = true;
vert = false;
}
}
else
{
if(hori)
{
++it_0;
insertGap(target_1);
++pos;
if (getValue(diag_matrix_,pos) + score_gap_diff >= getValue(hori_matrix_,pos))
{
diag = true;
hori = false;
}
}
}
}
++target_0;
++target_1;
}
}
///////////////////////////////////////////////////////////////////////////
//if gap open == 0 regular needleman wunsch alignment, else gotoh alignment
/*DISABLED
.Function.needlemanWunsch:
..summary:Computes the best global alignment of the (two) sequences given in align according to the score values given in score.
..cat:Alignments
..signature:needlemanWunsch(align, score)
..param.align:The alignment object having the sequences to be aligned as sources.
...type:Class.Align
..param.score:The score values to be used for computing the alignment.
...type:Class.Score
..returns:The score value of the best scoring global alignment.
..returns:The corresponding alignment can be found in align.
..remarks:Depending on the Score object either the regular Needleman Wunsch algorithm (gap open = 0) or the Gotoh algorithm (gap open != 0) is applied.
..see:Function.smithWaterman
..include:seqan/align.h
*/
/*
template <typename TSource, typename TSpec, typename TScoreValue>
TScoreValue
globalAlignment(Align<TSource, TSpec> & align_,
Score<TScoreValue, Simple> const & score_)
{
SEQAN_CHECKPOINT
if(scoreGapOpen(score_)==scoreGapExtend(score_))
{//linear gap costs
return globalAlignment(align_, score_, NeedlemanWunsch());
}
else
{//affine gap costs
return globalAlignment(align_, score_, Gotoh());
}
}
template <typename TSource, typename TSpec, typename TScoreValue>
TScoreValue
globalAlignment(Align<TSource, TSpec> & align_,
Score<TScoreValue, Simple> const & score_,
NeedlemanWunsch)
{
SEQAN_CHECKPOINT
clearGaps(row(align_,0));
clearGaps(row(align_,1));
TScoreValue ret;
Matrix<TScoreValue> matr;
ret = _needlemanWunsch(matr, sourceSegment(row(align_, 0)), sourceSegment(row(align_, 1)), score_);
_needlemanWunschTrace(align_, begin(matr), score_);
return ret;
}
template <typename TSource, typename TSpec, typename TScoreValue>
TScoreValue
globalAlignment(Align<TSource, TSpec> & align_,
Score<TScoreValue, Simple> const & score_,
Gotoh)
{
SEQAN_CHECKPOINT
clearGaps(row(align_,0));
clearGaps(row(align_,1));
TScoreValue ret;
Matrix<TScoreValue> d_matr;
Matrix<TScoreValue> v_matr;
Matrix<TScoreValue> h_matr;
ret = _gotoh(d_matr, v_matr, h_matr, sourceSegment(row(align_, 0)), sourceSegment(row(align_, 1)), score_);
_gotohTrace(align_, d_matr, v_matr, h_matr, score_);
return ret;
}
*/
//////////////////////////////////////////////////////////////////////////////
}// namespace SEQAN_NAMESPACE_MAIN
#endif //#ifndef SEQAN_HEADER_...
|