Computing minimal and maximal suffixes of a substring (Q294952): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Maxim A. Babenko / rank
Normal rank
 
Property / author
 
Property / author: Maxim A. Babenko / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W32 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68P05 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6594187 / rank
 
Normal rank
Property / zbMATH Keywords
 
data structures
Property / zbMATH Keywords: data structures / rank
 
Normal rank
Property / zbMATH Keywords
 
substring queries
Property / zbMATH Keywords: substring queries / rank
 
Normal rank
Property / zbMATH Keywords
 
lexicographic order
Property / zbMATH Keywords: lexicographic order / rank
 
Normal rank
Property / zbMATH Keywords
 
minimal suffix
Property / zbMATH Keywords: minimal suffix / rank
 
Normal rank
Property / zbMATH Keywords
 
maximal suffix
Property / zbMATH Keywords: maximal suffix / 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
Property / cites work
 
Property / cites work: Simple real-time constant-space string matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factorizing words over an ordered alphabet / rank
 
Normal rank
Property / cites work
 
Property / cites work: Free differential calculus. IV: The quotient groups of the lower central series / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4508365 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921685 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized substring compression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Internal Pattern Matching Queries in a Text and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extracting powers and periods in a word from its runs structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Range LCP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Range LCP Queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Wavelet Trees Meet Suffix Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms on Strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniqueness Theorems for Periodic Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4547749 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Surpassing the information theoretic bound with fusion trees / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 04:51, 12 July 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
    0 references
    0 references
    0 references
    0 references
    0 references
    16 June 2016
    0 references
    0 references
    data structures
    0 references
    substring queries
    0 references
    lexicographic order
    0 references
    minimal suffix
    0 references
    maximal suffix
    0 references
    0 references