ScholarLens Back to search
1996•Information Processing LettersRequires access

A time and space efficient data structure for string searching on large texts

Livio Colussi, Alessia De Col

Open publisher page 27 citations

Abstract

This record does not include an abstract. Use the full-text link above if available.

About this research paper

What this paper is about

An abstract is not available in the OpenAlex record for this paper.

Why it matters

OpenAlex reports 27 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Key concepts: Generalized suffix tree, Compressed suffix array, Suffix, Suffix tree, Suffix array, Data structure, String (physics), Computer science

Related papers

Related paper 1Related paper 2
Back to paper searchBrowse research topicsOriginal source
A time and space efficient data structure for string searching on large texts — Research Paper | ScholarLens