Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 236,851,843 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
Compressed Suffix Arrays to Self-Indexes Based on Partitioned Elias-Fano
Guo Wenyu
,
Qu You-li
2017
Corpus ID: 12671088
Abstract — A practical and simple self-indexing data structure, Partitioned Elias-Fano (PEF) - Compressed Suffix Arrays ( CSA…
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
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
ALAE: Accelerating Local Alignment with Affine Gap Exactly in Biosequence Databases
Xiaochun Yang
,
Honglei Liu
,
Bing Wang
Proceedings of the VLDB Endowment
2012
Corpus ID: 694154
We study the problem of local alignment, which is finding pairs of similar subsequences with gaps. The problem exists in…
Expand
2011
2011
Compressed Index for Property Matching
Hua Zhao
,
Songfeng Lu
Data Compression Conference
2011
Corpus ID: 18774938
In this paper, we revisit the Property Matching problem and present a better indexing scheme for the problem. Let T be a text of…
Expand
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
D. Belazzougui
,
V. Mäkinen
,
Daniel Valenzuela
Encyclopedia of Algorithms
2008
Corpus ID: 26192640
2008
2008
Search Engine Technology Based on Compressed Suffix Array
Tian Yuan
2008
Corpus ID: 63058846
The core module of search engines,namely indexer,is usually based on inverted file.But this solution to solve phrase-search is in…
Expand
2007
2007
Comparisons of Practical Performance for Constructing Compressed Suffix Arrays
Chi-Seong Park
,
Minhwan Kim
,
Suk-Hwan Lee
,
Ki-Ryong Kwon
,
Dong Kyue Kim
2007
Corpus ID: 64164899
Suffix arrays, fundamental full-text index data structures, can be efficiently used where patterns are queried many times…
Expand
2004
2004
Entropy-Compressed Indexes for Multidimensional Pattern Matching
R. Grossi
,
J. Vitter
2004
Corpus ID: 9053918
In this talk, we will discuss the challenges involved in developing a multidimensional generalizations of compressed text…
Expand