DERIVING A FAST SYSTOLIC ALGORITHM FOR THE LONGEST COMMON SUBSEQUENCE PROBLEM (Q4532713): Difference between revisions

@@ 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.1080/10637190208941431
+Normal rank
@@ Property / OpenAlex ID @@
+W2002271010
@@ Property / OpenAlex ID: W2002271010 / rank @@
+Normal rank
@@ Property / cites work @@
+Bounds on the Complexity of the Longest Common Subsequence Problem
+Normal rank
@@ Property / cites work @@
+Fast linear-space computations of longest common subsequences
+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 @@
+A linear space algorithm for computing maximal common subsequences
+Normal rank
@@ Property / cites work @@
+Algorithms for the Longest Common Subsequence Problem
+Normal rank
@@ Property / cites work @@
+A linear space algorithm for the LCS problem
@@ Property / cites work: A linear space algorithm for the LCS problem / rank @@
+Normal rank
@@ Property / cites work @@
+A faster linear systolic algorithm for recovering a longest common subsequence
+Normal rank
@@ Property / cites work @@
+An efficient systolic algorithm for the longest common subsequence problem
+Normal rank
@@ Property / cites work @@
+A longest common subsequence algorithm suitable for similar text strings
+Normal rank
@@ Property / cites work @@
+A systolic array for the longest common subsequence problem
+Normal rank
@@ Property / cites work @@
+Q4509227
@@ Property / cites work: Q4509227 / rank @@
+Normal rank
@@ Property / cites work @@
+The String-to-String Correction Problem
@@ Property / cites work: The String-to-String Correction Problem / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:4532713