Computing longest palindromic substring after single-character or block-wise edits (Q2227497): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: EERTREE / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3120084479 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1901.10722 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Longest substring palindrome after edit / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster queries for longest substring palindrome after block edit / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel detection of all palindromes in 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: Counting distinct palindromes in a word in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding approximate palindromes in strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Searching for gapped palindromes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Longest Single-arm-gapped Palindromes in a String / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tighter bounds and optimal algorithms for all maximal \(\alpha\)-gapped repeats and palindromes. Finding all maximal \(\alpha\)-gapped repeats and palindromes in optimal worst case time on integer alphabets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Palindromic Decompositions with Gaps and Errors / 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: Algorithms on Strings, Trees and Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: EERTREE: an efficient data structure for processing palindromes in strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2965480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight Tradeoffs for Real-Time Approximation of Longest Palindromes in Streams. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Longest Common Factor After One Edit Operation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Heaviest Induced Ancestors Problem Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Longest Lyndon Substring After Edit / rank
 
Normal rank
Property / cites work
 
Property / cites work: Repetition Detection in a Dynamic 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: On Finding Lowest Common Ancestors: Simplification and Parallelization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4508365 / 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: Suffix Arrays: A New Method for On-Line String Searches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding level-ancestors in trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The level ancestor problem simplified / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic LCA Queries on Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line construction of suffix trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Detecting regularities on grammar-compressed strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pal k is Linear Recognizable Online / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:52, 24 July 2024

scientific article
Language Label Description Also known as
English
Computing longest palindromic substring after single-character or block-wise edits
scientific article

    Statements

    Computing longest palindromic substring after single-character or block-wise edits (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    15 February 2021
    0 references
    palindromes
    0 references
    string algorithms
    0 references
    periodicity
    0 references
    0 references
    0 references

    Identifiers