Pages that link to "Item:Q407588"

The following pages link to Variants of constrained longest common subsequence (Q407588):

Displaying 12 items.

• Repetition-free longest common subsequence of random sequences (Q299053) (← links)
• Parameterized tractability of the maximum-duo preservation string mapping problem (Q306271) (← links)
• The constrained shortest common supersequence problem (Q396654) (← links)
• On the parameterized complexity of the repetition free longest common subsequence problem (Q413298) (← links)
• Doubly-constrained LCS and hybrid-constrained LCS problems revisited (Q436604) (← links)
• Approximability of constrained LCS (Q439929) (← links)
• Maximum disjoint paths on edge-colored graphs: approximability and tractability (Q1736537) (← links)
• Exact algorithms for the repetition-bounded longest common subsequence problem (Q2197547) (← links)
• Comparing incomplete sequences via longest common subsequence (Q2333802) (← links)
• A hybrid genetic algorithm for the repetition free longest common subsequence problem (Q2450749) (← links)
• Fixed-parameter algorithms for scaffold filling (Q2513609) (← links)
• Solving longest common subsequence problems via a transformation to the maximum clique problem (Q2664444) (← links)