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):
Displaying 10 items.
- Repetition-free longest common subsequence of random sequences (Q299053) (← links)
- Analysis of evolutionary algorithms for the longest common subsequence problem (Q848642) (← links)
- Improved heuristics and a genetic algorithm for finding short supersequences (Q1384223) (← 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)
- A branch-and-cut approach to the repetition-free longest common subsequence problem (Q2883608) (← links)
- Repetition-free longest common subsequence (Q5901069) (← links)
- On the role of metaheuristic optimization in bioinformatics (Q6056877) (← 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)