Efficient retrieval of approximate palindromes in a run-length encoded string (Q428850): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4763432 / 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: Q5452284 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequence comparison. Theory and methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fully Compressed Algorithm for Computing the Edit Distance of Run-Length Encoded Strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness of comparing two run-length encoded strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: String matching in Lempel-Ziv compressed strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the sorting-complexity of suffix tree construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for Lempel-Ziv encoding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms on Strings, Trees and Sequences / 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: FINDING ALL APPROXIMATE GAPPED PALINDROMES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Pattern Matching in Strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4347161 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Searching for gapped palindromes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for finding the positions of all squares in a run-length encoded 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: Finding approximate palindromes in strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4063420 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the design of some systolic algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Palindrome recognition in real time by a multitape Turing machine / rank
 
Normal rank

Revision as of 09:00, 5 July 2024

scientific article
Language Label Description Also known as
English
Efficient retrieval of approximate palindromes in a run-length encoded string
scientific article

    Statements

    Efficient retrieval of approximate palindromes in a run-length encoded string (English)
    0 references
    0 references
    0 references
    0 references
    25 June 2012
    0 references
    palindrome
    0 references
    Hamming distance
    0 references
    run-length encoding
    0 references

    Identifiers