On finding a longest common palindromic subsequence (Q1698702): Difference between revisions

@@ Property / cites work @@
+Parallel detection of all palindromes in a string
@@ Property / cites work: Parallel detection of all palindromes in a string / rank @@
+Normal rank
@@ Property / cites work @@
+Bounds on the Complexity of the Longest Common Subsequence Problem
+Normal rank
@@ Property / cites work @@
+Computing Longest Common Substrings Via Suffix Arrays
+Normal rank
@@ Property / cites work @@
+Computing a Longest Common Palindromic Subsequence
+Normal rank
@@ Property / cites work @@
+Q4432974
@@ Property / cites work: Q4432974 / rank @@
+Normal rank
@@ Property / cites work @@
+Longest common subsequences of two random sequences
+Normal rank
@@ Property / cites work @@
+BIT-PARALLEL ALGORITHMS FOR THE MERGED LONGEST COMMON SUBSEQUENCE PROBLEM
+Normal rank
@@ Property / cites work @@
+Algorithms for the Longest Common Subsequence Problem
+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 @@
+Expected length of the longest common subsequence for large alphabets
+Normal rank
@@ Property / cites work @@
+String Processing and Information Retrieval
@@ Property / cites work: String Processing and Information Retrieval / rank @@
+Normal rank
@@ Property / cites work @@
+A New Linear-Time ``On-Line'' Algorithm for Finding the Smallest Initial Palindrome of a String
+Normal rank