Fast linear-space computations of longest common subsequences
From MaRDI portal
Recommendations
- Longest common subsequence in sublinear space
- An almost-linear time and linear space algorithm for the longest common subsequence problem
- A new practical linear space algorithm for the longest common subsequence problem
- A linear space algorithm for the LCS problem
- The longest common subsequence problem revisited
Cites work
- 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 representation for linear lists with movable fingers
- Algorithms for the Longest Common Subsequence Problem
- An \(O(ND)\) difference algorithm and its variations
- Bounds on the Complexity of the Longest Common Subsequence Problem
- Fast linear-space computations of longest common subsequences
- scientific article; zbMATH DE number 3887059 (Why is no real title available?)
- scientific article; zbMATH DE number 3867330 (Why is no real title available?)
- Improving the worst-case performance of the Hunt-Szymanski strategy for the longest common subsequence of two strings
- The longest common subsequence problem revisited
- The String-to-String Correction Problem
Cited in
(31)- An almost-linear time and linear space algorithm for the longest common subsequence problem
- New algorithms for the LCS problem
- The longest common subsequence problem revisited
- Fast linear-space computations of longest common subsequences
- Simple and fast linear space computation of longest common subsequences
- A fast and practical bit-vector algorithm for the longest common subsequence problem
- Efficient merged longest common subsequence algorithms for similar sequences
- A space efficient algorithm for the longest common subsequence in \(k\)-length substrings
- Finding least-weight subsequences with fewer processors
- Longest common subsequence in sublinear space
- scientific article; zbMATH DE number 1617276 (Why is no real title available?)
- A versatile divide and conquer technique for optimal string alignment
- New tabulation and sparse dynamic programming based techniques for sequence similarity problems
- A new practical linear space algorithm for the longest common subsequence problem
- A fast longest common subsequence algorithm for similar strings
- Variants of constrained longest common subsequence
- APPLICATION-SPECIFIC ARRAY PROCESSORS FOR THE LONGEST COMMON SUBSEQUENCE PROBLEM OF THREE SEQUENCES ∗ †
- DERIVING A FAST SYSTOLIC ALGORITHM FOR THE LONGEST COMMON SUBSEQUENCE PROBLEM
- Sparse Dynamic Programming for Longest Common Subsequence from Fragments
- Multivariate fine-grained complexity of longest common subsequence
- Longest common subsequences
- Maximal common subsequence algorithms
- String Processing and Information Retrieval
- Fundamentals of Computation Theory
- Practical Performance of Space Efficient Data Structures for Longest Common Extensions.
- Linear-space S-table algorithms for the longest common subsequence problem
- The colored longest common prefix array computed via sequential scans
- A Scalable Approximation Algorithm for Weighted Longest Common Subsequence
- Computing longest common subsequence under Cartesian-tree matching model
- Subsequence matching and LCS under Cartesian-tree equivalence
- On the decoding error weight of one or two deletion channels
This page was built for publication: Fast linear-space computations of longest common subsequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1190449)
