Linear-space S-table algorithms for the longest common subsequence problem

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
New tabulation and sparse dynamic programming based techniques for sequence similarity problems
Fast algorithms for computing the constrained LCS of run-length encoded strings
Efficient polynomial-time algorithms for the constrained LCS problem with strings exclusion
On a cyclic string-to-string correction problem
The constrained longest common subsequence problem
Sparse LCS common substring alignment
A linear-time algorithm for a special case of disjoint set union
Geometric applications of a matrix-searching algorithm
A fast and practical bit-vector algorithm for the longest common subsequence problem
Efficient merged longest common subsequence algorithms for similar sequences
Efficient algorithms for the longest common subsequence problem with sequential substring constraints
A bit-string longest-common-subsequence algorithm
Efficient algorithms for finding interleaving relationship between sequences
A simple algorithm for the constrained sequence problems
Two algorithms for LCS consecutive suffix alignment
On the Common Substring Alignment Problem
A linear space algorithm for computing maximal common subsequences
Efficiency of a Good But Not Linear Set Union Algorithm
A fast algorithm for computing longest common subsequences
Algorithms for the Longest Common Subsequence Problem
All Highest Scoring Paths in Weighted Grid Graphs and Their Application to Finding All Approximate Repeats in Strings
Incremental String Comparison
The String-to-String Correction Problem
A Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices
AN ALGORITHM AND APPLICATIONS TO SEQUENCE ALIGNMENT WITH WEIGHTED CONSTRAINTS

This page was built for publication: Linear-space S-table algorithms for the longest common subsequence problem