Compressed representations of sequences and full-text indexes

372 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

A four-stage algorithm for updating a Burrows-Wheeler transform (2009, methodology): “used for advanced compressed index structures [7, 8] that authorize approximate pattern matching, and therefore can be used by search engines.”
Near neighbor searching with K nearest references (2015, background): “There are several proposals in the literature [26,25, 20,7,8] that offer different space/time tradeoffs for representing an IoS.”
Compressed full-text indexes (2007, methodology): “Those sequences are handled with Lemma 6 [Ferragina et al. 2006].”