Palindrome pattern matching (Q390901): Difference between revisions

@@ Property / DOI @@
-.1016/j.tcs.2012.01.047
@@ Property / DOI: 10.1016/j.tcs.2012.01.047 / rank @@
-Normal rank
@@ Property / author @@
-Tomohiro I.
@@ Property / author: Tomohiro I. / rank @@
-Normal rank
@@ Property / author @@
+Tomohiro I.
@@ Property / author: Tomohiro I. / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2012.01.047
+Normal rank
@@ Property / OpenAlex ID @@
+W2174831371
@@ Property / OpenAlex ID: W2174831371 / rank @@
+Normal rank
@@ Property / cites work @@
+Episturmian words and some constructions of de Luca and Rauzy
+Normal rank
@@ Property / cites work @@
+Palindromic richness
@@ Property / cites work: Palindromic richness / rank @@
+Normal rank
@@ Property / cites work @@
+Burrows-Wheeler transform and palindromic richness
+Normal rank
@@ Property / cites work @@
+Palindrome complexity.
@@ Property / cites work: Palindrome complexity. / rank @@
+Normal rank
@@ Property / cites work @@
+ON THE PALINDROMIC COMPLEXITY OF INFINITE WORDS
@@ Property / cites work: ON THE PALINDROMIC COMPLEXITY OF INFINITE WORDS / rank @@
+Normal rank
@@ Property / cites work @@
+Total palindrome complexity of finite words
@@ Property / cites work: Total palindrome complexity of finite words / rank @@
+Normal rank
@@ Property / cites work @@
+Counting distinct palindromes in a word in linear time
+Normal rank
@@ Property / cites work @@
+A New Linear-Time ``On-Line'' Algorithm for Finding the Smallest Initial Palindrome of a String
+Normal rank
@@ Property / cites work @@
+Algorithms on Strings, Trees and Sequences
@@ Property / cites work: Algorithms on Strings, Trees and Sequences / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized pattern matching: Algorithms and applications
+Normal rank
@@ Property / cites work @@
+New trie data structures which support very fast search operations
+Normal rank
@@ Property / cites work @@
+Surpassing the information theoretic bound with fusion trees
+Normal rank
@@ Property / cites work @@
+On-line construction of suffix trees
@@ Property / cites work: On-line construction of suffix trees / rank @@
+Normal rank
@@ Property / cites work @@
+Searching for gapped palindromes
@@ Property / cites work: Searching for gapped palindromes / rank @@
+Normal rank
@@ Property / cites work @@
+Finding All Approximate Gapped Palindromes
@@ Property / cites work: Finding All Approximate Gapped Palindromes / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.TCS.2012.01.047
@@ Property / DOI: 10.1016/J.TCS.2012.01.047 / rank @@
+Normal rank