Large-scale linear programming techniques for the design of protein folding potentials
From MaRDI portal
Publication:1764228
DOI10.1007/s10107-004-0526-7zbMath1055.92021OpenAlexW2034852683MaRDI QIDQ1764228
Publication date: 24 February 2005
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-004-0526-7
Applications of mathematical programming (90C90) Linear programming (90C05) Interior-point methods (90C51) Biochemistry, molecular biology (92C40)
Related Items (7)
The maximum feasible subset problem (maxFS) and applications ⋮ Global energy minimization of alanine dipeptide via barrier function methods ⋮ A smoothing SQP framework for a class of composite \(L_q\) minimization over polyhedron ⋮ Mathematical programming in computational biology: an annotated bibliography ⋮ Faster maximum feasible subsystem solutions for dense constraint matrices ⋮ A two-phase relaxation-based heuristic for the maximum feasible subsystem problem ⋮ Some operations research methods for analyzing protein sequences and structures
Uses Software
This page was built for publication: Large-scale linear programming techniques for the design of protein folding potentials
