Results 11 to 20 of about 8,969 (238)
Succinct Data Structures in the Realm of GIS [PDF]
The 4th XoveTIC Conference, 2021 Geographic Information Systems (GIS) have spread all over our technological environment in the last decade. The inclusion of GPS technologies in everyday portable devices along with the creation of massive shareable geographical data banks has boosted the rise of geoinformatics. Despite the technological maturity of this field, there are still relevant
Nieves R. Brisaboa +3 more
openaire +1 more source
DenseZDD: A Compact and Fast Index for Families of Sets †
Algorithms, 2018 In this article, we propose a succinct data structure of zero-suppressed binary decision diagrams (ZDDs). A ZDD represents sets of combinations efficiently and we can perform various set operations on the ZDD without explicitly extracting combinations ...
Shuhei Denzumi +5 more
doaj +1 more source
The Cell Probe Complexity of Succinct Data Structures [PDF]
BRICS Report Series, 2003 In the cell probe model with word size 1 (the bit probe model), a static data structure problem is given by a map f : {0,1}^n * {0,1}^m -> {0,1}, where {0,1}^n is a set of possible data to be stored, {0,1}^m is a set of possible queries (for natural problems, we have m << n) and f(x,y) is the answer to question y about data x.<br /> < ...
Gál, Anna, Miltersen, Peter Bro
openaire +7 more sources
REVIEWING MINIMALIST THEORIES OF CONTROL AND A BRIEF LOOK AT ROMANIAN CONTROL
Studia Universitatis Babeş-Bolyai. Philologia, 2021 Reviewing Minimalist Theories of Control and a Brief Look at Romanian Control. The phenomenon of control is a long-discussed topic within the enterprise of generative grammar.
Mihaela BUZEC
doaj +1 more source
A Framework for Dynamizing Succinct Data Structures [PDF]
, 2007 We present a framework to dynamize succinct data structures, to encourage their use over non-succinct versions in a wide variety of important application areas. Our framework can dynamize most state-of-the-art succinct data structures for dictionaries, ordinal trees, labeled trees, and text collections.
Ankur Gupta 0003 +3 more
openaire +2 more sources
Fast and efficient short read mapping based on a succinct hash index
BMC Bioinformatics, 2018 Background Various indexing techniques have been applied by next generation sequencing read mapping tools. The choice of a particular data structure is a trade-off between memory consumption, mapping throughput, and construction time.
Haowen Zhang +4 more
doaj +1 more source
Succinct data structures for assembling large genomes [PDF]
Bioinformatics, 2011 Abstract Motivation: Second-generation sequencing technology makes it feasible for many researches to obtain enough sequence reads to attempt the de novo assembly of higher eukaryotes (including mammals). De novo assembly not only provides a tool for understanding wide scale biological variation, but within human biomedicine, it offers a
Thomas C. Conway, Andrew J. Bromage
openaire +3 more sources
Statistical Encoding of Succinct Data Structures [PDF]
, 2006 In recent work, Sadakane and Grossi [SODA 2006] introduced a scheme to represent any sequence S=s1s2...sn, over an alphabet of size σ, using $nH_k(S)+O(\frac{n}{\log_\sigma n} (k \log \sigma + \log\log n))$ bits of space, where Hk(S) is the k-th order empirical entropy of S.
González González, Rodrigo +1 more
openaire +1 more source
Succinct Data Structures for Segments
CoRRWe consider succinct data structures for representing a set of $n$ horizontal line segments in the plane given in rank space to support \emph{segment access}, \emph{segment selection}, and \emph{segment rank} queries. A segment access query finds the segment $(x_1, x_2, y)$ given its $y$-coordinate ($y$-coordinates of the segments are distinct), a ...
Philip Bille +2 more
openaire +5 more sources
Rank and Select for Succinct Data Structures
Electronic Notes in Theoretical Computer Science, 2009 AbstractIn this paper, we study different approaches for rank and select on sequences of bytes and propose new implementation strategies. Extensive experimental evaluation comparing the efficiency of the different alternatives are provided.Given a sequence of bits, a rank query counts the number of occurrences of the bit 1 up to a given position, and a
Antonio Fariña +3 more
openaire +1 more source