A fast algorithm for computing longest common subsequences

Cited in

(only showing first 100 items - show all)

On the inadequacy of tournament algorithms for the N-SCS problem
Computing a longest common subsequence for a set of strings
Efficient merged longest common subsequence algorithms for similar sequences
k-universality of regular languages revisited
Subsequence matching and analysis problems for formal languages
On locally Gabriel geometric graphs
Faster algorithms for computing longest common increasing subsequences
A sparse dynamic programming algorithm for alignment with non-overlapping inversions
FACC: a novel finite automaton based on cloud computing for the multiple longest common subsequences search
Searching subsequences
Efficient algorithms for the block edit problems
A fast algorithm for the longest-common-subsequence problem
The string merging problem
Circular permutation graph family with applications
On the Longest Common Parameterized Subsequence
Handling precedence constraints in scheduling problems by the sequence pair representation
A learning algorithm for the longest common subsequence problem
Efficient algorithms for finding a longest common increasing subsequence
Automatic error correction in flexion languages
A diagonal-based algorithm for the longest common increasing subsequence problem
A branch-and-cut approach to the repetition-free longest common subsequence problem
Polynomial-delay enumeration of maximal common subsequences
Fixed-parameter tractability results for feedback set problems in tournaments
Approximating longest common subsequence in linear time: beating the \(\sqrt{n}\) barrier
Computing longest Lyndon subsequences and longest common Lyndon subsequences
Finding longest increasing and common subsequences in streaming data
Two algorithms for LCS consecutive suffix alignment
Constrained sequence analysis algorithms in computational biology
Edit distance-based kernel functions for structural pattern classification
Tight conditional lower bounds for longest common increasing subsequence
scientific article; zbMATH DE number 7559139 (Why is no real title available?)
Computing a longest common subsequence that is almost increasing on sequences having no repeated elements
Tight conditional lower bounds for longest common increasing subsequence
Longest common subsequence with gap constraints
Constrained string editing
APPLICATION-SPECIFIC ARRAY PROCESSORS FOR THE LONGEST COMMON SUBSEQUENCE PROBLEM OF THREE SEQUENCES ∗ †
The generalized constrained longest common subsequence in the run-length encoded format
The longest almost increasing subsequence problem with sliding windows
Efficient algorithms for enumerating maximal common subsequences of two strings
Content-dependent chunking for differential compression, the local maximum approach
A new efficient algorithm for computing the longest common subsequence
The longest common subsequence problem for small alphabets in the word RAM model
An \(A^\ast\) search algorithm for the constrained longest common subsequence problem
The longest almost-increasing subsequence
Design and implementation of an efficient priority queue
A review of data mining applications in crime
A fast algorithm for computing a longest common increasing subsequence
A lower bound for the edit-distance problem under an arbitrary cost function
LCS Approximation via Embedding into Local Non-repetitive Strings
New efficient algorithms for the LCS and constrained LCS problems
Finding common structured patterns in linear graphs
Enumeration of maximal common subsequences between two strings
Fast and longest rollercoasters
The merged longest common increasing subsequence problem
New clique and independent set algorithms for circle graphs
Palindromic subsequence automata and longest common palindromic subsequence
Calcul de la distance par les sous-mots
A novel look-ahead optimization strategy for trie-based approximate string matching
An almost-linear time and linear space algorithm for the longest common subsequence problem
Fast algorithms for computing the constrained LCS of run-length encoded strings
A new practical linear space algorithm for the longest common subsequence problem
Improving the worst-case performance of the Hunt-Szymanski strategy for the longest common subsequence of two strings
The longest common subsequence problem revisited
Longest Common Subsequence with Gap Constraints
A data structure for substring-substring LCS length queries
Longest common subsequences
Computational geometry algorithms for the systolic screen
Fast linear-space computations of longest common subsequences
scientific article; zbMATH DE number 7561345 (Why is no real title available?)
On the longest common parameterized subsequence
Enumerating longest increasing subsequences and patience sorting
Order-preserving pattern matching with \(k\) mismatches
Fast approximate matching of words against a dictionary
Sparse LCS common substring alignment
Linear-space S-table algorithms for the longest common subsequence problem
The longest wave subsequence problem: generalizations of the longest increasing subsequence problem
An algorithm for matching run-length coded strings
A fast and simple algorithm for computing the longest common subsequence of run-length encoded strings
On the generalized constrained longest common subsequence problems
The Complexity of Problems in P Given Correlated Instances
Fast algorithms for computing tree LCS
Computing longest common subsequence under Cartesian-tree matching model
Subsequences in bounded ranges: matching and analysis problems
Finding the gapped longest common subsequence by incremental suffix maximum queries
LCS approximation via embedding into locally non-repetitive strings
Dynamic programming with convexity, concavity and sparsity
Fast Algorithms for Computing Tree LCS
A multiobjective optimization algorithm for the weighted LCS
New tabulation and sparse dynamic programming based techniques for sequence similarity problems
An efficient dynamic programming algorithm for the generalized LCS problem with multiple substring exclusive constraints
Data structures and algorithms for approximate string matching
An O(NP) sequence comparison algorithm
Space-efficient algorithms for longest increasing subsequence
A systolic array for the longest common subsequence problem
A divide and conquer approach and a work-optimal parallel algorithm for the LIS problem
Longest common subsequence between run-length-encoded strings: a new algorithm with improved parallelism
Efficient algorithms for the longest common subsequence in \(k\)-length substrings
Space-efficient algorithms for longest increasing subsequence
Maximum \(k\)-covering of weighted transitive graphs with applications
A large neighborhood search heuristic for the longest common subsequence problem

This page was built for publication: A fast algorithm for computing longest common subsequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4125781)