Browse
Submit Data
Databases
API
Help

Dataset Information

0 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

Binding Direction-Based Two-Dimensional Flattened Contact Area Computing Algorithm for Protein-Protein Interactions.

ABSTRACT: Interactions between protein molecules are essential for the assembly, function, and regulation of proteins. The contact region between two protein molecules in a protein complex is usually complementary in shape for both molecules and the area of the contact region can be used to estimate the binding strength between two molecules. Although the area is a value calculated from the three-dimensional surface, it cannot represent the three-dimensional shape of the surface. Therefore, we propose an original concept of two-dimensional contact area which provides further information such as the ruggedness of the contact region. We present a novel algorithm for calculating the binding direction between two molecules in a protein complex, and then suggest a method to compute the two-dimensional flattened area of the contact region between two molecules based on the binding direction.

SUBMITTER: Kang BS

PROVIDER: S-EPMC6151622 | biostudies-literature | 2017 Oct

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Publications

Binding Direction-Based Two-Dimensional Flattened Contact Area Computing Algorithm for Protein-Protein Interactions.

Kang Beom Sik BS Pugalendhi GaneshKumar G Kim Ku-Jin KJ

Molecules (Basel, Switzerland) 20171013 10

Interactions between protein molecules are essential for the assembly, function, and regulation of proteins. The contact region between two protein molecules in a protein complex is usually complementary in shape for both molecules and the area of the contact region can be used to estimate the binding strength between two molecules. Although the area is a value calculated from the three-dimensional surface, it cannot represent the three-dimensional shape of the surface. Therefore, we propose an ...[more]

PMID: 29027921

Similar Datasets

Lipid-protein interactions in double-layered two-dimensional AQP0 crystals.

Project description:Lens-specific aquaporin-0 (AQP0) functions as a specific water pore and forms the thin junctions between fibre cells. Here we describe a 1.9 A resolution structure of junctional AQP0, determined by electron crystallography of double-layered two-dimensional crystals. Comparison of junctional and non-junctional AQP0 structures shows that junction formation depends on a conformational switch in an extracellular loop, which may result from cleavage of the cytoplasmic amino and carboxy termini. In the centre of the water pathway, the closed pore in junctional AQP0 retains only three water molecules, which are too widely spaced to form hydrogen bonds with each other. Packing interactions between AQP0 tetramers in the crystalline array are mediated by lipid molecules, which assume preferred conformations. We were therefore able to build an atomic model for the lipid bilayer surrounding the AQP0 tetramers, and we describe lipid-protein interactions.

| S-EPMC1350984 | biostudies-literature

Two-dimensional semiconductors pave the way towards dopant-based quantum computing.

Project description:Since the proposal in 1998 to build a quantum computer using dopants in silicon as qubits, much progress has been made in the nanofabrication of semiconductors and the control of charge and spins in single dopants. However, an important problem remains unsolved, namely the control over exchange interactions and tunneling between two donors, which presents a peculiar oscillatory behavior as the dopants relative positions vary at the scale of the lattice parameter. Such behavior is due to the valley degeneracy in the conduction band of silicon, and does not occur when the conduction-band edge is at k = 0. We investigate the possibility of circumventing this problem by using two-dimensional (2D) materials as hosts. Dopants in 2D systems are more tightly bound and potentially easier to position and manipulate. Moreover, many of them present the conduction band minimum at k = 0, thus no exchange or tunnel coupling oscillations. Considering the properties of currently available 2D semiconductor materials, we access the feasibility of such a proposal in terms of quantum manipulability of isolated dopants (for single qubit operations) and dopant pairs (for two-qubit operations). Our results indicate that a wide variety of 2D materials may perform at least as well as, and possibly better, than the currently studied bulk host materials for donor qubits.

| S-EPMC6204835 | biostudies-literature

Two-dimensional ferroelectric channel transistors integrating ultra-fast memory and neural computing.

Project description:With the advent of the big data era, applications are more data-centric and energy efficiency issues caused by frequent data interactions, due to the physical separation of memory and computing, will become increasingly severe. Emerging technologies have been proposed to perform analog computing with memory to address the dilemma. Ferroelectric memory has become a promising technology due to field-driven fast switching and non-destructive readout, but endurance and miniaturization are limited. Here, we demonstrate the α-In2Se3 ferroelectric semiconductor channel device that integrates non-volatile memory and neural computation functions. Remarkable performance includes ultra-fast write speed of 40 ns, improved endurance through the internal electric field, flexible adjustment of neural plasticity, ultra-low energy consumption of 234/40 fJ per event for excitation/inhibition, and thermally modulated 94.74% high-precision iris recognition classification simulation. This prototypical demonstration lays the foundation for an integrated memory computing system with high density and energy efficiency.

| S-EPMC7782550 | biostudies-literature

A sub-cubic time algorithm for computing the quartet distance between two general trees.

Project description:BackgroundWhen inferring phylogenetic trees different algorithms may give different trees. To study such effects a measure for the distance between two trees is useful. Quartet distance is one such measure, and is the number of quartet topologies that differ between two trees.ResultsWe have derived a new algorithm for computing the quartet distance between a pair of general trees, i.e. trees where inner nodes can have any degree ? 3. The time and space complexity of our algorithm is sub-cubic in the number of leaves and does not depend on the degree of the inner nodes. This makes it the fastest algorithm so far for computing the quartet distance between general trees independent of the degree of the inner nodes.ConclusionsWe have implemented our algorithm and two of the best competitors. Our new algorithm is significantly faster than the competition and seems to run in close to quadratic time in practice.

| S-EPMC3141660 | biostudies-literature

EDGA: A Population Evolution Direction-Guided Genetic Algorithm for Protein-Ligand Docking.

Project description:Protein-ligand docking can be formulated as a search algorithm associated with an accurate scoring function. However, most current search algorithms cannot show good performance in docking problems, especially for highly flexible docking. To overcome this drawback, this article presents a novel and robust optimization algorithm (EDGA) based on the Lamarckian genetic algorithm (LGA) for solving flexible protein-ligand docking problems. This method applies a population evolution direction-guided model of genetics, in which search direction evolves to the optimum solution. The method is more efficient to find the lowest energy of protein-ligand docking. We consider four search methods-a tradition genetic algorithm, LGA, SODOCK, and EDGA-and compare their performance in docking of six protein-ligand docking problems. The results show that EDGA is the most stable, reliable, and successful.

| S-EPMC4931765 | biostudies-literature

Using Two-dimensional Principal Component Analysis and Rotation Forest for Prediction of Protein-Protein Interactions.

Project description:The interaction among proteins is essential in all life activities, and it is the basis of all the metabolic activities of the cells. By studying the protein-protein interactions (PPIs), people can better interpret the function of protein, decoding the phenomenon of life, especially in the design of new drugs with great practical value. Although many high-throughput techniques have been devised for large-scale detection of PPIs, these methods are still expensive and time-consuming. For this reason, there is a much-needed to develop computational methods for predicting PPIs at the entire proteome scale. In this article, we propose a new approach to predict PPIs using Rotation Forest (RF) classifier combine with matrix-based protein sequence. We apply the Position-Specific Scoring Matrix (PSSM), which contains biological evolution information, to represent protein sequences and extract the features through the two-dimensional Principal Component Analysis (2DPCA) algorithm. The descriptors are then sending to the rotation forest classifier for classification. We obtained 97.43% prediction accuracy with 94.92% sensitivity at the precision of 99.93% when the proposed method was applied to the PPIs data of yeast. To evaluate the performance of the proposed method, we compared it with other methods in the same dataset, and validate it on an independent datasets. The results obtained show that the proposed method is an appropriate and promising method for predicting PPIs.

| S-EPMC6110764 | biostudies-literature

Protein-lipid interactions: correlation of a predictive algorithm for lipid-binding sites with three-dimensional structural data.

Project description:BACKGROUND: Over the past decade our laboratory has focused on understanding how soluble cytoskeleton-associated proteins interact with membranes and other lipid aggregates. Many protein domains mediating specific cell membrane interactions appear by fluorescence microscopy and other precision techniques to be partially inserted into the lipid bilayer. It is unclear whether these protein-lipid-interactions are dependent on shared protein motifs or unique regional physiochemistry, or are due to more global characteristics of the protein. RESULTS: We have developed a novel computational program that predicts a protein's lipid-binding site(s) from primary sequence data. Hydrophobic labeling, Fourier transform infrared spectroscopy (FTIR), film balance, T-jump, CD spectroscopy and calorimetry experiments confirm that the interfaces predicted for several key cytoskeletal proteins (alpha-actinin, Arp2, CapZ, talin and vinculin) partially insert into lipid aggregates. The validity of these predictions is supported by an analysis of the available three-dimensional structural data. The lipid interfaces predicted by our algorithm generally contain energetically favorable secondary structures (e.g., an amphipathic alpha-helix flanked by a flexible hinge or loop region), are solvent-exposed in the intact protein, and possess favorable local or global electrostatic properties. CONCLUSION: At present, there are few reliable methods to determine the region of a protein that mediates biologically important interactions with lipids or lipid aggregates. Our matrix-based algorithm predicts lipid interaction sites that are consistent with the available biochemical and structural data. To determine whether these sites are indeed correctly identified, and whether use of the algorithm can be safely extended to other classes of proteins, will require further mapping of these sites, including genetic manipulation and/or targeted crystallography.

| S-EPMC1523333 | biostudies-literature

A simple tensor network algorithm for two-dimensional steady states.

Project description:Understanding dissipation in 2D quantum many-body systems is an open challenge which has proven remarkably difficult. Here we show how numerical simulations for this problem are possible by means of a tensor network algorithm that approximates steady states of 2D quantum lattice dissipative systems in the thermodynamic limit. Our method is based on the intuition that strong dissipation kills quantum entanglement before it gets too large to handle. We test its validity by simulating a dissipative quantum Ising model, relevant for dissipative systems of interacting Rydberg atoms, and benchmark our simulations with a variational algorithm based on product and correlated states. Our results support the existence of a first order transition in this model, with no bistable region. We also simulate a dissipative spin 1/2 XYZ model, showing that there is no re-entrance of the ferromagnetic phase. Our method enables the computation of steady states in 2D quantum lattice systems.

| S-EPMC5668304 | biostudies-literature

An Algorithm for Computing Side Chain Conformational Variations of a Protein Tunnel/Channel.

Project description:In this paper, a novel method to compute side chain conformational variations for a protein molecule tunnel (or channel) is proposed. From the conformational variations, we compute the flexibly deformed shapes of the initial tunnel, and present a way to compute the maximum size of the ligand that can pass through the deformed tunnel. By using the two types of graphs corresponding to amino acids and their side chain rotamers, the suggested algorithm classifies amino acids and rotamers which possibly have collisions. Based on the divide and conquer technique, local side chain conformations are computed first, and then a global conformation is generated by combining them. With the exception of certain cases, experimental results show that the algorithm finds up to 327,680 valid side chain conformations from 12⁸~1233 conformation candidates within three seconds.

| S-EPMC6222877 | biostudies-literature

An in-memory computing architecture based on two-dimensional semiconductors for multiply-accumulate operations.

Project description:In-memory computing may enable multiply-accumulate (MAC) operations, which are the primary calculations used in artificial intelligence (AI). Performing MAC operations with high capacity in a small area with high energy efficiency remains a challenge. In this work, we propose a circuit architecture that integrates monolayer MoS2 transistors in a two-transistor-one-capacitor (2T-1C) configuration. In this structure, the memory portion is similar to a 1T-1C Dynamic Random Access Memory (DRAM) so that theoretically the cycling endurance and erase/write speed inherit the merits of DRAM. Besides, the ultralow leakage current of the MoS2 transistor enables the storage of multi-level voltages on the capacitor with a long retention time. The electrical characteristics of a single MoS2 transistor also allow analog computation by multiplying the drain voltage by the stored voltage on the capacitor. The sum-of-product is then obtained by converging the currents from multiple 2T-1C units. Based on our experiment results, a neural network is ex-situ trained for image recognition with 90.3% accuracy. In the future, such 2T-1C units can potentially be integrated into three-dimensional (3D) circuits with dense logic and memory layers for low power in-situ training of neural networks in hardware.

| S-EPMC8184885 | biostudies-literature

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

Tweets

OmicsDI Databases

PRIDE
PeptideAtlas
MassIVE
JPOST Repository
Physiome Model Repository

EGA
EVA
ENA
LINCS
PAXDB
Cell Collective

MetaboLights
Metabolomics Workbench
MetabolomeExpress
GNPS
BioModels
FAIRDOMHub

ArrayExpress
dbGaP
ExpressionAtlas
GEO
NODE

Information

Databases
Help
API
Contact us
Code on GitHub
Terms of use
Submit Data