Results 61 to 70 of about 14,384 (164)
Compressed Text Indexes:From Theory to Practice!
, 2007 A compressed full-text self-index represents a text in a compressed form and still answers queries efficiently. This technology represents a breakthrough over the text indexing techniques of the previous decade, whose indexes required several times the ...
Ferragina, Paolo +3 more
core +4 more sources
Sorting suffixes of a text via its Lyndon Factorization
, 2013 The process of sorting the suffixes of a text plays a fundamental role in Text Algorithms. They are used for instance in the constructions of the Burrows-Wheeler transform and the suffix array, widely used in several fields of Computer Science.
Mantaci, Sabrina +3 more
core +1 more source
mkESA: enhanced suffix array construction tool [PDF]
Bioinformatics, 2009 Abstract Summary: We introduce the tool mkESA, an open source program for constructing enhanced suffix arrays (ESAs), striving for low memory consumption, yet high practical speed. mkESA is a user-friendly program written in portable C99, based on a parallelized version of the Deep-Shallow suffix array construction algorithm, which is ...
Homann, Robert +3 more
openaire +2 more sources
CalFUSE v3: A Data-Reduction Pipeline for the Far Ultraviolet Spectroscopic Explorer
, 2007 Since its launch in 1999, the Far Ultraviolet Spectroscopic Explorer (FUSE) has made over 4600 observations of some 2500 individual targets. The data are reduced by the Principal Investigator team at the Johns Hopkins University and archived at the ...
A. W. Fullerton +16 more
core +2 more sources
RLZAP: Relative Lempel-Ziv with Adaptive Pointers
, 2016 Relative Lempel-Ziv (RLZ) is a popular algorithm for compressing databases of genomes from individuals of the same species when fast random access is desired.
A Farruggia +12 more
core +1 more source
Dictionary Matching with One Gap
, 2014 The dictionary matching with gaps problem is to preprocess a dictionary $D$ of $d$ gapped patterns $P_1,\ldots,P_d$ over alphabet $\Sigma$, where each gapped pattern $P_i$ is a sequence of subpatterns separated by bounded sequences of don't cares.
A. Amir +19 more
core +1 more source
Index structures for distributed text databases
Journal of Computer Science and Technology, 2004 The Web has became an obiquitous resource for distributed computing making it relevant to investigate new ways of providing efficient access to services available at dedicated sites.
Juan Mauricio Marin Cahiuan
doaj
Sampling the Suffix Array with Minimizers [PDF]
, 2015 Sampling (evenly) the suffixes from the suffix array is an old idea trading the pattern search time for reduced index space. A few years ago Claude et al. showed an alphabet sampling scheme allowing for more efficient pattern searches compared to the sparse suffix array, for long enough patterns.
Grabowski, Szymon, Raniszewski, Marcin
openaire +2 more sources
Breaking the O(n)-Barrier in the Construction of Compressed Suffix Arrays and Suffix Trees. [PDF]
Proc Annu ACM SIAM Symp Discret Algorithms, 2023 Kempa D, Kociumaka T.
europepmc +1 more source
Better external memory suffix array construction
ACM Journal of Experimental Algorithmics, 2008 Suffix arrays are a simple and powerful data structure for text processing that can be used for full text indexes, data compression, and many other applications, in particular, in bioinformatics. However, so far, it has appeared prohibitive to build suffix arrays for huge inputs that do not fit into main memory. This paper presents design,
Dementiev, Roman +3 more
openaire +4 more sources