DC programming and DCA for challenging problems in bioinformatics and computational biology
From MaRDI portal
Publication:4983006
DOI10.1007/978-3-319-09039-9_17zbMATH Open1309.90079OpenAlexW139057721MaRDI QIDQ4983006FDOQ4983006
Authors: Le Thi Hoai An 
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
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
Problems related to evolution (92D15) Protein sequences, DNA sequences (92D20) Nonconvex programming, global optimization (90C26)
Cites Work
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- Convex Analysis
- Algorithms on Strings, Trees and Sequences
- Title not available (Why is that?)
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- Title not available (Why is that?)
- A polyhedral approach to sequence alignment problems
- DCA based algorithms for multiple sequence alignment (MSA)
- Title not available (Why is that?)
- 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
- Efficient algorithms for local alignment search
- DC programming approaches for distance geometry problems
- DC programming and DCA for general DC programs
- An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs
- Efficient algorithms for large scale global optimization: Lennard-Jones clusters
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming
- Nondifferentiable optimization. Transl. from the Russian by Tetsushi Sasagawa
- Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
- Constrained 0-1 quadratic programming: basic approaches and extensions
- A continuous approch for globally solving linearly constrained quadratic
- Solving large scale molecular distance geometry problems by a smoothing technique via the Gaussian transform and D.C. programming
- Numerical solution for optimization over the efficient set by d.c. optimization algorithms
- An Algorithm for Global Minimization of Linearly Constrained Concave Quadratic Functions
- Title not available (Why is that?)
- Minimum inter-particle distance at global minimizers of Lennard-Jones clusters
- Equivalent formulations and necessary optimality conditions for the Lennard-Jones problem
- Compact vs. exponential-size LP relaxations
- New formulations of the multiple sequence alignment problem
- Approximate energy minimization for large Lennard-Jones clusters
- Title not available (Why is that?)
- Lower energy icosahedral atomic clusters with incomplete core
- A genetic algorithm for Lennard-Jones atomic clusters
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)
