PS_QG_ALIGN - Profile/sequence Quasiglobal Gap Alignment

PS_QG_ALIGN is a draft implementation of some of the string matching algorithms described in the reference [Chao]. These algorithms carry out the computation in linear space, and compute not just the optimal alignment score, but also the corresponding optimal alignment.

The quasiglobal matching considered here is similar to the global matching scheme, except that no penalty is applied for the very first gap (a deletion or insertion, but not both), and the very last one. This simple alteration in the global alignment scheme facilitates the search for repeated patterns.

Routines that use quadratic space are included as well, so the algorithms can be compared for storage, speed, and correctness.

The names of the scoring and path routines include information about whether they use a forward, backward, or recursive algorithm, whether they compute the score or the path, and whether they use linear or quadratic space. Thus, the routine PS_QG_FSQ uses the forward algorithm to compute the score, with quadratic space requirements.

Reference 1:
Kun-Mao Chao, Ross Hardison, Webb Miller,
Recent Developments in Linear-Space Alignment Methods: A Survey,
Journal of Computational Biology,
Volume 1, Number 4, 1994, pages 271-291.
Reference 2:
Eugene Myers and Webb Miller,
Optimal Alignments in Linear Space,
CABIOS, volume 4, number 1, 1988, pages 11-17.
Reference 3:
Michael Waterman,
Introduction to Computational Biology,
Chapman and Hall, 1995.

Files you may copy include:

The list of routines includes:

Return to the bioimedical software page.


Last revised on 13 March 2001.