Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Concept Videos

Network Function of a Circuit01:25

Network Function of a Circuit

Frequency response analysis in electrical circuits provides vital insights into a circuit's behavior as the frequency of the input signal changes. The transfer function, a mathematical tool, is instrumental in understanding this behavior. It defines the relationship between phasor output and input and comes in four types: voltage gain, current gain, transfer impedance, and transfer admittance. The critical components of the transfer function are the poles and zeros.
Chemical Shift: Internal References and Solvent Effects01:17

Chemical Shift: Internal References and Solvent Effects

In an NMR sample, precise measurement of the absolute absorption frequencies of nuclei is difficult. A standard internal reference compound is added, and the frequency difference between the reference signal and sample signals is measured.
The internal reference compound generally used in NMR spectroscopy is tetramethylsilane (TMS). TMS is preferred because it is chemically inert, soluble in NMR solvents, and easily removable. Also, the highly shielded methyl protons in TMS yield an intense...
Protein Networks02:26

Protein Networks

An organism can have thousands of different proteins, and these proteins must cooperate to ensure the health of an organism. Proteins bind to other proteins and form complexes to carry out their functions. Many proteins interact with multiple other proteins creating a complex network of protein interactions.
These interactions can be represented through maps depicting protein-protein interaction networks, represented as nodes and edges. Nodes are circles that are representative of a protein,...
Protein Networks02:26

Protein Networks

An organism can have thousands of different proteins, and these proteins must cooperate to ensure the health of an organism. Proteins bind to other proteins and form complexes to carry out their functions. Many proteins interact with multiple other proteins creating a complex network of protein interactions.
These interactions can be represented through maps depicting protein-protein interaction networks, represented as nodes and edges. Nodes are circles that are representative of a protein,...
Network Covalent Solids02:18

Network Covalent Solids

Network covalent solids contain a three-dimensional network of covalently bonded atoms as found in the crystal structures of nonmetals like diamond, graphite, silicon, and some covalent compounds, such as silicon dioxide (sand) and silicon carbide (carborundum, the abrasive on sandpaper). Many minerals have networks of covalent bonds.
To break or to melt a covalent network solid, covalent bonds must be broken. Because covalent bonds are relatively strong, covalent network solids are typically...
¹H NMR: Long-Range Coupling01:27

¹H NMR: Long-Range Coupling

The coupling interactions of nuclei across four or more bonds are usually weak, with J values less than 1 Hz. While these are usually not observed in spectra, the presence of multiple bonds along the coupling pathway can result in observable long-range coupling.
In alkenes, spin information is communicated via σ–π overlap, as seen in allylic (four-bond) and homoallylic (five-bond) couplings. These coupling interactions are stronger when the σ bond is parallel to the alkene π orbitals.

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

STORM: spatial transcriptomics optimization by resolution via matrix factorization.

Briefings in bioinformatics·2026
Same author

SPACT: A clustering-driven multi-modal framework for survival prediction using genomic and histopathology data.

Medical image analysis·2026
Same author

Differential causal networks highlight sex-based differences in human tissues.

Briefings in bioinformatics·2025
Same author

OLTA: Optimizing bait seLection for TArgeted sequencing.

Bioinformatics (Oxford, England)·2025
Same author

QOMIC: quantum optimization for motif identification.

Bioinformatics advances·2025
Same author

Morphological profiling for drug discovery in the era of deep learning.

Briefings in bioinformatics·2024
Same journal

conMItion: an R package adjusting confounding factors for associations in multi-omics.

Bioinformatics (Oxford, England)·2026
Same journal

SpaMFG: a Spatial Multi-omics Integration Method based on Feature Grouping.

Bioinformatics (Oxford, England)·2026
Same journal

CSCN: Inference of Cell-Specific Causal Networks Using Single-Cell RNA-Seq Data.

Bioinformatics (Oxford, England)·2026
Same journal

Sparse CCA-Based Mediation Analysis with High-Dimensional Exposures and Mediators.

Bioinformatics (Oxford, England)·2026
Same journal

Enhancing Cross-Context Generalization in Drug Perturbation Prediction with a Multimodal Conditional Diffusion Framework.

Bioinformatics (Oxford, England)·2026
Same journal

Primer Design through Submodular Function Estimation.

Bioinformatics (Oxford, England)·2026
See all related articles

Related Experiment Video

Updated: May 31, 2026

Executing Complexity-Increasing Queries in Relational (MySQL) and NoSQL (MongoDB and EXist) Size-Growing ISO/EN 13606 Standardized EHR Databases
07:26

Executing Complexity-Increasing Queries in Relational (MySQL) and NoSQL (MongoDB and EXist) Size-Growing ISO/EN 13606 Standardized EHR Databases

Published on: March 19, 2018

RINQ: Reference-based Indexing for Network Queries.

Günhan Gülsoy1, Tamer Kahveci

  • 1Computer and Information Sciences and Engineering Department, University of Florida, Gainesville, FL 32611, USA. ggulsoy@cise.ufl.edu

Bioinformatics (Oxford, England)
|June 21, 2011
PubMed
Summary
This summary is machine-generated.

We developed RINQ, a novel indexing method for biological network databases. This approach significantly speeds up similarity queries by efficiently filtering networks, reducing query time from days to hours.

More Related Videos

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit
05:30

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit

Published on: September 8, 2023

Related Experiment Videos

Last Updated: May 31, 2026

Executing Complexity-Increasing Queries in Relational (MySQL) and NoSQL (MongoDB and EXist) Size-Growing ISO/EN 13606 Standardized EHR Databases
07:26

Executing Complexity-Increasing Queries in Relational (MySQL) and NoSQL (MongoDB and EXist) Size-Growing ISO/EN 13606 Standardized EHR Databases

Published on: March 19, 2018

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit
05:30

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit

Published on: September 8, 2023

Area of Science:

  • Bioinformatics
  • Computational Biology
  • Network Science

Background:

  • Biological network databases are crucial for understanding complex biological systems.
  • Similarity queries in these databases are computationally intensive due to the high cost of network alignment.
  • Existing methods struggle with the scalability and efficiency required for large-scale network comparisons.

Purpose of the Study:

  • To develop an efficient indexing method for accelerating similarity queries in large biological network databases.
  • To significantly reduce the computational cost and time required for network alignment and comparison.
  • To improve the discovery of statistically and biologically significant relationships within and across biological networks.

Main Methods:

  • Introduced RINQ (Reference-based Indexing for Biological Network Queries), a novel indexing technique.
  • Utilized a set of pre-aligned reference networks to establish alignment score bounds (lower and upper) for query networks.
  • Implemented a supervised method for selecting optimal reference networks to maximize filtering efficiency.

Main Results:

  • Reduced single-query running time on a 300-network database from over 2 days to 8 hours.
  • Outperformed state-of-the-art methods like Closure Tree and SAGA by a factor of three or more.
  • Successfully identified statistically and biologically significant relationships across diverse networks and organisms.

Conclusions:

  • RINQ offers a substantial improvement in query speed and efficiency for biological network databases.
  • The method effectively prunes non-relevant networks, allowing focused alignment on promising candidates.
  • RINQ facilitates the discovery of meaningful biological insights through accelerated network similarity analysis.