Results 51 to 60 of about 14,384 (164)
From Theory to Practice: Plug and Play with Succinct Data Structures [PDF]
, 2013 Engineering efficient implementations of compact and succinct structures is a time-consuming and challenging task, since there is no standard library of easy-to- use, highly optimized, and composable components.
F. Claude +9 more
core +1 more source
A quick tour on suffix arrays and compressed suffix arrays
Theoretical Computer Science, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Suffix Arrays in Parallel [PDF]
, 2003 Suffix arrays are powerful data structures for text indexing. In this paper we present parallel algorithms devised to increase throughput of suffix arrays on a multiple-query setting. Experimental results show that efficient performance is indeed feasible in this strongly sequential and very poor locality data structure.
Mauricio Marín, Gonzalo Navarro
openaire +1 more source
Efficient Computation of Sequence Mappability [PDF]
, 2018 Sequence mappability is an important task in genome re-sequencing. In the $(k,m)$-mappability problem, for a given sequence $T$ of length $n$, our goal is to compute a table whose $i$th entry is the number of indices $j \ne i$ such that length-$m ...
Alzamel, Mai +6 more
core +5 more sources
Smaller Compressed Suffix Arrays†
The Computer Journal, 2020 AbstractAn alternative to compressed suffix arrays is introduced, based on representing a sequence of integers using Fibonacci encodings, thereby reducing the space requirements of state-of-the-art implementations of the suffix array, while retaining the searching functionalities.
Ekaterina Benza +2 more
openaire +1 more source
A Grammar Compression Algorithm based on Induced Suffix Sorting
, 2017 We introduce GCIS, a grammar compression algorithm based on the induced suffix sorting algorithm SAIS, introduced by Nong et al. in 2009. Our solution builds on the factorization performed by SAIS during suffix sorting.
Ayala-Rincón, Mauricio +4 more
core +1 more source
SDSL-Mobile: Enabling space-efficient data structures for mobile applications
SoftwareXThis paper presents the process and results of porting the Succinct Data Structure Library 2.0 (SDSL-lite), a robust and well-established open-source C++11 library, to Android platforms.
Alexander Barquero +6 more
doaj +1 more source
On Stabbing Queries for Generalized Longest Repeat
, 2015 A longest repeat query on a string, motivated by its applications in many subfields including computational biology, asks for the longest repetitive substring(s) covering a particular string position (point query).
Xu, Bojian
core +1 more source
A framework for space-efficient string kernels
, 2015 String kernels are typically used to compare genome-scale sequences whose length makes alignment impractical, yet their computation is based on data structures that are either space-inefficient, or incur large slowdowns.
A Apostolico +13 more
core +1 more source
Distributed text search using suffix arrays [PDF]
Parallel Computing, 2014 We introduce distributed-memory text-search algorithms based on suffix arrays.We analyze the proposed search algorithms to determine their theoretical speed-up.We do intensive experimentation on high-performance clusters of processors.We assess our practicality using also web search engines as a case study.
Arroyuelo, Diego +4 more
openaire +4 more sources