A new practical linear space algorithm for the longest common subsequence problem
From MaRDI portal
(Redirected from Publication:3143773)
Recommendations
Cites work
- A decomposition theorem for partially ordered sets
- A fast algorithm for computing longest common subsequences
- A faster algorithm computing string edit distances
- A linear space algorithm for computing maximal common subsequences
- A linear space algorithm for the LCS problem
- A longest common subsequence algorithm suitable for similar text strings
- A Sentence-to-Sentence Clustering Procedure for Pattern Analysis
- Algorithms for approximate string matching
- Algorithms for the Longest Common Subsequence Problem
- An \(O(ND)\) difference algorithm and its variations
- An Extension of the String-to-String Correction Problem
- An O(NP) sequence comparison algorithm
- Bounds for the String Editing Problem
- Bounds on the Complexity of the Longest Common Subsequence Problem
- Fast linear-space computations of longest common subsequences
- scientific article; zbMATH DE number 30301 (Why is no real title available?)
- scientific article; zbMATH DE number 3557227 (Why is no real title available?)
- scientific article; zbMATH DE number 1516705 (Why is no real title available?)
- scientific article; zbMATH DE number 842125 (Why is no real title available?)
- scientific article; zbMATH DE number 1414290 (Why is no real title available?)
- Improving the worst-case performance of the Hunt-Szymanski strategy for the longest common subsequence of two strings
- Longest common subsequences of two random sequences
- New algorithms for the LCS problem
- On finding minimal length superstrings
- Some limit results for longest common subsequences
- The Complexity of Some Problems on Subsequences and Supersequences
- The longest common subsequence problem revisited
- The String-to-String Correction Problem
- Tree Systems for Syntactic Pattern Recognition
Cited in
(11)- New algorithms for the LCS problem
- A linear space algorithm for the LCS problem
- Fast linear-space computations of longest common subsequences
- A fast and practical bit-vector algorithm for the longest common subsequence problem
- An efficient algorithm for LCS problem between two arbitrary sequences
- A linear-space algorithm for the substring constrained alignment problem
- A space efficient algorithm for the longest common subsequence in \(k\)-length substrings
- scientific article; zbMATH DE number 842125 (Why is no real title available?)
- A New Efficient Algorithm for Computing the Longest Common Subsequence
- Linear-space S-table algorithms for the longest common subsequence problem
- A new efficient algorithm for computing the longest common subsequence
This page was built for publication: A new practical linear space algorithm for the longest common subsequence problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3143773)
