On the role of metaheuristic optimization in bioinformatics
From MaRDI portal
Publication:6056877
DOI10.1111/ITOR.13164OpenAlexW4283027825MaRDI QIDQ6056877
Angel A. Juan, Laura Calvet, Unnamed Author, Unnamed Author
Publication date: 4 October 2023
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://discovery.ucl.ac.uk/id/eprint/10150661/1/Int%20Trans%20Operational%20Res%20-%202022%20-%20Calvet%20-%20On%20the%20role%20of%20metaheuristic%20optimization%20in%20bioinformatics.pdf
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The selective fixing algorithm for the closest string problem
- Tabu search algorithm for DNA sequencing by hybridization with multiplicity information available
- Construct, Merge, Solve \& Adapt A new general algorithm for combinatorial optimization
- A hyper-heuristic approach to sequencing by hybridization of DNA sequences
- On approximating string selection problems with outliers
- A hybrid algorithm for the DNA sequencing problem
- A hyper-heuristic for the longest common subsequence problem
- A survey on optimization metaheuristics
- Nature-inspired novel Cuckoo search algorithm for genome sequence assembly
- An extensive comparison of recent classification tools applied to microarray data
- Large-step Markov chains for the TSP incorporating local search heuristics
- Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
- An improved algorithm for the longest common subsequence problem
- A heuristic algorithm based on Lagrangian relaxation for the closest string problem
- Greedy randomized adaptive search procedures
- Future paths for integer programming and links to artificial intelligence
- Combinatorial algorithms for DNA sequence assembly
- A multi-objective imperialist competitive algorithm (MOICA) for finding motifs in DNA sequences
- Solving the minimum common string partition problem with the help of ants
- A hybrid genetic algorithm for the repetition free longest common subsequence problem
- A survey on matheuristics for routing problems
- Hardness results for the center and median string problems under the weighted and unweighted edit distances
- Mathematical programming strategies for solving the minimum common string partition problem
- Hybridizations of GRASP with path relinking for the far from most string problem
- A combinedgreedy-walkheuristic and simulated annealing approach for the closest string problem
- DNA Sequencing by Hybridization via Genetic Search
- Heuristics for Reversal Distance Between Genomes with Duplicated Genes
- Why simheuristics? Benefits, limitations, and best practices when combining metaheuristics with simulation
- Outline for a Logical Theory of Adaptive Systems
- Algorithms and Computation
- Multiobjective artificial fish swarm algorithm for multiple sequence alignment
- Handbook of metaheuristics
- Comparative gene finding. Models, algorithms and implementation
- Computational performance evaluation of two integer linear programming models for the minimum common string partition problem
- An iterative biased‐randomized heuristic for the fleet size and mix vehicle‐routing problem with backhauls
- Minimum common string partition: on solving large‐scale problem instances
- Construct, Merge, Solve and Adapt: Application to the Repetition-Free Longest Common Subsequence Problem
- Beam-ACO for the Repetition-Free Longest Common Subsequence Problem
This page was built for publication: On the role of metaheuristic optimization in bioinformatics
