Pages that link to "Item:Q2390246"
From MaRDI portal
The following pages link to A simple algorithm for the constrained sequence problems (Q2390246):
Displayed 39 items.
- Constrained pairwise and center-star sequences alignment problems (Q328691) (← links)
- The constrained shortest common supersequence problem (Q396654) (← links)
- Variants of constrained longest common subsequence (Q407588) (← links)
- On the parameterized complexity of the repetition free longest common subsequence problem (Q413298) (← links)
- Fast algorithms for computing the constrained LCS of run-length encoded strings (Q428842) (← links)
- Approximability of constrained LCS (Q439929) (← links)
- Efficient polynomial-time algorithms for the constrained LCS problem with strings exclusion (Q489728) (← links)
- On the generalized constrained longest common subsequence problems (Q491203) (← links)
- Constrained sequence analysis algorithms in computational biology (Q527151) (← links)
- Regular expression constrained sequence alignment (Q925058) (← links)
- New efficient algorithms for the LCS and constrained LCS problems (Q963324) (← links)
- Finite automata based algorithms on subsequences and supersequences of degenerate strings (Q972350) (← links)
- Computing the longest topological common subsequence of a symbol-wise totally ordered directed acyclic graph and a sequence (Q1029349) (← links)
- Sorting a permutation by best short swaps (Q2037101) (← links)
- A data structure for substring-substring LCS length queries (Q2118872) (← links)
- An \(A^\ast\) search algorithm for the constrained longest common subsequence problem (Q2224853) (← links)
- Tight conditional lower bounds for longest common increasing subsequence (Q2272597) (← links)
- Maximal common subsequence algorithms (Q2326405) (← links)
- Comparing incomplete sequences via longest common subsequence (Q2333802) (← links)
- The substring inclusion constraint longest common subsequence problem can be solved in quadratic time (Q2376791) (← links)
- Efficient algorithms for regular expression constrained sequence alignment (Q2379980) (← links)
- Efficient algorithms for finding interleaving relationship between sequences (Q2380070) (← links)
- RNA multiple structural alignment with longest common subsequences (Q2385486) (← links)
- A hardness result and new algorithm for the longest common palindromic subsequence problem (Q2410574) (← links)
- A dynamic programming solution to a generalized LCS problem (Q2445236) (← links)
- An efficient dynamic programming algorithm for the generalized LCS problem with multiple substring exclusive constraints (Q2447542) (← links)
- A hybrid genetic algorithm for the repetition free longest common subsequence problem (Q2450749) (← links)
- Fast Algorithms for Local Similarity Queries in Two Sequences (Q2949727) (← links)
- Faster STR-EC-LCS Computation (Q3297762) (← links)
- The Constrained Longest Common Subsequence Problem for Degenerate Strings (Q3503920) (← links)
- Constrained LCS: Hardness and Approximation (Q3506958) (← links)
- (Q5111874) (← links)
- Maximal Common Subsequence Algorithms (Q5140762) (← links)
- (Q5140779) (← links)
- BIT-PARALLEL ALGORITHMS FOR THE MERGED LONGEST COMMON SUBSEQUENCE PROBLEM (Q5168418) (← links)
- AN ALGORITHM AND APPLICATIONS TO SEQUENCE ALIGNMENT WITH WEIGHTED CONSTRAINTS (Q5187851) (← links)
- ALGORITHMS FOR THE CONSTRAINED LONGEST COMMON SUBSEQUENCE PROBLEMS (Q5714657) (← links)
- Linear-space S-table algorithms for the longest common subsequence problem (Q6104353) (← links)
- Space-efficient STR-IC-LCS computation (Q6169544) (← links)