Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Lynn F. Ten Eyck

dblp:50/5969 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
0since 2021 · last 2008
0000-0002-4562-9027ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 2Systems, architecture and hardware · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Interdisciplinary, comprehensive, and emerging computing
2 papers
Bioinformatics and computational biology · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Parallel and multicore computing · 56% High-performance computing · 44%

Topics — the 7 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › protein structure prediction
protein-protein docking
0.011999
Coupled optimization in protein docking · RECOMB 1999
Bioinformatics and computational biology
protein structure prediction
0.011999
Coupled optimization in protein docking · RECOMB 1999
Bioinformatics and computational biology
molecular interaction
0.011995
Surveying Molecular Interactions with DOT · SC 1995
Bioinformatics and computational biology › protein analysis
protein-protein interaction
0.011995
Surveying Molecular Interactions with DOT · SC 1995
High-performance computing › scientific computing systems
molecular dynamics simulation
0.011995
Surveying Molecular Interactions with DOT · SC 1995
Parallel and multicore computing
parallel computing
0.011995
Surveying Molecular Interactions with DOT · SC 1995
Parallel and multicore computing › parallelizing compiler
vectorization and parallelization
0.011995
Surveying Molecular Interactions with DOT · SC 1995

Methods — techniques the papers use, named apart from their topics

electrostatic potential energy computation · 0.0convolution · 0.0grid-based conformational search · 0.0continuous global optimization · 0.0
YearPublicationVenuePosition
2008 A Generalized Allosteric Mechanism for cis-Regulated Cyclic Nucleotide Binding Domains
abstract
Cyclic nucleotides (cAMP and cGMP) regulate multiple intracellular processes and are thus of a great general interest for molecular and structural biologists. To study the allosteric mechanism of different cyclic nucleotide binding (CNB) domains, we compared cAMP-bound and cAMP-free structures (PKA, Epac, and two ionic channels) using a new bioinformatics method: local spatial pattern alignment. Our analysis highlights four major conserved structural motifs: 1) the phosphate binding cassette (PBC), which binds the cAMP ribose-phosphate, 2) the "hinge," a flexible helix, which contacts the PBC, 3) the beta(2,3) loop, which provides precise positioning of an invariant arginine from the PBC, and 4) a conserved structural element consisting of an N-terminal helix, an eight residue loop and the A-helix (N3A-motif). The PBC and the hinge were included in the previously reported allosteric model, whereas the definition of the beta(2,3) loop and the N3A-motif as conserved elements is novel. The N3A-motif is found in all cis-regulated CNB domains, and we present a model for an allosteric mechanism in these domains. Catabolite gene activator protein (CAP) represents a trans-regulated CNB domain family: it does not contain the N3A-motif, and its long range allosteric interactions are substantially different from the cis-regulated CNB domains.
Alexandr P. Kornev, Susan S. Taylor, Lynn F. Ten Eyck
PLoS Comput. Biol.3
1999 Coupled optimization in protein docking
abstract
Here, we introduce a new approach to macromolecular docking which combines the continuous global optimization algorithm CGU [6, 21] with the grid-based conformational search engine DOT [23]. We also detail the use of this method to dock acetylcholine into the fasciculin-acetylcholinesterase complex. Fasciculin blocks access to the long, narrow pathway leading to the active site, which is located in the interior of the acetylcholinesterase. For this reason, finding the location computationally is rather non-trivial. We not only successfully identified the optimal docking configuration, but were able to do so in a matter of hours.
Julie C. Mitchell, J. Ben Rosen, Andrew T. Phillips, Lynn F. Ten Eyck
RECOMB4
1995 Surveying Molecular Interactions with DOT
abstract
The purpose of the molecular interaction program DOT (Daughter of Turnip) is rapid computation of the electrostatic potential energy between two proteins or other charged molecules. DOT exhaustively tests all six degrees of freedom, rotational and translational, and produces a grid of approximate interaction energies and orientations. It is able to do this because the problem is cast as the convolution of the potential field of the first molecule and any rotated charge distribution of the second. The algorithm lends itself to both parallelization and vectorization, permitting huge increases in computational speed over other methods for obtaining the same information. For example, a complete mapping of interactions between plastocyanin and cytochrome c was done in eight minutes using 256 nodes of an Intel Paragon. DOT is expected to be particularly useful as a rapid screen to find configurations for more detailed study using exact energy models.
Lynn F. Ten Eyck, Jeffrey Mandell, Victoria A. Roberts, Michael E. Pique
SC1