Data structures and algorithms for the string statistics problem (Q1913702): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4091421 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3690245 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Optimal off-line detection of repetitions in a string / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Structural properties of the string statistics problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Squares, cubes, and time-space efficient string searching / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The equation \(a_ M=b^ Nc^ P\) in a free group / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Space-Economical Suffix Tree Construction Algorithm / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 12:23, 24 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Data structures and algorithms for the string statistics problem |
scientific article |
Statements
Data structures and algorithms for the string statistics problem (English)
0 references
27 May 1996
0 references
minimal augmented suffix
0 references