Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 231,270,913 papers from all fields of science
Search
Sign In
Create Free Account
Compressed suffix array
In computer science, a compressed suffix array is a compressed data structure for pattern matching. Compressed suffix arrays are a general class of…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
14 relations
Auxiliary memory
Bioinformatics
Compressed data structure
Computer science
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Space-Efficient Parallel Construction of Succinct Representations of Suffix Tree Topologies
Uwe Baier
,
Timo Beller
,
Enno Ohlebusch
ACM Journal of Experimental Algorithmics
2017
Corpus ID: 15984799
A compressed suffix tree usually consists of three components: a compressed suffix array, a compressed LCP-array, and a succinct…
Expand
2014
2014
A Compressed Suffix-Array Strategy for Temporal-Graph Indexing
N. Brisaboa
,
Diego Caro
,
A. Fariña
,
Michael A. Rodriguez
SPIRE
2014
Corpus ID: 21565396
Temporal graphs represent vertexes and binary relations that change over time. In this paper we consider a temporal graph as a…
Expand
2014
2014
A space-efficient solution to find the maximum overlap using a compressed suffix array
M. Rachid
,
Q. Malluhi
,
M. Abouelhoda
Middle East Conference on Biomedical Engineering
2014
Corpus ID: 41383161
Compressed indices are important data structures in stringology. Compressed versions of many well-known data structures such as…
Expand
Review
2013
Review
2013
Index Compression for Audio Fingerprinting Systems Based on Compressed Suffix Array
Qingmei Xiao
,
Narumi Saito
,
Kazuyuki Matsumoto
,
Xin Luo
,
Yasushi Yokota
,
K. Kita
2013
Corpus ID: 12504110
Abstract—As one of most popular technologies, audio fingerprinting has recently attracted much attention in music retrieval…
Expand
2012
2012
A Simple Introduction to Compressed Suffix Arrays
D. Andersen
2012
Corpus ID: 6854162
This document attempts to provide a simple introduction to a quite fun, and possibly-becominguseful full-text index structure…
Expand
2012
2012
Indexing Sequences of IEEE 754 Double Precision Numbers
A. Fariña
,
Alberto Ordóñez Pereira
,
J. Paramá
Data Compression Conference
2012
Corpus ID: 34271614
2010
2010
Parallel and Distributed Compressed Indexes
L. Russo
,
G. Navarro
,
Arlindo L. Oliveira
Annual Symposium on Combinatorial Pattern…
2010
Corpus ID: 2901510
We study parallel and distributed compressed indexes. Compressed indexes are a new and functional way to index text strings. They…
Expand
2008
2008
Compressed Suffix Array
Djamal Belazzougui
,
V. Mäkinen
,
Daniel Valenzuela
Encyclopedia of Algorithms
2008
Corpus ID: 26192640
2005
2005
Linear-Time Construction of Compressed Suffix Arrays Using o(n log n)-Bit Working Space for Large Alphabets
J. Na
Annual Symposium on Combinatorial Pattern…
2005
Corpus ID: 41200431
The suffix array is a fundamental index data structure in string algorithms and bioinformatics, and the compressed suffix array…
Expand
2005
2005
A New Compressed Suffix Tree Supporting Fast Search and Its Construction Algorithm Using Optimal Working Space
Dong Kyue Kim
,
Heejin Park
Annual Symposium on Combinatorial Pattern…
2005
Corpus ID: 706442
The compressed suffix array and the compressed suffix tree for a given string S are full-text index data structures occupying O…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE