Metaheuristics in Bioinformatics: DNA Sequencing and Reconstruction

[1]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[2]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[3]  C. Burks,et al.  Artificially generated data sets for testing DNA sequence assembly algorithms. , 1993, Genomics.

[4]  D. Higgins,et al.  SAGA: sequence alignment by genetic algorithm. , 1996, Nucleic acids research.

[5]  Pierre Hansen,et al.  Variable Neighborhood Search , 2018, Handbook of Heuristics.

[6]  Andrew K. C. Wong,et al.  A genetic algorithm for multiple molecular sequence alignment , 1997, Comput. Appl. Biosci..

[7]  Alexander E. Kel,et al.  A genetic algorithm for designing gene family specific oligonucleotide sets used for hybridization. The G Protein-coupled receptor Protein superfamily , 1997, German Conference on Bioinformatics.

[8]  Liisa Holm,et al.  COFFEE: an objective function for multiple sequence alignments , 1998, Bioinform..

[9]  P. Lewis,et al.  A genetic algorithm for maximum-likelihood phylogeny inference using nucleotide sequence data. , 1998, Molecular biology and evolution.

[10]  Jürgen Branke,et al.  Improved heuristics and a genetic algorithm for finding short supersequences , 1998 .

[11]  Kalyanmoy Deb,et al.  A Fast Elitist Non-dominated Sorting Genetic Algorithm for Multi-objective Optimisation: NSGA-II , 2000, PPSN.

[12]  Pablo Moscato,et al.  Inferring Phylogenetic Trees Using Evolutionary Algorithms , 2002, PPSN.

[13]  Pablo Moscato,et al.  A Gentle Introduction to Memetic Algorithms , 2003, Handbook of Metaheuristics.

[14]  Thomas Kiel Rasmussen,et al.  Improved Hidden Markov Model training for multiple sequence alignment by a particle swarm optimization-evolutionary algorithm hybrid. , 2003, Bio Systems.

[15]  Victor G. Levitsky,et al.  Recognition of eukaryotic promoters using a genetic algorithm based on iterative discriminant analysis , 2003, Silico Biol..

[16]  Carlos Cotta,et al.  Protein Structure Prediction Using Evolutionary Algorithms Hybridized with Backtracking , 2009, IWANN.

[17]  Christian Blum,et al.  Metaheuristics in combinatorial optimization: Overview and conceptual comparison , 2003, CSUR.

[18]  Pablo Moscato,et al.  Applying Memetic Algorithms to the Analysis of Microarray Data , 2003, EvoWorkshops.

[19]  Jeffrey J. Gray,et al.  Protein-protein docking with simultaneous optimization of rigid-body displacement and side-chain conformations. , 2003, Journal of molecular biology.

[20]  Carlos Cotta,et al.  A Hybrid GRASP - Evolutionary Algorithm Approach to Golomb Ruler Search , 2004, PPSN.

[21]  Pedro Larrañaga,et al.  Protein Folding in 2-Dimensional Lattices with Estimation of Distribution Algorithms , 2004, ISBMDA.

[22]  Jacques Cohen,et al.  Bioinformatics—an introduction for computer scientists , 2004, CSUR.

[23]  Stephanie Forrest,et al.  Genetic algorithms, operators, and DNA fragment assembly , 1995, Machine Learning.

[24]  Jianming Shi,et al.  Prediction of MHC class II binders using the ant colony search strategy , 2005, Artif. Intell. Medicine.

[25]  Carlos Cotta,et al.  A Comparison of Evolutionary Approaches to the Shortest Common Supersequence Problem , 2005, IWANN.

[26]  Enrique Alba,et al.  Assembling DNA fragments with parallel algorithms , 2005, 2005 IEEE Congress on Evolutionary Computation.

[27]  Carlos Cotta,et al.  Memetic Algorithms with Partial Lamarckism for the Shortest Common Supersequence Problem , 2005, IWINAC.

[28]  Carlos Cotta,et al.  Scatter search with path relinking for phylogenetic inference , 2006, Eur. J. Oper. Res..

[29]  Carlos Cotta,et al.  A Probabilistic Beam Search Approach to the Shortest Common Supersequence Problem , 2007, EvoCOP.

[30]  Carlos Cotta,et al.  On the Hybridization of Memetic Algorithms With Branch-and-Bound Techniques , 2007, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).