Smoothing by Digital Filters and a New Peak Search Routine

Allmann, R.

doi:10.4028/www.scientific.net/msf.133-136.323

MSF

1993

DOI: 10.4028/www.scientific.net/msf.133-136.323

|View full text |Cite

Smoothing by Digital Filters and a New Peak Search Routine

R. Allmann¹

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2003

Publication Types

Select...

Article1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

Efficient generation of low-energy folded states of a model protein. II. Automated histogram filtering

Larrass¹,

Pegram²,

Gordon³

et al. 2003

The Journal of Chemical Physics

View full text Add to dashboard Cite

A number of short, Monte Carlo simulated annealing runs are performed on a highly frustrated 69-mer off-lattice model protein, consisting of a chain of 69 beads that are either hydrophobic, hydrophilic, or neutral in nature, and which demonstrably folds into a six-stranded ␤-barrel structure. We employ an iterative, consensus-based scheme to cluster the 725 nonbonded distances between the hydrophobic beads using, in tandem, Ward's method for hierarchical clustering and k-means partitional clustering. We also independently analyze the same data using computer-automated histogram filtering, a technology designed to cluster high-dimensional data, without the tedium and subjectivity required by our iterative implementation of the two classical clustering methods. The memberships of low-energy clusters obtained from both classical clustering and automated histogram filtering approaches are remarkably similar. Nonbonded distance constraints are derived from these clusters and from small sets of the original unclustered conformations obtained by simulated annealing. Employing a distance geometry approach, we efficiently generate novel, low-energy conformations from each set of distance constraints, including the apparent native structure, up to 40 times faster than by doing additional simulated annealing runs. Over 33 000 unique locally optimized conformations are generated in total, substantially augmenting the number of low-energy states located by the original simulated annealing runs.

show abstract

Efficient generation of low-energy folded states of a model protein. II. Automated histogram filtering

Larrass¹,

Pegram²,

Gordon³

et al. 2003

The Journal of Chemical Physics

View full text Add to dashboard Cite

show abstract

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

Smoothing by Digital Filters and a New Peak Search Routine

Cited by 1 publication

References 0 publications

Efficient generation of low-energy folded states of a model protein. II. Automated histogram filtering

Efficient generation of low-energy folded states of a model protein. II. Automated histogram filtering

Contact Info

Product

Resources

About