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…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2018

We suggest the usage of Fibonacci Codes instead of Elias' C γ code. The implementation requires 1.44 n H k+n+o(n) bits of space…

2016

Next generation sequencing technologies generate normous amount of short reads, which poses a significant computational challenge…

2014

Temporal graphs represent vertexes and binary relations that change over time. In this paper we consider a temporal graph as a…

2014

Compressed indices are important data structures in stringology. Compressed versions of many well-known data structures such as…

Review

2013

Review

2013

 Abstract—As one of most popular technologies, audio fingerprinting has recently attracted much attention in music retrieval…

2010

We study parallel and distributed compressed indexes. Compressed indexes are a new and functional way to index text strings. They…

2006

Recent advances in the asymptotic resource costs of pattern matching with compressed suffix arrays are attractive, but a key…

2005

The suffix array is a fundamental index data structure in string algorithms and bioinformatics, and the compressed suffix array…

2005

The compressed suffix array and the compressed suffix tree for a given string S are full-text index data structures occupying O…

2004

One of the most relevant succinct suffix array proposals in the literature is the Compressed Suffix Array (CSA) of Sadakane…