Pages that link to "Item:Q2450749"
From MaRDI portal
The following pages link to A hybrid genetic algorithm for the repetition free longest common subsequence problem (Q2450749):
Displayed 4 items.
- Repetition-free longest common subsequence of random sequences (Q299053) (← links)
- Exact algorithms for the repetition-bounded longest common subsequence problem (Q2197547) (← links)
- Solving longest common subsequence problems via a transformation to the maximum clique problem (Q2664444) (← links)
- On the role of metaheuristic optimization in bioinformatics (Q6056877) (← links)