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

Phylogenetic Trees03:21

Phylogenetic Trees

Phylogenetic trees come in many forms. It matters in which sequence the organisms are arranged from the bottom to the top of the tree, but the branches can rotate at their nodes without altering the information. The lines connecting individual nodes can be straight, angled, or even curved.The length of the branches can depict time or the relative amount of change among organisms. For instance, the branch length might indicate the number of amino acid changes in the sequence that underlies the...
Phylogenetic Trees03:21

Phylogenetic Trees

Phylogenetic trees come in many forms. It matters in which sequence the organisms are arranged from the bottom to the top of the tree, but the branches can rotate at their nodes without altering the information. The lines connecting individual nodes can be straight, angled, or even curved.The length of the branches can depict time or the relative amount of change among organisms. For instance, the branch length might indicate the number of amino acid changes in the sequence that underlies the...
Survival Tree01:19

Survival Tree

Survival trees are a non-parametric method used in survival analysis to model the relationship between a set of covariates and the time until an event of interest occurs, often referred to as the "time-to-event" or "survival time." This method is particularly useful when dealing with censored data, where the event has not occurred for some individuals by the end of the study period, or when the exact time of the event is unknown.
 Building a Survival Tree
Constructing a survival tree begins...
Binomial Expansion Using Pascal's Triangle01:30

Binomial Expansion Using Pascal's Triangle

Expanding a binomial expression such as (a + b)n results in a predictable sequence of terms that can be systematically derived using Pascal’s Triangle. This triangular array of numbers plays a central role in understanding and computing the coefficients of binomial expansions.Pascal’s Triangle is constructed such that each row corresponds to the coefficients of a binomial raised to a power. The topmost row, known as the zeroth row, corresponds to (a + b)0, and each successive row gives the...
Evolutionary Relationships through Genome Comparisons02:54

Evolutionary Relationships through Genome Comparisons

Genome comparison is one of the excellent ways to interpret the evolutionary relationships between organisms. The basic principle of genome comparison is that if two species share a common feature, it is likely encoded by the DNA sequence conserved between both species. The advent of genome sequencing technologies in the late 20th century enabled scientists to understand the concept of conservation of domains between species and helped them to deduce evolutionary relationships across diverse...
Bipolar Junction Transistor01:22

Bipolar Junction Transistor

Bipolar Junction Transistors (BJTs) are essential elements in electronic circuits, playing a crucial role in the functionality of amplifiers, memories, and microprocessors. These transistors can be designed as NPN or PNP based on their doping patterns. They consist of three layers: the emitter, base, and collector. The configuration of these layers and their respective doping levels—with N-type or P-type impurities—define the transistor's type and its operational characteristics.
The structure...

You might also read

Related Articles

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

Sort by
Same author

General purpose interactive physico-chemical property exploration.

Journal of chemical information and modeling·2007
Same author

Visualization and interpretation of high content screening data.

Journal of chemical information and modeling·2006
Same author

Surrogate docking: structure-based virtual screening at high throughput speed.

Journal of computer-aided molecular design·2005
Same author

Identification of a small molecule that induces mitotic arrest using a simplified high-content screening assay and data analysis method.

Journal of biomolecular screening·2005
Same author

Computational identification of proteins for selectivity assays.

Proteins·2005
Same author

Accelerated K-means clustering in metric spaces.

Journal of chemical information and computer sciences·2004
Same journal

tmGNN-XAI: An Explainable Graph Neural Network Tool for Predicting Electronic Properties of Transition Metal Complexes from SMILES.

Journal of chemical information and modeling·2026
Same journal

QSAR in the Browser: An Interactive Cheminformatics Web Application.

Journal of chemical information and modeling·2026
Same journal

FoldDoF: Utilizing the Primary Degrees of Freedom of Protein Backbone for Geometric Modeling and Generation.

Journal of chemical information and modeling·2026
Same journal

Derisking Affinity Optimization for Macrocycles and Cyclic Peptides: High-Precision Free Energy Simulations across Five Diverse Targets.

Journal of chemical information and modeling·2026
Same journal

An End-User Audit of Reproducibility, Data Leakage, and Overfitting of the Top-Ranked ADMET Prediction Models in TDC Leaderboards.

Journal of chemical information and modeling·2026
Same journal

PFASGroups: An Open-Source Framework for Automated Identification, Structural Classification, and Prioritization of Per- and Polyfluoroalkyl Substances.

Journal of chemical information and modeling·2026
See all related articles

Related Experiment Video

Updated: Jun 23, 2026

The ITS2 Database
16:17

The ITS2 Database

Published on: March 12, 2012

Compressed binary bit trees: a new data structure for accelerating database searching.

Andrew Smellie1

  • 1CambridgeSoft Corporation, 100 CambridgePark Drive, Cambridge, Massachusetts 02104, USA. asmellie@cambridgesoft.com

Journal of Chemical Information and Modeling
|May 13, 2009
PubMed
Summary
This summary is machine-generated.

A new compressed bit binary tree structure significantly accelerates molecular similarity searching and database indexing. This method enhances computational efficiency for large chemical databases, improving search speeds up to 30-fold.

More Related Videos

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

Databases to Efficiently Manage Medium Sized, Low Velocity, Multidimensional Data in Tissue Engineering
09:43

Databases to Efficiently Manage Medium Sized, Low Velocity, Multidimensional Data in Tissue Engineering

Published on: November 22, 2019

Related Experiment Videos

Last Updated: Jun 23, 2026

The ITS2 Database
16:17

The ITS2 Database

Published on: March 12, 2012

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

Databases to Efficiently Manage Medium Sized, Low Velocity, Multidimensional Data in Tissue Engineering
09:43

Databases to Efficiently Manage Medium Sized, Low Velocity, Multidimensional Data in Tissue Engineering

Published on: November 22, 2019

Area of Science:

  • Computational chemistry
  • Cheminformatics
  • Data structures

Background:

  • Molecules are commonly represented as bit string fingerprints for database storage and retrieval.
  • Similarity searching and rapid indexing are crucial operations in chemical databases, often employing the Tanimoto coefficient.
  • Existing methods face scalability challenges with large compound libraries.

Purpose of the Study:

  • To introduce a novel data structure for efficient representation and searching of molecular fingerprints.
  • To enhance the speed of similarity searching and indexing in large chemical databases.
  • To evaluate the performance of the new data structure across various search parameters and database sizes.

Main Methods:

  • Development of a compressed bit binary tree data structure.
  • Implementation of similarity search algorithms utilizing the new data structure.
  • Testing and benchmarking against traditional methods on databases up to 1 million compounds.

Main Results:

  • The compressed bit binary tree achieves search and indexing speed improvements of up to 30 times.
  • The data structure demonstrates high performance across diverse search parameters.
  • Scalability is confirmed for databases containing up to 1 million chemical compounds.

Conclusions:

  • The compressed bit binary tree is a highly effective data structure for accelerating molecular fingerprint-based searches.
  • This advancement offers significant computational advantages for cheminformatics and drug discovery applications.
  • The proposed method provides a scalable solution for managing and querying large chemical datasets.