Computing minimal and maximal suffixes of a substring (Q294952): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
(3 intermediate revisions by 2 users not shown) | |||
Property / author | |||
Property / author: Maxim A. Babenko / rank | |||
Property / author | |||
Property / author: Maxim A. Babenko / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2015.08.023 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1902630904 / rank | |||
Normal rank |
Revision as of 21:37, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Computing minimal and maximal suffixes of a substring |
scientific article |
Statements
Computing minimal and maximal suffixes of a substring (English)
0 references
16 June 2016
0 references
data structures
0 references
substring queries
0 references
lexicographic order
0 references
minimal suffix
0 references
maximal suffix
0 references