Suchergebnisse - Text Compression and Indexing Algorithms

Multidimensional query processing algorithm by dimension transformation von Rejwana Tasnim Rimi, K. M. Azharul Hasan, Tomohiro Tsuji

Volltext

Frequent contiguous pattern mining over biological sequences of protein misfolded diseases von Mohammad Tarequl Islam, Md. Abul Kashem Mia, Mohammad Shamsur Rahman, Mohammad Shamsul Arefin, Pranab Kumar Dhar, Takeshi Koshiba

Volltext

Large-scale compression of genomic sequence databases with the Burrows-Wheeler transform von Cox, Anthony J., Bauer, Markus J., Jakobi, Tobias, Rosone, Giovanna

“… Motivation: The Burrows–Wheeler transform (BWT) is the foundation of many algorithms for compression and indexing of text data, but the cost of computing …”
Volltext

A linguistic steganography based on word indexing compression and candidate selection von Xiang, Lingyun, Wu, Wenshuai, Li, Xu, Yang, Chunfang

“… The length of the practical embedded payload can be reduced by the proposed word indexing compression algorithm(WIC …”
Volltext

Non-overlapping indexing in BWT-runs bounded space von Gibney, Daniel, MacNichol, Paul, Thankachan, Sharma V.

“… We revisit the non-overlapping indexing problem for an efficient repetition-aware solution …”
Volltext

Lightweight algorithms for constructing and inverting the BWT of string collections von Bauer, Markus J., Cox, Anthony J., Rosone, Giovanna

“… Such a dataset can now be generated in just a few days on a single sequencing machine. Many algorithms and data structures for compression and indexing of text have the BWT …”
Volltext

Foldcomp: a library and format for compressing and indexing large protein structure sets von Kim, Hyunbin, Mirdita, Milot, Steinegger, Martin

“… ; these pose a challenge in terms of storage and processing. Here, we present Foldcomp, a novel lossy structure compression algorithm, and indexing system to address this challenge …”
Volltext

CREMSA : compressed indexing of (ultra) large multiple sequence alignments von Salson, Mikaël, Boddaert, Arthur, Gueye, Awa Bousso, Bulteau, Laurent, Hernandez--Courbevoie, Yohan, Marchet, Camille, Pan, Nan, Will, Sebastian, Ponty, Yann

“… ). Such MSAs are largely ungapped, and mostly homogeneous on a column-wise level but not at a sequential level due to local variations, hindering the performances of sequential compression algorithms …”
Volltext

On compressing and indexing repetitive sequences von Kreft, Sebastian, Navarro, Gonzalo

“… We introduce LZ-End, a new member of the Lempel–Ziv family of text compressors, which achieves compression ratios close to those of LZ77 but is much faster at extracting arbitrary text substrings …”
Volltext

Stronger Lempel-Ziv Based Compressed Text Indexing von Arroyuelo, Diego, Navarro, Gonzalo, Sadakane, Kunihiko

“… Given a text T [1.. u ] over an alphabet of size σ , the full-text search problem consists in finding the occ occurrences of a given pattern P [1.. m …”
Volltext

Indexing k -mers in linear space for quality value compression von Shibuya, Yoshihiro, Comin, Matteo

“… Many bioinformatics tools heavily rely on -mer dictionaries to describe the composition of sequences and allow for faster reference-free algorithms or look-ups …”
Weitere Angaben

Efficient Compression and Indexing for Highly Repetitive DNA Sequence Collections von Huo, Hongwei, Chen, Xiaoyang, Guo, Xu, Vitter, Jeffrey Scott

“… In this paper, we focus upon the important problem of indexing and searching highly repetitive DNA sequence collections …”
Volltext

Fixed Block Compression Boosting in FM-Indexes: Theory and Practice von Gog, Simon, Kärkkäinen, Juha, Kempa, Dominik, Petri, Matthias, Puglisi, Simon J.

“… Our main theoretical result is a new technique called fixed block compression boosting , which is a simpler and faster alternative to optimal compression boosting and implicit compression boosting …”
Volltext

Resolution of the Burrows-Wheeler Transform Conjecture von Kempa, Dominik, Kociumaka, Tomasz

“… This is in contrast to nearly all other known compression methods, whose sizes have been shown to be either always within a \text{polylog}n factor …”
Volltext

Collapsing the Hierarchy of Compressed Data Structures: Suffix Arrays in Optimal Compressed Space von Kempa, Dominik, Kociumaka, Tomasz

“… The last two decades have witnessed a dramatic increase in the amount of highly repetitive datasets consisting of sequential data (strings, texts …”
Volltext

A new class of string transformations for compressed text indexing von Giancarlo, Raffaele, Manzini, Giovanni, Restivo, Antonio, Rosone, Giovanna, Sciortino, Marinella

“… Introduced about thirty years ago in the field of data compression, the Burrows-Wheeler Transform (BWT …”
Volltext

Geometric BWT: Compressed Text Indexing via Sparse Suffixes and Range Searching von Chien, Yu-Feng, Hon, Wing-Kai, Shah, Rahul, Thankachan, Sharma V., Vitter, Jeffrey Scott

“… This allows us to apply the lower bounds known in the field of orthogonal range searching to the problems in compressed text indexing …”
Volltext

On-Demand Indexing for Referential Compression of DNA Sequences von Alves, Fernando, Cogo, Vinicius, Wandelt, Sebastian, Leser, Ulf, Bessani, Alysson

“… Referential compression is one of these techniques, in which the similarity between the DNA of organisms of the same or an evolutionary close species is exploited to reduce the storage demands …”
Volltext

Indexing labeled sequences von Rocher, Tatiana, Giraud, Mathieu, Salson, Mikaël

“… are a way to add some information on a text, such as functional annotations such as genes on a DNA sequences. V(D …”
Volltext

Compressed indexing and local alignment of DNA von Lam, T. W., Sung, W. K., Tam, S. L., Wong, C. K., Yiu, S. M.

“… ). Without indexing, one can use dynamic programming to find all the local alignments between a text T and a pattern P in O(|T||P …”
Volltext