Pages that link to "Item:Q1157167"

The following pages link to The shortest common supersequence problem over binary alphabet is NP- complete (Q1157167):

Displaying 33 items.

• The constrained shortest common supersequence problem (Q396654) (← links)
• Variants of constrained longest common subsequence (Q407588) (← links)
• The complexity of flood-filling games on graphs (Q423894) (← links)
• Conjunctive query containment over trees (Q532363) (← links)
• Combined super-/substring and super-/subsequence problems (Q596093) (← links)
• Consistent subsequences and supersequences (Q671514) (← links)
• On the approximation of longest common nonsupersequences and shortest common nonsubsequences (Q673078) (← links)
• The complexity of flood filling games (Q692938) (← links)
• Longest common subsequence problem for unoriented and cyclic strings (Q868937) (← links)
• The consensus string problem for a metric is NP-complete (Q876700) (← links)
• The shortest common nonsubsequence problem is NP-complete (Q1208726) (← links)
• More on the complexity of common superstring and supersequence problems (Q1318686) (← 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)
• Hardness and approximation of the asynchronous border minimization problem (Q1682885) (← links)
• Conjunctive query containment over trees using schema information (Q1702301) (← links)
• Feasibility recovery for the unit-capacity constrained permutation problem (Q1751174) (← links)
• The unit-capacity constrained permutation problem (Q1754340) (← links)
• About the design of oligo-chips (Q1766743) (← links)
• Scheduling tasks on a flexible manufacturing machine to minimize tool change delays (Q1767682) (← links)
• On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems (Q1877706) (← links)
• A beam search for the shortest common supersequence problem guided by an approximate expected length calculation (Q2163793) (← links)
• The multi-spreader crane scheduling problem: partitions and supersequences (Q2217473) (← links)
• Tractability and hardness of flood-filling games on trees (Q2344738) (← links)
• Multiple genome rearrangement by swaps and by element duplications (Q2456364) (← links)
• Minimum cost multi-product flow lines (Q2480199) (← links)
• Restricted Common Superstring and Restricted Common Supersequence (Q3011876) (← links)
• Compact Flow Diagrams for State Sequences (Q4577949) (← links)
• On the approximation of shortest common supersequences and longest common subsequences (Q4632426) (← links)
• Approximate periods of strings (Q5958136) (← links)
• String Covering: A Survey (Q6145625) (← links)
• A Survey on the Complexity of Flood-Filling Games (Q6163636) (← links)
• Weighted shortest common supersequence problem revisited (Q6536257) (← links)