DC programming and DCA for challenging problems in bioinformatics and computational biology
From MaRDI portal
Publication:4983006
Recommendations
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- DCA based algorithms for multiple sequence alignment (MSA)
- DC programming and DCA: thirty years of developments
- scientific article; zbMATH DE number 1488016
- Fuzzy clustering based on nonconvex optimisation approaches using difference of convex (DC) functions algorithms
Cites work
- scientific article; zbMATH DE number 429516 (Why is no real title available?)
- scientific article; zbMATH DE number 439380 (Why is no real title available?)
- scientific article; zbMATH DE number 53467 (Why is no real title available?)
- scientific article; zbMATH DE number 1197070 (Why is no real title available?)
- scientific article; zbMATH DE number 1531961 (Why is no real title available?)
- scientific article; zbMATH DE number 2188749 (Why is no real title available?)
- scientific article; zbMATH DE number 3080144 (Why is no real title available?)
- A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
- A continuous approch for globally solving linearly constrained quadratic
- A genetic algorithm for Lennard-Jones atomic clusters
- A polyhedral approach to sequence alignment problems
- Algorithms on Strings, Trees and Sequences
- An Algorithm for Global Minimization of Linearly Constrained Concave Quadratic Functions
- An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs
- Approximate energy minimization for large Lennard-Jones clusters
- Compact vs. exponential-size LP relaxations
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming
- Constrained 0-1 quadratic programming: basic approaches and extensions
- Convex Analysis
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- DC programming and DCA for general DC programs
- DC programming approaches for distance geometry problems
- DCA based algorithms for multiple sequence alignment (MSA)
- Efficient algorithms for large scale global optimization: Lennard-Jones clusters
- Efficient algorithms for local alignment search
- Equivalent formulations and necessary optimality conditions for the Lennard-Jones problem
- Integer quadratic programming models in computational biology
- Large-Scale Molecular Optimization from Distance Matrices by a D.C. Optimization Approach
- Lower energy icosahedral atomic clusters with incomplete core
- Minimum inter-particle distance at global minimizers of Lennard-Jones clusters
- New formulations of the multiple sequence alignment problem
- Nondifferentiable optimization. Transl. from the Russian by Tetsushi Sasagawa
- Numerical solution for optimization over the efficient set by d.c. optimization algorithms
- Solving large scale molecular distance geometry problems by a smoothing technique via the Gaussian transform and D.C. programming
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
Cited in
(3)
This page was built for publication: DC programming and DCA for challenging problems in bioinformatics and computational biology
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4983006)
