Fast algorithm for partial covers in words (Q493243): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q59408430, #quickstatements; #temporary_batch_1711486624475
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Efficient detection of quasiperiodicities in strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data structures and algorithms for the string statistics problem / rank
 
Normal rank
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: Q2723969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737203 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Merging Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Jewels of Stringology / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms on Strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Repetitions in strings: algorithms and combinatorics / 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: Enhanced string covering / rank
 
Normal rank
Property / cites work
 
Property / cites work: How many squares can a string contain? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time algorithms for finding and representing all the tandem repeats in a string / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the upper envelope of n line segments in O(n log n) time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering a string / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear-Time Algorithm for Seeds Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cross-Document Pattern Matching / 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: An optimal algorithm to compute all the covers of a string / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line construction of suffix trees / rank
 
Normal rank

Latest revision as of 16:56, 10 July 2024

scientific article
Language Label Description Also known as
English
Fast algorithm for partial covers in words
scientific article

    Statements

    Fast algorithm for partial covers in words (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    3 September 2015
    0 references
    cover of a word
    0 references
    quasiperiodicity
    0 references
    suffix tree
    0 references

    Identifiers