Výsledky vyhľadávania - Text Compression and Indexing Algorithms

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

Získať plný text

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

Získať plný text

Large-scale compression of genomic sequence databases with the Burrows-Wheeler transform Autor 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…”
Získať plný text

A linguistic steganography based on word indexing compression and candidate selection Autor 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…”
Získať plný text

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

“…We revisit the non-overlapping indexing problem for an efficient repetition-aware solution…”
Získať plný text

Lightweight algorithms for constructing and inverting the BWT of string collections Autor 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…”
Získať plný text

Foldcomp: a library and format for compressing and indexing large protein structure sets Autor 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…”
Získať plný text

CREMSA : compressed indexing of (ultra) large multiple sequence alignments Autor 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…”
Získať plný text

On compressing and indexing repetitive sequences Autor 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…”
Získať plný text

Stronger Lempel-Ziv Based Compressed Text Indexing Autor 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…”
Získať plný text

Indexing k -mers in linear space for quality value compression Autor 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…”
Zistit podrobnosti o prístupe

Efficient Compression and Indexing for Highly Repetitive DNA Sequence Collections Autor 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…”
Získať plný text

Fixed Block Compression Boosting in FM-Indexes: Theory and Practice Autor 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…”
Získať plný text

Resolution of the Burrows-Wheeler Transform Conjecture Autor 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…”
Získať plný text

Collapsing the Hierarchy of Compressed Data Structures: Suffix Arrays in Optimal Compressed Space Autor 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…”
Získať plný text

A new class of string transformations for compressed text indexing Autor 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…”
Získať plný text

Geometric BWT: Compressed Text Indexing via Sparse Suffixes and Range Searching Autor 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…”
Získať plný text

On-Demand Indexing for Referential Compression of DNA Sequences Autor 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…”
Získať plný text

Indexing labeled sequences Autor 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…”
Získať plný text

Compressed indexing and local alignment of DNA Autor 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…”
Získať plný text