منابع مشابه
Minreg: Inferring an active regulator set
Regulatory relations between genes are an important component of molecular pathways. Here, we devise a novel global method that uses a set of gene expression profiles to find a small set of relevant active regulators, identify the genes that they regulate, and automatically annotate them. We show that our algorithm is capable of handling a large number of genes in a short time and is robust to ...
متن کاملAccelerating ISTA with an active set strategy
Starting from a practical implementation of Roth and Fisher’s algorithm to solve a Lasso-type problem, we propose and study the Active Set Iterative Shrinkage/Thresholding Algorithm (AS-ISTA). The convergence is proven by observing that the algorithm can be seen as a particular case of a coordinate gradient descent algorithm with a Gauss-Southwell-r rule. We provide experimental evidence that t...
متن کاملAn Efficient Implementation of an Active Set Method for SVMs
We propose an active set algorithm to solve the convex quadratic programming (QP) problem which is the core of the support vector machine (SVM) training. The underlying method is not new and is based on the extensive practice of the Simplex method and its variants for convex quadratic problems. However, its application to large-scale SVM problems is new. Until recently the traditional active se...
متن کاملPolyphosphate - an ancient energy source and active metabolic regulator
There are a several molecules on Earth that effectively store energy within their covalent bonds, and one of these energy-rich molecules is polyphosphate. In microbial cells, polyphosphate granules are synthesised for both energy and phosphate storage and are degraded to produce nucleotide triphosphate or phosphate. Energy released from these energetic carriers is used by the cell for productio...
متن کاملAn active set algorithm for nonlinear optimization with polyhedral constraints
A polyhedral active set algorithm PASA is developed for solving a nonlinear optimization problem whose feasible set is a polyhedron. Phase one of the algorithm is the gradient projection method, while phase two is any algorithm for solving a linearly constrained optimization problem. Rules are provided for branching between the two phases. Global convergence to a stationary point is established...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bioinformatics
سال: 2002
ISSN: 1367-4803,1460-2059
DOI: 10.1093/bioinformatics/18.suppl_1.s258