public class CrochemoreLandauZivUkelsonLocalAlignment extends CrochemoreLandauZivUkelson
This implementation derives from the paper of M.Crochemore, G.Landau and M.Ziv-Ukelson, A Sub-quadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices (available here as PDF or Postscript).
For a general description of the algorithm, please refer to the specification of the abstract CrochemoreLandauZivUkelson superclass.
This class consist mainly of methods that:
createBlock
and its variants);
computeOutputBorder
;
locateScore
;
buildOptimalAlignment
.
This algorithm works essentially in the same way as the global alignment version. The main differences is that an aptimal path can either be contained entirely in a block (called C-path) or be a block-crossing path. A block-crossing path consists of a (possibly empty) S-path (a path that starts inside a block and ends in its output border), followed by any number of paths that cross a block from its input border to its output border, and ending in an E-path (a path that starts in the input border of a block and ends inside the block).
Therefore, it is necessary to compute extra information to keep track of these possibilities. This is accomplished by using an instance of a LocalAlignmentBlock (which extends the AlignmentBlock class) for every block in the block table.
CrochemoreLandauZivUkelson
,
CrochemoreLandauZivUkelsonLocalAlignment
Constructor and Description |
---|
CrochemoreLandauZivUkelsonLocalAlignment() |
getPairwiseAlignment, getScore, loadSequences, setScoringScheme, unloadSequences
Copyright © 2018. All rights reserved.