The constrained longest common subsequence problem
From MaRDI portal
Publication:1029006
DOI10.1016/j.ipl.2003.07.001zbMath1175.90407OpenAlexW1999395788MaRDI QIDQ1029006
Publication date: 9 July 2009
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2003.07.001
Related Items (46)
Indeterminate string factorizations and degenerate text transformations ⋮ LCS\(k\): a refined similarity measure ⋮ The substring inclusion constraint longest common subsequence problem can be solved in quadratic time ⋮ A multiobjective optimization algorithm for the weighted LCS ⋮ Efficient algorithms for regular expression constrained sequence alignment ⋮ RNA multiple structural alignment with longest common subsequences ⋮ A simple algorithm for the constrained sequence problems ⋮ Computing the longest common almost-increasing subsequence ⋮ Solving longest common subsequence problems via a transformation to the maximum clique problem ⋮ An efficient algorithm for the longest common palindromic subsequence problem ⋮ The constrained shortest common supersequence problem ⋮ Fast Algorithms for Local Similarity Queries in Two Sequences ⋮ Variants of constrained longest common subsequence ⋮ The Constrained Longest Common Subsequence Problem for Degenerate Strings ⋮ Linear-space S-table algorithms for the longest common subsequence problem ⋮ Constrained LCS: Hardness and Approximation ⋮ Space-efficient STR-IC-LCS computation ⋮ 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 ⋮ A dynamic programming solution to a generalized LCS problem ⋮ An efficient dynamic programming algorithm for the generalized LCS problem with multiple substring exclusive constraints ⋮ Regular expression constrained sequence alignment ⋮ A hybrid genetic algorithm for the repetition free longest common subsequence problem ⋮ An \(A^\ast\) search algorithm for the constrained longest common subsequence problem ⋮ Algorithms for computing variants of the longest common subsequence problem ⋮ Faster STR-EC-LCS Computation ⋮ Regular Language Constrained Sequence Alignment Revisited ⋮ Efficient polynomial-time algorithms for the constrained LCS problem with strings exclusion ⋮ A simple algorithm for solving for the generalized longest common subsequence (LCS) problem with a substring exclusion constraint ⋮ On the generalized constrained longest common subsequence problems ⋮ ALGORITHMS FOR THE CONSTRAINED LONGEST COMMON SUBSEQUENCE PROBLEMS ⋮ Improvised divide and conquer approach for the LIS problem ⋮ Constrained sequence analysis algorithms in computational biology ⋮ BIT-PARALLEL ALGORITHMS FOR THE MERGED 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 ⋮ AN ALGORITHM AND APPLICATIONS TO SEQUENCE ALIGNMENT WITH WEIGHTED CONSTRAINTS ⋮ Tight conditional lower bounds for longest common increasing subsequence ⋮ A new efficient algorithm for computing the longest common subsequence ⋮ Unnamed Item ⋮ Maximal common subsequence algorithms ⋮ Comparing incomplete sequences via longest common subsequence ⋮ Maximal Common Subsequence Algorithms ⋮ A data structure for substring-substring LCS length queries
Cites Work
This page was built for publication: The constrained longest common subsequence problem
