clasp 1.1

:: DESCRIPTION

clasp is a fast and flexible fragment chainer that supports linear and sum-of-pair gap costs and uses highly time-efficient index structure, i.e., Johnson priority queues and range trees padded with Johnson priority queues. Chaining of short match fragments helps to quickly and accurately identify region of synteny that may not be found using common local alignment heuristics alone.

::DEVELOPER

Christian Otto, Steve Hoffmann, Jan Gorodkin, Peter F. Stadler.

:: SCREENSHOTS

N/A

:: REQUIREMENTS

• Linux

:: DOWNLOAD

 clasp

:: MORE INFORMATION

Citation:

Algorithms Mol Biol. 2011 Mar 18;6:4.
Fast local fragment chaining using sum-of-pair gap costs.
Otto C, Hoffmann S, Gorodkin J, Stadler PF.