1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
|
Source: libedlib
Maintainer: Debian Med Packaging Team <debian-med-packaging@lists.alioth.debian.org>
Uploaders: Andreas Tille <tille@debian.org>
Section: science
Priority: optional
Build-Depends: debhelper (>= 12~),
cmake,
dh-python,
d-shlibs,
rename,
cython3,
python3-all-dev,
python3-setuptools
Standards-Version: 4.3.0
Vcs-Browser: https://salsa.debian.org/med-team/libedlib
Vcs-Git: https://salsa.debian.org/med-team/libedlib.git
Homepage: https://github.com/Martinsos/edlib
Package: libedlib0
Architecture: any
Section: libs
Depends: ${misc:Depends},
${shlibs:Depends}
Description: 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;
Features
.
* 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.
Package: libedlib-dev
Architecture: any
Section: libdevel
Depends: ${misc:Depends},
${shlibs:Depends},
libedlib0 (= ${binary:Version})
Description: library for sequence alignment using edit distance (devel)
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;
Features
.
* 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 static library and the header files.
Package: edlib-aligner
Architecture: any
Depends: ${misc:Depends},
${shlibs:Depends},
libedlib0 (= ${binary:Version})
Description: edlib sequence alignment tool using edit distance
Edlib is a lightweight and super fast C/C++ library for sequence
alignment using edit distance. This package provides an aligner
using this library.
.
Features of libedlib
.
* 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.
Package: python3-edlib
Architecture: any
Section: python
Depends: ${misc:Depends},
${shlibs:Depends},
${python3:Depends}
Description: library for sequence alignment using edit distance (Python3 module)
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;
Features
.
* 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 Python3 module.
|
