Generalized approximate regularities in strings (Q5451457): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Optimal superprimitivity testing for strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: An on-line string superprimitivity test / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the cover array in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: A work-time optimal algorithm for computing all string covers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering a string / rank
 
Normal rank
Property / cites work
 
Property / cites work: The subtree max gap problem with application to parallel string covering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the \(\lambda \)-covers of a string / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the λ-Seeds of a String / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate periods of strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5446122 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2723940 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal algorithm for computing the repetitions in a word / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal off-line detection of repetitions in a string / rank
 
Normal rank

Latest revision as of 20:16, 27 June 2024

scientific article; zbMATH DE number 5254523
Language Label Description Also known as
English
Generalized approximate regularities in strings
scientific article; zbMATH DE number 5254523

    Statements

    Generalized approximate regularities in strings (English)
    0 references
    0 references
    0 references
    0 references
    27 March 2008
    0 references
    0 references
    0 references
    0 references
    0 references
    minimum \(\lambda \)-cover problem
    0 references
    minimum \(\lambda \)-seed problem
    0 references
    \(\lambda \)-combinations
    0 references
    equivalence class
    0 references
    generalized approximate string regularities
    0 references
    0 references