Time-space trade-offs for longest common extensions (Q2442815): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Efficient string matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Palindrome complexity. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster algorithms for string matching with k mismatches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-Space Trade-Offs for Longest Common Extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding all periods and initial palindromes of a string in parallel / rank
 
Normal rank
Property / cites work
 
Property / cites work: On space efficient two dimensional range minimum data structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quorums from difference covers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate String Matching: A Simpler Faster Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4038677 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space efficient search for maximal repetitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms on Strings, Trees and Sequences / 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: Fast Algorithms for Finding Nearest Common Ancestors / rank
 
Normal rank
Property / cites work
 
Property / cites work: The longest common extension problem revisited and applications to approximate string searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: The derivation of on-line algorithms, with an application to finding palindromes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear work suffix array construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient randomized pattern-matching algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Searching for Gapped Palindromes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incremental String Comparison / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast parallel and serial approximate string matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(n log n) algorithm for finding all repetitions in a string / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Linear-Time ``On-Line'' Algorithm for Finding the Smallest Initial Palindrome of a String / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms to compute compressed longest common substrings and compressed palindromes / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O(ND)\) difference algorithm and its variations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space-Time Tradeoffs for Longest-Common-Prefix Array Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniform deterministic dictionaries / rank
 
Normal rank

Revision as of 12:37, 7 July 2024

scientific article
Language Label Description Also known as
English
Time-space trade-offs for longest common extensions
scientific article

    Statements

    Time-space trade-offs for longest common extensions (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    1 April 2014
    0 references
    longest common extension
    0 references
    approximate string matching
    0 references
    palindrome
    0 references
    tandem repeat
    0 references
    time-space trade-off
    0 references
    0 references
    0 references

    Identifiers