Pages that link to "Item:Q407588"
From MaRDI portal
The following pages link to Variants of constrained longest common subsequence (Q407588):
Displaying 9 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)
- Beam-ACO for the Repetition-Free Longest Common Subsequence Problem (Q6487177) (← links)
