seqan-raptor 3.0.1+ds-5 source package in Ubuntu
Changelog
seqan-raptor (3.0.1+ds-5) unstable; urgency=medium * d/tests/run-unit-test: also use -DRAPTOR_NATIVE_BUILD=OFF here -- Michael R. Crusoe <email address hidden> Wed, 06 Sep 2023 15:04:40 +0200
Upload details
- Uploaded by:
- Debian Med
- Uploaded to:
- Sid
- Original maintainer:
- Debian Med
- Architectures:
- any all
- Section:
- misc
- Urgency:
- Medium Urgency
See full publishing history Publishing
| Series | Published | Component | Section | |
|---|---|---|---|---|
| Oracular | release | universe | misc | |
| Noble | release | universe | misc |
Downloads
| File | Size | SHA-256 Checksum |
|---|---|---|
| seqan-raptor_3.0.1+ds-5.dsc | 2.6 KiB | 788721c027472c1e1c673d75476be77aeed65f5b228ac1296c38b1b79d5fc7d2 |
| seqan-raptor_3.0.1+ds.orig.tar.xz | 2.9 MiB | 3fb5f987f3c0e678d5de41ab3f9f66eae37ba5993edb294caa9e8f2c6132a55d |
| seqan-raptor_3.0.1+ds-5.debian.tar.xz | 10.0 KiB | f841e6322018fe1148e249c14bd6807ea1354c220c7d3be298785372d0a7c5c2 |
Available diffs
No changes file available.
Binary packages built by this source
- seqan-raptor: pre-filter for querying very large collections of nucleotide sequences
Raptor is a system for approximately searching many queries such as
next-generation sequencing reads or transcripts in large collections of
nucleotide sequences. Raptor uses winnowing minimizers to define a set of
representative k-mers, an extension of the interleaved Bloom filters (IBFs) as
a set membership data structure and probabilistic thresholding for minimizers.
This approach allows compression and partitioning of the IBF to enable the
effective use of secondary memory.
- seqan-raptor-dbgsym: debug symbols for seqan-raptor
- seqan-raptor-doc: HTML & PDF documentation for seqan-raptor and its APIs
Raptor is a system for approximately searching many queries such as
next-generation sequencing reads or transcripts in large collections of
nucleotide sequences. Raptor uses winnowing minimizers to define a set of
representative k-mers, an extension of the interleaved Bloom filters (IBFs) as
a set membership data structure and probabilistic thresholding for minimizers.
This approach allows compression and partitioning of the IBF to enable the
effective use of secondary memory.
.
This package contains Raptor's docs (HTML & PDF).
