A simple algorithm for the constrained sequence problems
From MaRDI portal
Publication:2390246
DOI10.1016/j.ipl.2004.02.008zbMath1175.90400arXiv2103.02919MaRDI QIDQ2390246
Publication date: 21 July 2009
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2103.02919
Related Items
Unnamed Item, Unnamed Item, BIT-PARALLEL ALGORITHMS FOR THE MERGED LONGEST COMMON SUBSEQUENCE PROBLEM, AN ALGORITHM AND APPLICATIONS TO SEQUENCE ALIGNMENT WITH WEIGHTED CONSTRAINTS, Maximal Common Subsequence Algorithms, ALGORITHMS FOR THE CONSTRAINED LONGEST COMMON SUBSEQUENCE PROBLEMS, Linear-space S-table algorithms for the longest common subsequence problem, Space-efficient STR-IC-LCS computation, Constrained pairwise and center-star sequences alignment problems, The constrained shortest common supersequence problem, Variants of constrained longest common subsequence, On the parameterized complexity of the repetition free longest common subsequence problem, Fast algorithms for computing the constrained LCS of run-length encoded strings, Approximability of constrained LCS, Efficient polynomial-time algorithms for the constrained LCS problem with strings exclusion, On the generalized constrained longest common subsequence problems, Constrained sequence analysis algorithms in computational biology, Regular expression constrained sequence alignment, New efficient algorithms for the LCS and constrained LCS problems, Finite automata based algorithms on subsequences and supersequences of degenerate strings, Computing the longest topological common subsequence of a symbol-wise totally ordered directed acyclic graph and a sequence, Sorting a permutation by best short swaps, A data structure for substring-substring LCS length queries, An \(A^\ast\) search algorithm for the constrained longest common subsequence problem, Tight conditional lower bounds for longest common increasing subsequence, Maximal common subsequence algorithms, Comparing incomplete sequences via longest common subsequence, The substring inclusion constraint longest common subsequence problem can be solved in quadratic time, Efficient algorithms for regular expression constrained sequence alignment, Efficient algorithms for finding interleaving relationship between sequences, RNA multiple structural alignment with longest common subsequences, A hardness result and new algorithm for the longest common palindromic subsequence problem, A dynamic programming solution to a generalized LCS problem, An efficient dynamic programming algorithm for the generalized LCS problem with multiple substring exclusive constraints, A hybrid genetic algorithm for the repetition free longest common subsequence problem, Fast Algorithms for Local Similarity Queries in Two Sequences, Faster STR-EC-LCS Computation, The Constrained Longest Common Subsequence Problem for Degenerate Strings, Constrained LCS: Hardness and Approximation
Cites Work
