Palindrome pattern matching (Q390901): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Tomohiro I. / rank
Normal rank
 
Property / author
 
Property / author: Tomohiro I. / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W32 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68R15 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68T10 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6243785 / rank
 
Normal rank
Property / zbMATH Keywords
 
palindromes
Property / zbMATH Keywords: palindromes / rank
 
Normal rank
Property / zbMATH Keywords
 
pattern matching
Property / zbMATH Keywords: pattern matching / rank
 
Normal rank
Property / zbMATH Keywords
 
linear time algorithms
Property / zbMATH Keywords: linear time algorithms / rank
 
Normal rank
Property / zbMATH Keywords
 
border arrays
Property / zbMATH Keywords: border arrays / rank
 
Normal rank
Property / zbMATH Keywords
 
suffix trees
Property / zbMATH Keywords: suffix trees / rank
 
Normal rank
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.tcs.2012.01.047 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2174831371 / 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: Palindromic richness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Burrows-Wheeler transform and palindromic richness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Palindrome complexity. / 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: Total palindrome complexity of finite words / 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: 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: Parameterized pattern matching: Algorithms and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: New trie data structures which support very fast search operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Surpassing the information theoretic bound with fusion 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: Searching for gapped palindromes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding All Approximate Gapped Palindromes / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 05:35, 7 July 2024

scientific article
Language Label Description Also known as
English
Palindrome pattern matching
scientific article

    Statements

    Palindrome pattern matching (English)
    0 references
    0 references
    0 references
    0 references
    9 January 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    palindromes
    0 references
    pattern matching
    0 references
    linear time algorithms
    0 references
    border arrays
    0 references
    suffix trees
    0 references
    0 references