Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

14 relations
Auxiliary memoryBioinformaticsCompressed data structureComputer science

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
 Abstract — A practical and simple self-indexing data structure, Partitioned Elias-Fano (PEF) - Compressed Suffix Arrays ( CSA… 
2014
2014
A Compressed Suffix-Array Strategy for Temporal-Graph Indexing
Temporal graphs represent vertexes and binary relations that change over time. In this paper we consider a temporal graph as a… 
Review
2013
Review
2013
Index Compression for Audio Fingerprinting Systems Based on Compressed Suffix Array
 Abstract—As one of most popular technologies, audio fingerprinting has recently attracted much attention in music retrieval… 
2013
2013
Indexing Genome with the External Construction of Compressed Suffix Tree Using LCP Array
We are proposing the genome indexing algorithm, which depends upon compressed form of suffix trees, in which every node has four… 
2012
2012
A Simple Introduction to Compressed Suffix Arrays
This document attempts to provide a simple introduction to a quite fun, and possibly-becominguseful full-text index structure… 
2010
2010
Parallel and Distributed Compressed Indexes
We study parallel and distributed compressed indexes. Compressed indexes are a new and functional way to index text strings. They… 
2008
2008
Compressed Suffix Array
2008
2008
Search Engine Technology Based on Compressed Suffix Array
The core module of search engines,namely indexer,is usually based on inverted file.But this solution to solve phrase-search is in… 
2007
2007
Comparisons of Practical Performance for Constructing Compressed Suffix Arrays
Suffix arrays, fundamental full-text index data structures, can be efficiently used where patterns are queried many times… 
2004
2004
Entropy-Compressed Indexes for Multidimensional Pattern Matching
In this talk, we will discuss the challenges involved in developing a multidimensional generalizations of compressed text… 
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)