2004
DOI: 10.1287/ijoc.1040.0102
|View full text |Cite
|
Sign up to set email alerts
|

Optimizing an Empirical Scoring Function for Transmembrane Protein Structure Determination

Abstract: W e examine the problem of transmembrane protein structure determination. Like many questions that arise in biological research, this problem cannot be addressed generally by traditional laboratory experimentation alone. Instead, an approach that integrates experiment and computation is required. We formulate the transmembrane protein structure determination problem as a bound-constrained optimization problem using a special empirical scoring function, called Bundler, as the objective function. In this paper, … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
13
0

Year Published

2004
2004
2021
2021

Publication Types

Select...
6
1
1

Relationship

1
7

Authors

Journals

citations
Cited by 23 publications
(13 citation statements)
references
References 57 publications
(54 reference statements)
0
13
0
Order By: Relevance
“…Finally, we note that some work has also been done in comparing APPSPACK and other derivative-free optimization methods. Gray et al [2003] analyze the performance of APPSPACK and show that it is preferable to simulated annealing for a transmembrane protein structure prediction problem. Liang and Chen [2003] use NEOS [Dolan et al 2002] to compare APPSPACK to a limited-memory quasi-Newton method for optimal control of a fed-batch fermentation process and concluded that the APPS algorithm is a more powerful tool for stochastic optimization problems.…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…Finally, we note that some work has also been done in comparing APPSPACK and other derivative-free optimization methods. Gray et al [2003] analyze the performance of APPSPACK and show that it is preferable to simulated annealing for a transmembrane protein structure prediction problem. Liang and Chen [2003] use NEOS [Dolan et al 2002] to compare APPSPACK to a limited-memory quasi-Newton method for optimal control of a fed-batch fermentation process and concluded that the APPS algorithm is a more powerful tool for stochastic optimization problems.…”
Section: Discussionmentioning
confidence: 99%
“…See, for example, Hough et al [2001], Mathew et al [2002], Chiesa et al [2004], Kupinksi et al [2003], Croue [2003], Gray et al [2003], and Fowler et al [2004].…”
mentioning
confidence: 99%
“…If no reduction to the OF is identified, the step length is reduced and the search is repeated. Under certain conditions, APPSPACK is guaranteed to converge to a local minimum, and for some global optimization problems it has demonstrated to perform competitively with global optimization methods while requiring fewer function evaluations [24].…”
Section: Numerical Optimizationmentioning
confidence: 99%
“…Derivative-free optimization is an area of long history and current rapid growth, fueled by a growing number of applications that range from science problems [4,42,52,143] to medical problems [90,103] to engineering design and facility location problems [2,10,15,48,49,54,57,91,92,98].…”
Section: Introductionmentioning
confidence: 99%