Pages that link to "Item:Q4147591"
From MaRDI portal
The following pages link to The Complexity of Some Problems on Subsequences and Supersequences (Q4147591):
Displaying 50 items.
- On the approximation of protein threading (Q1274599) (← links)
- The computation of consensus patterns in \(DNA\) sequences (Q1310190) (← links)
- More on the complexity of common superstring and supersequence problems (Q1318686) (← links)
- The parameterized complexity of sequence alignment and consensus (Q1367540) (← links)
- Improved heuristics and a genetic algorithm for finding short supersequences (Q1384223) (← links)
- An approximate \(A^{\ast}\) algorithm and its application to the SCS problem. (Q1401210) (← links)
- On the complexity of finding common approximate substrings. (Q1426464) (← links)
- On the approximation of largest common subtrees and largest common point sets (Q1575954) (← links)
- Dynamic programming algorithms for RNA secondary structure prediction with pseudoknots (Q1585319) (← links)
- Optimality regions and fluctuations for Bernoulli last passage models (Q1664580) (← links)
- An efficient algorithm for LCS problem between two arbitrary sequences (Q1720875) (← links)
- Generalized random shapelet forests (Q1741268) (← links)
- On searching and indexing sequences of temporal intervals (Q1741320) (← links)
- Feasibility recovery for the unit-capacity constrained permutation problem (Q1751174) (← links)
- The unit-capacity constrained permutation problem (Q1754340) (← links)
- An improved algorithm for the longest common subsequence problem (Q1762001) (← links)
- About the design of oligo-chips (Q1766743) (← links)
- Scheduling tasks on a flexible manufacturing machine to minimize tool change delays (Q1767682) (← links)
- Comparison of strings belonging to the same family (Q1818790) (← links)
- On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems (Q1877706) (← links)
- FACC: a novel finite automaton based on cloud computing for the multiple longest common subsequences search (Q1954643) (← links)
- Nearly \(k\)-universal words -- investigating a part of Simon's congruence (Q2112180) (← links)
- A\textsuperscript{*}-based compilation of relaxed decision diagrams for the longest common subsequence problem (Q2117202) (← links)
- A beam search for the shortest common supersequence problem guided by an approximate expected length calculation (Q2163793) (← links)
- A branch-and-bound framework for unsupervised common event discovery (Q2193773) (← links)
- Exact algorithms for the repetition-bounded longest common subsequence problem (Q2197547) (← links)
- The multi-spreader crane scheduling problem: partitions and supersequences (Q2217473) (← links)
- An \(A^\ast\) search algorithm for the constrained longest common subsequence problem (Q2224853) (← links)
- Anytime algorithms for the longest common palindromic subsequence problem (Q2337390) (← links)
- Tractability and hardness of flood-filling games on trees (Q2344738) (← links)
- Efficient algorithms for finding interleaving relationship between sequences (Q2380070) (← links)
- RNA multiple structural alignment with longest common subsequences (Q2385486) (← links)
- A simple algorithm for the constrained sequence problems (Q2390246) (← links)
- A hardness result and new algorithm for the longest common palindromic subsequence problem (Q2410574) (← 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)
- Multiple genome rearrangement by swaps and by element duplications (Q2456364) (← links)
- Minimum cost multi-product flow lines (Q2480199) (← links)
- Hardness results for the center and median string problems under the weighted and unweighted edit distances (Q2569417) (← links)
- Searching subsequences (Q2638800) (← links)
- Solving longest common subsequence problems via a transformation to the maximum clique problem (Q2664444) (← links)
- Hardness and approximation of multiple sequence alignment with column score (Q2682925) (← links)
- Absent subsequences in words (Q2695493) (← links)
- On recognising words that are squares for the shuffle product (Q2699216) (← links)
- New Error Tolerant Method for Search of Long Repeats in DNA Sequences (Q2823018) (← links)
- Finding shuffle words that represent optimal scheduling of shared memory access (Q2855755) (← links)
- Hybridizations of Metaheuristics With Branch & Bound Derivates (Q2950520) (← links)
- Restricted Common Superstring and Restricted Common Supersequence (Q3011876) (← links)
- (Q3143773) (← links)
- Parameterized Complexity and Approximability of the SLCS Problem (Q3503583) (← links)
