On maximal repeats in strings
type: Item
instance of: scholarly article
title: On maximal repeats in strings
zbMATH Open document ID: 1032.68066
DOI: 10.1016/S0020-0190(01)00152-1
published in: Information Processing Letters
publication date: 2002-07-14T00:00:00Z
Mathematics Subject Classification ID: 68P05
zbMATH DE Number: 1767164
zbMATH Keywords: Information processing
zbMATH Keywords: Data structures
zbMATH Keywords: Maximal repeats
zbMATH Keywords: Compact suffix automaton
author: Mathieu Raffinot
MaRDI profile type: Publication
cites work: Complete inverted files for efficient text retrieval and analysis
cites work: Average sizes of suffix trees and DAWGs
cites work: Q3024804
cites work: Algorithms on Strings, Trees and Sequences
cites work: On-line construction of suffix trees
description: scientific article; zbMATH DE number 1767164