DC Programming and DCA for Challenging Problems in Bioinformatics and Computational Biology

DOI10.1007/978-3-319-09039-9_17zbMath1309.90079OpenAlexW139057721MaRDI QIDQ4983006

Hoai An Le Thi

Publication date: 14 April 2015

Published in: Automata, Universality, Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-09039-9_17

Mathematics Subject Classification ID

Problems related to evolution (92D15) Nonconvex programming, global optimization (90C26) Protein sequences, DNA sequences (92D20)

Related Items (2)

Continuous Relaxation for Discrete DC Programming ⋮ DC programming and DCA: thirty years of developments

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• DCA based algorithms for multiple sequence alignment (MSA)
• Equivalent formulations and necessary optimality conditions for the Lennard-Jones problem
• An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs
• New formulations of the multiple sequence alignment problem
• Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
• Minimum inter-particle distance at global minimizers of Lennard-Jones clusters
• Lower energy icosahedral atomic clusters with incomplete core
• Convex analysis approach to d. c. programming: Theory, algorithms and applications
• Efficient algorithms for large scale global optimization: Lennard-Jones clusters
• Solving large scale molecular distance geometry problems by a smoothing technique via the Gaussian transform and D.C. programming
• Approximate energy minimization for large Lennard-Jones clusters
• A polyhedral approach to sequence alignment problems
• Compact vs. exponential-size LP relaxations
• The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
• A genetic algorithm for Lennard-Jones atomic clusters
• Constrained 0-1 quadratic programming: basic approaches and extensions
• Numerical solution for optimization over the efficient set by d.c. optimization algorithms
• Computational aspects of a branch and bound algorithm for quadratic zero- one programming
• A continuous approch for globally solving linearly constrained quadratic
• DC Programming Approaches for Distance Geometry Problems
• DC Programming and DCA for General DC Programs
• A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
• An Algorithm for Global Minimization of Linearly Constrained Concave Quadratic Functions
• Algorithms on Strings, Trees and Sequences
• A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
• Large-Scale Molecular Optimization from Distance Matrices by a D.C. Optimization Approach
• Integer Quadratic Programming Models in Computational Biology
• Convex Analysis
• Efficient algorithms for local alignment search

This page was built for publication: DC Programming and DCA for Challenging Problems in Bioinformatics and Computational Biology