معرفی شرکت ها
libxxsds-dynamic-dev_1.0~alpha.1+git20210426.548c6f7-1_all.deb
تبلیغات ما
مشتریان به طور فزاینده ای آنلاین هستند. تبلیغات می تواند به آنها کمک کند تا کسب و کار شما را پیدا کنند.
مشاهده بیشتر
تبلیغات ما
مشتریان به طور فزاینده ای آنلاین هستند. تبلیغات می تواند به آنها کمک کند تا کسب و کار شما را پیدا کنند.
مشاهده بیشتر
تبلیغات ما
مشتریان به طور فزاینده ای آنلاین هستند. تبلیغات می تواند به آنها کمک کند تا کسب و کار شما را پیدا کنند.
مشاهده بیشتر
تبلیغات ما
مشتریان به طور فزاینده ای آنلاین هستند. تبلیغات می تواند به آنها کمک کند تا کسب و کار شما را پیدا کنند.
مشاهده بیشتر
تبلیغات ما
مشتریان به طور فزاینده ای آنلاین هستند. تبلیغات می تواند به آنها کمک کند تا کسب و کار شما را پیدا کنند.
مشاهده بیشترتوضیحات
succinct and compressed fully-dynamic data structures library
| ویژگی | مقدار |
|---|---|
| سیستم عامل | Linux |
| توزیع | Debian Bookworm-12 |
| مخزن | Debian main all |
| نام بسته | libxxsds-dynamic-dev |
| نام فایل بسته | libxxsds-dynamic-dev_1.0~alpha.1+git20210426.548c6f7-1_all.deb |
| نسخه بسته | 1.0~alpha.1+git20210426.548c6f7 |
| انتشار بسته | 1 |
| معماری بسته | all |
| نگهدارنده | Debian Med Packaging Team <debian-med-packaging@lists.alioth.debian.org> |
| تاریخ ساخت | - |
| هاست سازنده | - |
| نوع بسته | .deb |
| آدرس صفحه اصلی | https://github.com/xxsds/DYNAMIC |
| مجوز | - |
| حجم دانلود | 58384 |
| حجم نصب | 345 |
This library offers space- and time-efficient implementations of some
basic succinct/compressed dynamic data structures. It only ships header
files, i.e. is inclusion only.
.
DYNAMIC features:
.
* A succinct Searchable Partial Sums with Indels (SPSI) structure
representing a list of integers s_1, s_2, ..., s_m. Space: about
1.2 * m * ( log(M/m) + log log m )
bits, where
M = m + s_1 + s_2 + ... + s_m.
The structure supports also update operations (i.e. s_i = s_i + delta).
* A Succinct dynamic bitvector supporting rank/select/access/Indel
(RSAI) operations. Space: about 1.2 * n bits.
* A gap-compressed dynamic bitvector supporting rank/select/access/Indel
operations. Space: about 1.2 * b * ( log(n/b) + log log b ) bits,
b being the number of bits set and n being the bitvector length. All
operations take log(b) time.
* A dynamic sparse vector (of integers) with access/Indel operations.
* A dynamic string supporting rank/select/access/Indel operations. The
user can choose at construction time between
fixed-length/gamma/Huffman encoding of the alphabet. All operations
take log(n) * log(sigma) time (or log(n) * H0 with Huffman encoding).
* A run-length encoded dynamic string supporting
rank/select/access/insert operations (removes are not yet
implemented). Space: approximately
R*(1.2 * log(sigma) + 2.4 * (log(n/R)+log log R) )
bits, where R is the number of runs in the string. All operations
take log(R) time.
* A dynamic (left-extend only) entropy/run-length compressed BWT
* A dynamic (left-extend only) entropy/run-length compressed
FM-index. This structure consists in the above BWT + a dynamic suffix
array sampling
.
Algorithms
.
* Two algorithms to build LZ77 in repetition-aware RAM working
space. Both algorithms use a run-length encoded BWT with sparse
Suffix array sampling. The first algorithm stores 2 SA samples per
BWT run. The second algorithm (much more space efficient) stores
1 SA sample per LZ factor. From the papers "Computing LZ77 in
Run-Compressed Space", Alberto Policriti and Nicola Prezza, DCC2016
and " LZ77 Computation Based on the Run-Length Encoded BWT", Alberto
Policriti and Nicola Prezza (Algorithmica)
* An algorithm to build the BWT in run-compressed space
* An algorithm to build LZ77 in nH0(2+o(1)) space and n * log n *
H0 time. From the paper "Fast Online Lempel-Ziv Factorization in
Compressed Space", Alberto Policriti and Nicola Prezza, SPIRE2015
* An algorithm to build the BWT in high-order compressed space. The
algorithm runs in O(n * H_k * log log n) average-case time (e.g. good
for DNA) and O(n * H_k * log n) worst-case time. From the paper
"Average linear time and compressed space construction of the
Burrows-Wheeler transform" Policriti A., Gigante N. and Prezza N.,
LATA 2015 (the paper discusses a theoretically faster variant)
.
The SPSI structure is the building block on which all other structures
are based. This structure is implemented with cache-efficient B-trees.
نیازمندی
| مقدار | نام |
|---|---|
| - |
نحوه نصب
نصب پکیج deb libxxsds-dynamic-dev:
sudo apt-get install libxxsds-dynamic-dev_1.0~alpha.1+git20210426.548c6f7-1_all.deb
فایل ها
| مسیرها |
|---|
| ./usr/include/dynamic/algorithms/cw_bwt.hpp |
| ./usr/include/dynamic/algorithms/h0_lz77.hpp |
| ./usr/include/dynamic/algorithms/rle_lz77_v1.hpp |
| ./usr/include/dynamic/algorithms/rle_lz77_v2.hpp |
| ./usr/include/dynamic/dynamic.hpp |
| ./usr/include/dynamic/internal/alphabet_encoder.hpp |
| ./usr/include/dynamic/internal/bwt.hpp |
| ./usr/include/dynamic/internal/cw_bwt/BackwardFileIterator.h |
| ./usr/include/dynamic/internal/cw_bwt/BackwardIterator.h |
| ./usr/include/dynamic/internal/cw_bwt/BackwardStringIterator.h |
| ./usr/include/dynamic/internal/cw_bwt/ContextAutomata.h |
| ./usr/include/dynamic/internal/cw_bwt/DynamicString.h |
| ./usr/include/dynamic/internal/cw_bwt/HuffmanTree.h |
| ./usr/include/dynamic/internal/cw_bwt/PartialSums.h |
| ./usr/include/dynamic/internal/fm_index.hpp |
| ./usr/include/dynamic/internal/gap_bitvector.hpp |
| ./usr/include/dynamic/internal/hacked_vector.hpp |
| ./usr/include/dynamic/internal/includes.hpp |
| ./usr/include/dynamic/internal/lciv.hpp |
| ./usr/include/dynamic/internal/packed_array.hpp |
| ./usr/include/dynamic/internal/packed_vector.hpp |
| ./usr/include/dynamic/internal/rle_string.hpp |
| ./usr/include/dynamic/internal/sparse_vector.hpp |
| ./usr/include/dynamic/internal/spsi.hpp |
| ./usr/include/dynamic/internal/spsi_check.hpp |
| ./usr/include/dynamic/internal/succinct_bitvector.hpp |
| ./usr/include/dynamic/internal/wm_string.hpp |
| ./usr/include/dynamic/internal/wt_string.hpp |
| ./usr/share/doc/libxxsds-dynamic-dev/changelog.Debian.gz |
| ./usr/share/doc/libxxsds-dynamic-dev/copyright |
| ./usr/share/lintian/overrides/libxxsds-dynamic-dev |