Selected String Problems

[1]  Peter Zörnig.  Reduced-Size Integer Linear Programming Models for String Selection Problems: Application to the Farthest String Problem , 2015, J. Comput. Biol..

[2]  Christian Blum,et al.  A Hybrid Ant Colony Optimization Algorithm for the Far From Most String Problem , 2014, EvoCOP.

[3]  Michele Garraffa,et al.  The Selective Fixing Algorithm for the closest string problem , 2014, Comput. Oper. Res..

[4]  Daniele Ferone,et al.  Hybrid Metaheuristics for the Far From Most String Problem , 2013, Hybrid Metaheuristics.

[5]  Sayyed Rasoul Mousavi,et al.  An improved heuristic for the far from most strings problem , 2012, J. Heuristics.

[6]  Fabio Guido Mario Salassa,et al.  Improved LP-based algorithms for the closest string problem , 2012, Comput. Oper. Res..

[7]  Gad M. Landau,et al.  On Approximating String Selection Problems with Outliers , 2012, CPM.

[8]  Peter Zörnig,et al.  Improved optimization modelling for the closest string and related problems , 2011 .

[9]  Xiaolan Liu,et al.  Exact algorithm and heuristic for the Closest String Problem , 2011, Comput. Oper. Res..

[10]  Shunji Tanaka,et al.  A heuristic algorithm based on Lagrangian relaxation for the closest string problem , 2010, 2010 IEEE International Conference on Systems, Man and Cybernetics.

[11]  Lusheng Wang,et al.  Efficient Algorithms for the Closest String and Distinguishing String Selection Problems , 2009, FAW.

[12]  Bin Ma,et al.  More Efficient Algorithms for Closest String and Substring Problems , 2008, SIAM J. Comput..

[13]  P Festa,et al.  On some optimization problems in molecular biology. , 2007, Mathematical biosciences.

[14]  A. Litman,et al.  On covering problems of codes , 1997, Theory of Computing Systems.

[15]  Xuan Liu,et al.  Parallel Genetic Algorithm and Parallel Simulated Annealing Algorithm for the Closest String Problem , 2005, ADMA.

[16]  P. Pardalos,et al.  Optimization techniques for string selection and comparison problems in genomics , 2005, IEEE Engineering in Medicine and Biology Magazine.

[17]  Panos M. Pardalos,et al.  MODELING AND SOLVING STRING SELECTION PROBLEMS , 2005 .

[18]  Panos M. Pardalos,et al.  Optimal Solutions for the Closest-String Problem via Integer Programming , 2004, INFORMS J. Comput..

[19]  Rolf Niedermeier,et al.  Fixed-Parameter Algorithms for CLOSEST STRING and Related Problems , 2003, Algorithmica.

[20]  Jeong Seop Sim,et al.  The consensus string problem for a metric is NP-complete , 2003, J. Discrete Algorithms.

[21]  Jens Gramm.  Fixed-parameter algorithms for the consensus analysis of genomic data , 2003 .

[22]  Ming Li,et al.  Some string problems in computational biology , 2000 .

[23]  Bin Ma,et al.  Distinguishing string selection problems , 2003, SODA '99.

[24]  Bin Ma,et al.  Finding similar regions in many strings , 1999, STOC '99.

[25]  A. Macario,et al.  Gene Probes for Bacteria , 1990 .

[26]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[27]  Scott Kirkpatrick,et al.  Optimization by simulated annealing: Quantitative studies , 1984 .

[28]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[29]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.