Package: libedlib1 (1.2.7-6 and others)

library for sequence alignment using edit distance

A lightweight and super fast C/C library for sequence alignment using edit distance.

Calculating edit distance of two strings is as simple as:

 edlibAlign("hello", 5, "world!", 6,
            edlibDefaultAlignConfig()).editDistance;

 * Calculates edit distance (Levehnstein distance).
 * It can find optimal alignment path (instructions how to transform
   first sequence into the second sequence).
 * It can find just the start and/or end locations of alignment path -
   can be useful when speed is more important than having exact
   alignment path.
 * Supports multiple alignment methods: global(NW), prefix(SHW) and
   infix(HW), each of them useful for different scenarios.
 * You can extend character equality definition, enabling you to e.g.
   have wildcard characters, to have case insensitive alignment or to
   work with degenerate nucleotides.
 * It can easily handle small or very large sequences, even when finding
   alignment path, while consuming very little memory.
 * Super fast thanks to Myers's bit-vector algorithm.

This package contains the shared library.

Tags: Role: Shared Library

This page is also available in the following languages (How to set the default document language):