Pages that link to "Item:Q413298"
From MaRDI portal
The following pages link to On the parameterized complexity of the repetition free longest common subsequence problem (Q413298):
Displaying 7 items.
- Repetition-free longest common subsequence of random sequences (Q299053) (← 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)
- Listing Center Strings Under the Edit Distance Metric (Q5743548) (← links)
