view release on metacpan or  search on metacpan

README  view on Meta::CPAN

SEE ALSO
    *   parasail <https://github.com/jeffdaily/parasail>

        parasail is a SIMD C (C99) library containing implementations of the
        Smith-Waterman (local), Needleman-Wunsch (global), and various
        semi-global pairwise sequence alignment algorithms. Here,
        semi-global means insertions before the start or after the end of
        either the query or target sequence are optionally not penalized.
        parasail implements most known algorithms for vectorized pairwise
        sequence alignment, including diagonal , blocked , striped , and
        prefix scan. Therefore, parasail is a reference implementation for
        these algorithms in addition to providing an implementation of the
        best-performing algorithm(s) to date on today's most advanced CPUs.

        parasail implements the above algorithms currently in three
        variants, 1) returning the alignment score and ending locations, 2)
        additionally returning alignment statistics (number of exact matches
        , number of similarities, and alignment length), and 3) functions
        that store a traceback for later retrieval as a SAM CIGAR string.
        The three variants exist because parasail is intended to be

lib/Alien/SeqAlignment/parasail.pm  view on Meta::CPAN

=over 4

=item * L<parasail|https://github.com/jeffdaily/parasail>

parasail is a SIMD C (C99) library containing implementations of the 
Smith-Waterman (local), Needleman-Wunsch (global), and various 
semi-global pairwise sequence alignment algorithms. Here, semi-global 
means insertions before the start or after the end of either the query 
or target sequence are optionally not penalized. parasail implements 
most known algorithms for vectorized pairwise sequence alignment, 
including diagonal , blocked , striped , and prefix scan. Therefore, 
parasail is a reference implementation for these algorithms in 
addition to providing an implementation of the best-performing 
algorithm(s) to date on today's most advanced CPUs.

parasail implements the above algorithms currently in three variants, 
1) returning the alignment score and ending locations, 
2) additionally returning alignment statistics (number of exact matches
, number of similarities, and alignment length), and 3) functions that 
store a traceback for later retrieval as a SAM CIGAR string. The three 
variants exist because parasail is intended to be high-performing;