On the generalized constrained longest common subsequence problems
From MaRDI portal
Recommendations
- The constrained longest common subsequence problem
- ALGORITHMS FOR THE CONSTRAINED LONGEST COMMON SUBSEQUENCE PROBLEMS
- Efficient algorithms for the longest common subsequence problem with sequential substring constraints
- A simple algorithm for the constrained sequence problems
- An efficient dynamic programming algorithm for the generalized LCS problem with multiple substring exclusive constraints
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 New Efficient Algorithm for Computing the Longest Common Subsequence
- A simple algorithm for the constrained sequence problems
- ALGORITHMS FOR THE CONSTRAINED LONGEST COMMON SUBSEQUENCE PROBLEMS
- Algorithms for the Longest Common Subsequence Problem
- Algorithms on Strings, Trees and Sequences
- Bounds on the Complexity of the Longest Common Subsequence Problem
- Constrained LCS: Hardness and Approximation
- Design and implementation of an efficient priority queue
- Exemplar Longest Common Subsequence
- scientific article; zbMATH DE number 1557065 (Why is no real title available?)
- New efficient algorithms for the LCS and constrained LCS problems
- Preserving order in a forest in less than logarithmic time and linear space
- Sequence comparison. Theory and methods
- The Complexity of Some Problems on Subsequences and Supersequences
- The constrained longest common subsequence problem
- The longest common subsequence problem revisited
- The String-to-String Correction Problem
Cited in
(39)- The constrained longest common subsequence problem
- A simple algorithm for solving for the generalized longest common subsequence (LCS) problem with a substring exclusion constraint
- A\textsuperscript{*}-based compilation of relaxed decision diagrams for the longest common subsequence problem
- A data structure for substring-substring LCS length queries
- Computing the longest common almost-increasing subsequence
- An \(A^\ast\) search algorithm for the constrained longest common subsequence problem
- Finding the gapped longest common subsequence by incremental suffix maximum queries
- Tight conditional lower bounds for longest common increasing subsequence
- Maximal common subsequence algorithms
- A space efficient algorithm for the longest common subsequence in \(k\)-length substrings
- The substring inclusion constraint longest common subsequence problem can be solved in quadratic time
- A simple algorithm for the constrained sequence problems
- A dynamic programming solution to a generalized LCS problem
- An efficient dynamic programming algorithm for the generalized LCS problem with multiple substring exclusive constraints
- Solving longest common subsequence problems via a transformation to the maximum clique problem
- On solving a generalized constrained longest common subsequence problem
- LCSk: a refined similarity measure
- scientific article; zbMATH DE number 6697960 (Why is no real title available?)
- A multiobjective optimization algorithm for the weighted LCS
- Faster STR-EC-LCS computation
- The Constrained Longest Common Subsequence Problem for Degenerate Strings
- Exemplar Longest Common Subsequence
- Algorithms for two versions of LCS problem for indeterminate strings
- Variants of constrained longest common subsequence
- Fast algorithms for computing the constrained LCS of run-length encoded strings
- Quadratic-time algorithm for a string constrained LCS problem
- Doubly-constrained LCS and hybrid-constrained LCS problems revisited
- Approximability of constrained LCS
- Efficient polynomial-time algorithms for the constrained LCS problem with strings exclusion
- Tight conditional lower bounds for longest common increasing subsequence
- Maximal common subsequence algorithms
- Constrained sequence analysis algorithms in computational biology
- Algorithms for Computing Variants of the Longest Common Subsequence Problem
- ALGORITHMS FOR THE CONSTRAINED LONGEST COMMON SUBSEQUENCE PROBLEMS
- Space-efficient STR-IC-LCS computation
- Faster space-efficient STR-IC-LCS computation
- String editing under pattern constraints
- The generalized constrained longest common subsequence in the run-length encoded format
- Efficient algorithms for enumerating maximal common subsequences of two strings
This page was built for publication: On the generalized constrained longest common subsequence problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q491203)
