Counting distinct palindromes in a word in linear time (Q407601): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ipl.2010.07.018 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1972084722 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q96738845 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Palindrome complexity. / 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: Q3077342 / 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 THE PALINDROMIC COMPLEXITY OF INFINITE WORDS / 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: Sturmian words: structure, combinatorics, and their arithmetics / 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: Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Palindrome recognition in real time by a multitape Turing machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Episturmian words: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Palindromic richness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms on Strings, Trees and Sequences / 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: Burrows-Wheeler transform and palindromic richness / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 01:18, 5 July 2024

scientific article
Language Label Description Also known as
English
Counting distinct palindromes in a word in linear time
scientific article

    Statements

    Counting distinct palindromes in a word in linear time (English)
    0 references
    0 references
    0 references
    0 references
    27 March 2012
    0 references
    0 references
    palindrome
    0 references
    palindromic richness
    0 references
    palindromic fullness
    0 references
    0 references
    0 references