Algorithms and combinatorial properties on shortest unique palindromic substrings (Q1711666): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Diverse Palindromic Factorization Is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4508365 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing longest previous factor in linear time and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Episturmian words and some constructions of de Luca and Rauzy / rank
 
Normal rank
Property / cites work
 
Property / cites work: A subquadratic algorithm for minimum palindromic factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Palindromic richness / 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: In-place algorithms for exact and approximate shortest unique substring problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Palindromic Factorizations and Palindromic Covers On-line / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest Unique Substring Query Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear work suffix array construction / 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: 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: Shortest Unique Substring Queries on Run-Length Encoded Strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting Palindromes in Substrings / 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: Shortest Unique Substrings Queries in Optimal Time / rank
 
Normal rank

Revision as of 22:43, 17 July 2024

scientific article
Language Label Description Also known as
English
Algorithms and combinatorial properties on shortest unique palindromic substrings
scientific article

    Statements

    Algorithms and combinatorial properties on shortest unique palindromic substrings (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    18 January 2019
    0 references
    string algorithm
    0 references
    shortest unique substring (SUS)
    0 references
    palindrome
    0 references
    rich word
    0 references

    Identifiers