Pages that link to "Item:Q2883608"

The following pages link to A branch-and-cut approach to the repetition-free longest common subsequence problem (Q2883608):

Displaying 10 items.

• Repetition-free longest common subsequence of random sequences (Q299053) (← links)
• The constrained shortest common supersequence problem (Q396654) (← links)
• On the parameterized complexity of the repetition free longest common subsequence problem (Q413298) (← links)
• A\textsuperscript{*}-based compilation of relaxed decision diagrams for the longest common subsequence problem (Q2117202) (← links)
• Comparing incomplete sequences via longest common subsequence (Q2333802) (← links)
• A hybrid genetic algorithm for the repetition free longest common subsequence problem (Q2450749) (← links)
• Repetition-free longest common subsequence (Q5900087) (← links)
• Repetition-free longest common subsequence (Q5901069) (← links)
• Construct, Merge, Solve and Adapt: Application to the Repetition-Free Longest Common Subsequence Problem (Q6483593) (← links)
• Beam-ACO for the Repetition-Free Longest Common Subsequence Problem (Q6487177) (← links)