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
|
Source: seqan-needle
Section: science
Priority: optional
Maintainer: Debian Med Packaging Team <debian-med-packaging@lists.alioth.debian.org>
Uploaders: Michael R. Crusoe <crusoe@debian.org>
Build-Depends: debhelper-compat (= 13),
architecture-is-64-bit,
architecture-is-little-endian,
cmake,
libseqan3-dev (>= 3.2.0+ds-5),
libgtest-dev,
libcereal-dev,
pkgconf,
git,
doxygen <!nodoc>
Standards-Version: 4.7.0
Vcs-Browser: https://salsa.debian.org/med-team/seqan-needle
Vcs-Git: https://salsa.debian.org/med-team/seqan-needle.git
Homepage: https://github.com/seqan/needle
Rules-Requires-Root: no
Package: seqan-needle
Architecture: any
Depends: ${shlibs:Depends}, ${misc:Depends}
Description: pre-filter for the counting of very large collections of nucleotide sequences
Needle is a tool for semi-quantitative analysis of very large collections of
nucleotide sequences.
.
Needle stores its data in multiple interleaved Bloom filter, a fast and space
efficient probabilistic data structure and uses a windowing scheme (also called
minimisers) to reduce the amount of data to store. How many interleaved Bloom
filter are used is defined by the user. Each interleaved Bloom filter has a so
called expression threshold and stores minimisers with an occurrence greater
than or equal to its own expression threshold and smaller than the next biggest
expression threshold (if there is no bigger expression threshold, all greater
than or equal to the threshold are stored). These expression thresholds are
then used during the query (called estimate) to approximate the expression
values of given transcripts.
Package: seqan-needle-doc
Architecture: all
Depends: ${misc:Depends}
Section: doc
Multi-Arch: foreign
Description: HTML documentation for seqan-needle and its APIs
Needle is a tool for semi-quantitative analysis of very large collections of
nucleotide sequences.
.
Needle stores its data in multiple interleaved Bloom filter, a fast and space
efficient probabilistic data structure and uses a windowing scheme (also called
minimisers) to reduce the amount of data to store. How many interleaved Bloom
filter are used is defined by the user. Each interleaved Bloom filter has a so
called expression threshold and stores minimisers with an occurrence greater
than or equal to its own expression threshold and smaller than the next biggest
expression threshold (if there is no bigger expression threshold, all greater
than or equal to the threshold are stored). These expression thresholds are
then used during the query (called estimate) to approximate the expression
values of given transcripts.
.
This package contains Needle's HTML docs.
|
