<--- Back to Details
First PageDocument Content
Mathematics / Compressed suffix array / String / Entropy / Bit array / Suffix tree / Suffix array / Computing / Arrays / Computer programming
Date: 2003-04-12 12:02:32
Mathematics
Compressed suffix array
String
Entropy
Bit array
Suffix tree
Suffix array
Computing
Arrays
Computer programming

High-Order Entropy-Compressed Text Indexes Roberto Grossi∗

Add to Reading List

Source URL: www.di.unipi.it

Download Document from Source Website

File Size: 285,00 KB

Share Document on Facebook

Similar Documents

String computer science) / Linguistics / Formal languages / Computing / Dynamic programming / Approximate string matching / Pattern matching / Suffix tree / JaroWinkler distance / String metric / String / Comparison of programming languages

Surname identification and correction in a corpus of forename surname dataset Suresh Veluru, Yogachandran Rahulamathavan, and Muttukrishnan Rajarajan Information Security Group, School of Engineering and Mathematical Sci

DocID: 1rk7H - View Document

Dynamic programming / Maximal pair / String / String searching algorithm / Approximate string matching / Suffix tree / Mathematics / Computing / Computer programming / LCP array

A PATTERN EXTRACTION ALGORITHM FOR ABSTRACT MELODIC REPRESENTATIONS THAT ALLOW PARTIAL OVERLAPPING OF INTERVALLIC CATEGORIES Emilios Cambouropoulos1 , Maxime Crochemore2,3 , Costas Iliopoulos3 , Manal Mohamed3 , Marie-Fr

DocID: 1rgdB - View Document

Computing / String computer science) / Formal languages / Mathematics / Geostatistics / Kernel method / Suffix tree / String kernel / Entropy / String / Kernel / Regular expression

KERNELS AND SIMILARITY MEASURES FOR TEXT CLASSIFICATION Andr´e T. Martins Priberam Inform´atica, and Instituto de Telecomunicac¸o˜ es Instituto Superior T´ecnico,

DocID: 1rg2P - View Document

Arrays / Mathematical analysis / Mathematics / Suffix array / Suffix tree / Interval / Structure / Measure theory / LCP array

CSE 584A Class 14 Jeremy Buhler March 9, 2016 The BWT is sufficient for simple pattern matching, but can it do more?

DocID: 1rbeK - View Document

Theory of computation / Dynamic programming / Maximal pair / String / Mathematics / String searching algorithm / Suffix tree / Approximate string matching / Time complexity / Algorithm / Computer science

doi:j.ins

DocID: 1r4I2 - View Document