We propose a new linear-size data structure which provides a fast access to all palindromic substrings of a string or a set of strings. This structure inherits some ideas from the construction of both the suffix trie and suffix tree. Using this structure, we present simple and efficient solutions for a number of problems involving palindromes. © 2017 Elsevier Lt
We revisit the classic algorithmic problem of computing a longest palidromic substring. This problem...
Given a string s of length n over a general alphabet and an integer k, the problem is to decide whet...
A palindrome is a string that reads the same as its reverse, such as "aibohphobia" (fear of palindro...
We propose a new linear-size data structure which provides a fast access to all palindromic substrin...
Palindromic length of a string is the minimum number of palindromes whose concatenation is equal to ...
Palindromic length of a string is the minimum number of palindromes whose concatenation is equal to ...
A palindrome is defined as a string which reads forwards the same as backwards, like, for example, t...
AbstractIn this paper, we study the palindrome retrieval problem with the input string compressed in...
AbstractThis paper presents two efficient concurrent-read concurrent-write parallel algorithms that ...
Palindromes are important objects in strings which have been extensively studied from combinatorial,...
This paper presents two efficient concurrent-read concurrent-write parallel algorithms that find all...
It is known that the length of the longest substring palindromes (LSPals) of a given string T of len...
Part 3: MHDWInternational audienceA string is called a palindrome if it reads the same from left to ...
This paper presents two efficient concurrent-read concurrent-write parallel algorithms that find all...
[[abstract]]Palindromes are strings of symbols that read the same forward and backward. Palindromes ...
We revisit the classic algorithmic problem of computing a longest palidromic substring. This problem...
Given a string s of length n over a general alphabet and an integer k, the problem is to decide whet...
A palindrome is a string that reads the same as its reverse, such as "aibohphobia" (fear of palindro...
We propose a new linear-size data structure which provides a fast access to all palindromic substrin...
Palindromic length of a string is the minimum number of palindromes whose concatenation is equal to ...
Palindromic length of a string is the minimum number of palindromes whose concatenation is equal to ...
A palindrome is defined as a string which reads forwards the same as backwards, like, for example, t...
AbstractIn this paper, we study the palindrome retrieval problem with the input string compressed in...
AbstractThis paper presents two efficient concurrent-read concurrent-write parallel algorithms that ...
Palindromes are important objects in strings which have been extensively studied from combinatorial,...
This paper presents two efficient concurrent-read concurrent-write parallel algorithms that find all...
It is known that the length of the longest substring palindromes (LSPals) of a given string T of len...
Part 3: MHDWInternational audienceA string is called a palindrome if it reads the same from left to ...
This paper presents two efficient concurrent-read concurrent-write parallel algorithms that find all...
[[abstract]]Palindromes are strings of symbols that read the same forward and backward. Palindromes ...
We revisit the classic algorithmic problem of computing a longest palidromic substring. This problem...
Given a string s of length n over a general alphabet and an integer k, the problem is to decide whet...
A palindrome is a string that reads the same as its reverse, such as "aibohphobia" (fear of palindro...
DOI
Add to ORKG