Pages that link to "Item:Q406500"
From MaRDI portal
The following pages link to A hybrid algorithm for the DNA sequencing problem (Q406500):
Displaying 18 items.
- A hyper-heuristic approach to sequencing by hybridization of DNA sequences (Q367628) (← links)
- Algorithms for testing that sets of DNA words concatenate without secondary structure (Q1426841) (← links)
- Tabu search for DNA sequencing with false negatives and false positives (Q1580973) (← links)
- Hybrid genetic algorithm for DNA sequencing with errors (Q1850998) (← links)
- Combinatorial algorithms for DNA sequence assembly (Q1902464) (← links)
- Algorithms for mixed-model sequencing with due date restrictions (Q1969845) (← links)
- Optimization in Sanger sequencing (Q2003583) (← links)
- An ant colony optimization algorithm for DNA sequencing by hybridization (Q2483507) (← links)
- DNA sequencing-tabu and scatter search combined (Q2890422) (← links)
- (Q3405016) (← links)
- A Hybrid Genetic Algorithm for the DNA Fragment Assembly Problem (Q3625010) (← links)
- (Q4737647) (← links)
- Adaptive Iterated Local Search with Random Restarts for the Balanced Travelling Salesman Problem (Q5011679) (← links)
- Subsequence Combinatorics and Applications to Microarray Production, DNA Sequencing and Chaining Algorithms (Q5307502) (← links)
- MODELING AND OPTIMIZATION OF GENETIC SCREENS VIA RNA INTERFERENCE AND FACS (Q5358030) (← links)
- On the role of metaheuristic optimization in bioinformatics (Q6056877) (← links)
- Initialization of metaheuristics: comprehensive review, critical analysis, and research directions (Q6056893) (← links)
- Balanced VCG mechanisms for sequencing problems (Q6168820) (← links)
