How to Install and Uninstall libxxsds-dynamic-dev Package on Kali Linux

Last updated: April 28,2024

1. Install "libxxsds-dynamic-dev" package

This guide covers the steps necessary to install libxxsds-dynamic-dev on Kali Linux


    
        
            $
        

        
            
                sudo apt update
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt install
            
                        
                libxxsds-dynamic-dev
            
                    
    
    Copied

2. Uninstall "libxxsds-dynamic-dev" package

Please follow the guidance below to uninstall libxxsds-dynamic-dev on Kali Linux:


    
        
            $
        

        
            
                sudo apt remove
            
                        
                libxxsds-dynamic-dev
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt autoclean && sudo apt autoremove
            
                    
    
    Copied

3. Information about the libxxsds-dynamic-dev package on Kali Linux

Package: libxxsds-dynamic-dev
Source: xxsds-dynamic
Version: 1.0~alpha.1+git20210426.548c6f7-2
Installed-Size: 345
Maintainer: Debian Med Packaging Team
Architecture: all
Size: 58548
SHA256: f7945c4ac7a87dbff5f309a611c849ff626fa240d096e614247287e50382ba06
SHA1: abc18bf562aea380187a31a3ecd9e28de15d8b23
MD5sum: 731c8fc71f5fe2f220e75f96476c46df
Description: succinct and compressed fully-dynamic data structures library
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.
Description-md5:
Multi-Arch: foreign
Homepage: https://github.com/xxsds/DYNAMIC
Tag: devel::library, role::devel-lib
Section: libdevel
Priority: optional
Filename: pool/main/x/xxsds-dynamic/libxxsds-dynamic-dev_1.0~alpha.1+git20210426.548c6f7-2_all.deb