Pages that link to "Item:Q441749"
From MaRDI portal
The following pages link to A hyper-heuristic for the longest common subsequence problem (Q441749):
Displaying 11 items.
- Unified encoding for hyper-heuristics with application to bioinformatics (Q301251) (← links)
- Constrained sequence analysis algorithms in computational biology (Q527151) (← links)
- Dynamic programming algorithms for the mosaic longest common subsequence problem (Q845973) (← links)
- Thermodynamical approach to the longest common subsequence problem (Q937112) (← links)
- Finding the longest common subsequence for multiple biological sequences by ant colony optimization (Q947943) (← links)
- Improved heuristics and a genetic algorithm for finding short supersequences (Q1384223) (← links)
- An improved algorithm for the longest common subsequence problem (Q1762001) (← links)
- Solving longest common subsequence problems via a transformation to the maximum clique problem (Q2664444) (← links)
- (Q3621522) (← links)
- A learning algorithm for the longest common subsequence problem (Q5463438) (← links)
- On the role of metaheuristic optimization in bioinformatics (Q6056877) (← links)