The longest common extension problem revisited and applications to approximate string searching (Q616995): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4508365 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive Star-Tree Parallel Data Structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5834367 / 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: 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: Q4449231 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4547749 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing suffix arrays in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space efficient linear time construction of suffix arrays / 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: Suffix Arrays: A New Method for On-Line String Searches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Engineering a lightweight suffix array construction algorithm / 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: Linear Time Suffix Array Construction Using D-Critical Substrings / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Finding Lowest Common Ancestors: Simplification and Parallelization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for approximate string matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding approximate patterns in strings / rank
 
Normal rank

Revision as of 16:03, 3 July 2024

scientific article
Language Label Description Also known as
English
The longest common extension problem revisited and applications to approximate string searching
scientific article

    Statements

    The longest common extension problem revisited and applications to approximate string searching (English)
    0 references
    0 references
    0 references
    0 references
    20 January 2011
    0 references
    longest common extension
    0 references
    approximate string search
    0 references
    Landau-Vishkin algorithm
    0 references
    Ukkonen's cutoff algorithm
    0 references

    Identifiers