ALGORITHMS FOR THE CONSTRAINED LONGEST COMMON SUBSEQUENCE PROBLEMS
From MaRDI portal
(Redirected from ALGORITHMS FOR THE CONSTRAINED LONGEST COMMON SUBSEQUENCE PROBLEMS)
Recommendations
- The constrained longest common subsequence problem
- A simple algorithm for the constrained sequence problems
- On the generalized constrained longest common subsequence problems
- Efficient algorithms for the longest common subsequence problem with sequential substring constraints
- scientific article; zbMATH DE number 6697960
Cites work
- A faster algorithm computing string edit distances
- A linear space algorithm for computing maximal common subsequences
- A simple algorithm for the constrained sequence problems
- Algorithms for the Longest Common Subsequence Problem
- The constrained longest common subsequence problem
- The String-to-String Correction Problem
Cited in
(40)- The constrained longest common subsequence problem
- Efficient algorithms for the longest common subsequence problem with sequential substring constraints
- 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
- Comparing incomplete sequences via longest common subsequence
- The substring inclusion constraint longest common subsequence problem can be solved in quadratic time
- A simple algorithm for the constrained sequence problems
- An efficient dynamic programming algorithm for the generalized LCS problem with multiple substring exclusive constraints
- On solving a generalized constrained longest common subsequence problem
- Fast Algorithms for Local Similarity Queries in Two Sequences
- scientific article; zbMATH DE number 6697960 (Why is no real title available?)
- Regular language constrained sequence alignment revisited
- A fast algorithm of constrained longest common subsequence
- Approximability of constrained LCS
- An algorithm for the constrained heaviest common subsequence problem
- The Constrained Longest Common Subsequence Problem for Degenerate Strings
- Constrained LCS: Hardness and Approximation
- A fast longest common subsequence algorithm for similar strings
- The constrained shortest common supersequence problem
- 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
- Approximability of constrained LCS
- Efficient polynomial-time algorithms for the constrained LCS problem with strings exclusion
- On the generalized constrained longest common subsequence problems
- Bit-parallel algorithm for the constrained longest common subsequence problem
- Approximating longest common subsequence in linear time: beating the \(\sqrt{n}\) barrier
- Tight conditional lower bounds for longest common increasing subsequence
- An algorithm and applications to sequence alignment with weighted constraints
- Constrained sequence analysis algorithms in computational biology
- A learning algorithm for the longest common subsequence problem
- String editing under pattern constraints
- The generalized constrained longest common subsequence in the run-length encoded format
- A new efficient algorithm for computing the longest common subsequence
- Dynamic programming algorithms for the mosaic longest common subsequence problem
- Regular expression constrained sequence alignment
- Algorithms for computing variants of the longest common subsequence problem
- New efficient algorithms for the LCS and constrained LCS problems
- Finite automata based algorithms on subsequences and supersequences of degenerate strings
This page was built for publication: ALGORITHMS FOR THE CONSTRAINED LONGEST COMMON SUBSEQUENCE PROBLEMS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5714657)
