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

Linear Approximation in Frequency Domain01:26

Linear Approximation in Frequency Domain

302
Linear systems are characterized by two main properties: superposition and homogeneity. Superposition allows the response to multiple inputs to be the sum of the responses to each individual input. Homogeneity ensures that scaling an input by a scalar results in the response being scaled by the same scalar.
In contrast, nonlinear systems do not inherently possess these properties. However, for small deviations around an operating point, a nonlinear system can often be approximated as linear....
302
Aliasing01:18

Aliasing

471
Accurate signal sampling and reconstruction are crucial in various signal-processing applications. A time-domain signal's spectrum can be revealed using its Fourier transform. When this signal is sampled at a specific frequency, it results in multiple scaled replicas of the original spectrum in the frequency domain. The spacing of these replicas is determined by the sampling frequency.
If the sampling frequency is below the Nyquist rate, these replicas overlap, preventing the original...
471
Fast Fourier Transform01:10

Fast Fourier Transform

770
The Fast Fourier Transform (FFT) is a computational algorithm designed to compute the Discrete Fourier Transform (DFT) efficiently. By breaking down the calculations into smaller, manageable sections, the FFT significantly reduces the computational complexity involved. Direct computation of an N-point DFT requires N2 complex multiplications, whereas the FFT algorithm needs only (N/2)log⁡2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
770
Cluster Sampling Method01:20

Cluster Sampling Method

13.8K
Appropriate sampling methods ensure that samples are drawn without bias and accurately represent the population. Because measuring the entire population in a study is not practical, researchers use samples to represent the population of interest.
To choose a cluster sample, divide the population into clusters (groups) and then randomly select some of the clusters. All the members from these clusters are in the cluster sample. For example, if you randomly sample four departments from your...
13.8K
Determination of Expected Frequency01:08

Determination of Expected Frequency

2.5K
Suppose one wants to test independence between the two variables of a contingency table. The values in the table constitute the observed frequencies of the dataset. But how does one determine the expected frequency of the dataset? One of the important assumptions is that the two variables are independent, which means the variables do not influence each other. For independent variables, the statistical probability of any event involving both variables is calculated by multiplying the individual...
2.5K
2D NMR: Heteronuclear Single-Quantum Correlation Spectroscopy (HSQC)01:19

2D NMR: Heteronuclear Single-Quantum Correlation Spectroscopy (HSQC)

1.3K
Heteronuclear single-quantum correlation spectroscopy (HSQC) is a 2D NMR technique that reveals one-bond correlations between hydrogen and a heteronucleus. The HSQC experiment is similar to the heteronuclear correlation experiment (HETCOR) but is more sensitive. In the HSQC spectrum, the proton chemical shift is plotted on the horizontal F2 axis, while the 13C chemical shift is plotted on the vertical F1 axis. The corresponding proton and 13C spectra are also shown. The HSQC contour plot does...
1.3K

You might also read

Related Articles

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

Sort by
Same author

A lipid droplet-targeted viscosity-sensitive fluorescent probe for visualization of tumor and NAFLD imaging.

Spectrochimica acta. Part A, Molecular and biomolecular spectroscopy·2026
Same author

Non-gene-edited, CD19-targeted, allogeneic CAR-T cell therapy for relapsed or refractory B-cell acute lymphoblastic leukemia: an open-label, single-arm phase 1 study.

Bone marrow transplantation·2026
Same author

CLN7 suppression induces apoptosis via mTOR-regulated and chaperone-mediated autophagy in myeloid leukemia cells.

Cell death & disease·2026
Same author

Letter by Liu and Yao Regarding Article, "Phenotypic Selectivity of Artificial Intelligence-Enhanced Electrocardiography in Cardiovascular Diagnosis and Risk Prediction".

Circulation·2026
Same author

Polarized mitochondrial respiratory chain complexes in synaptic mitochondria induced by plasticity signals.

Molecular and cellular biochemistry·2026
Same author

Engineered local polarization disorder unlocks record efficiency in antiferroelectric capacitors.

Nature communications·2026
Same journal

Light-Induced Proteomic Changes in Pseudomonas aeruginosa Biofilms.

Proteomics·2026
Same journal

Decade-Resolved Proteomic Profiling of Gastric Cancer FFPE Archives: Evaluating Storage-Associated Shifts and Signal Stability Over 50 Years.

Proteomics·2026
Same journal

Proteome-Scale Mining of Metal-Associated Proteins of Monkeypox Virus.

Proteomics·2026
Same journal

Optimized Sample Handling Minimizes Peptide Adsorption to Plastics to Enable High Sensitivity Evosep Based Chemical Proteomics.

Proteomics·2026
Same journal

Toward Predicting Pandemic Potential: A Comparative Analysis of Virus-Host Interactions Between Diverse Influenza A Viruses and the Human Innate Immune System.

Proteomics·2026
Same journal

Functional Divergence of Mucus in Pacific Oyster (Crassostrea gigas): Insights From Integrated Proteomic and Rheological Study.

Proteomics·2026
See all related articles

Related Experiment Video

Updated: Dec 21, 2025

ARL Spectral Fitting as an Application to Augment Spectral Data via Franck-Condon Lineshape Analysis and Color Analysis
07:11

ARL Spectral Fitting as an Application to Augment Spectral Data via Franck-Condon Lineshape Analysis and Color Analysis

Published on: August 19, 2021

2.9K

A Fast and Memory-Efficient Spectral Library Search Algorithm Using Locality-Sensitive Hashing.

Lei Wang1, Kaiyuan Liu1, Sujun Li1

  • 1School of Informatics and Computing, Indiana University, Bloomington, IN, 47405, USA.

Proteomics
|May 17, 2020
PubMed
Summary
This summary is machine-generated.

Spectral library searching is crucial for peptide identification in proteomics. The new msSLASH software uses Locality-Sensitive Hashing (LSH) for faster comparisons, achieving a 2-9X speedup in spectral library searching.

Keywords:
Locality Sensitive Hashing (LSH)Spectral LibraryTandem Mass Spectrum

More Related Videos

High Speed Sub-GHz Spectrometer for Brillouin Scattering Analysis
13:31

High Speed Sub-GHz Spectrometer for Brillouin Scattering Analysis

Published on: December 22, 2015

15.5K
High-speed Continuous-wave Stimulated Brillouin Scattering Spectrometer for Material Analysis
07:55

High-speed Continuous-wave Stimulated Brillouin Scattering Spectrometer for Material Analysis

Published on: September 22, 2017

10.5K

Related Experiment Videos

Last Updated: Dec 21, 2025

ARL Spectral Fitting as an Application to Augment Spectral Data via Franck-Condon Lineshape Analysis and Color Analysis
07:11

ARL Spectral Fitting as an Application to Augment Spectral Data via Franck-Condon Lineshape Analysis and Color Analysis

Published on: August 19, 2021

2.9K
High Speed Sub-GHz Spectrometer for Brillouin Scattering Analysis
13:31

High Speed Sub-GHz Spectrometer for Brillouin Scattering Analysis

Published on: December 22, 2015

15.5K
High-speed Continuous-wave Stimulated Brillouin Scattering Spectrometer for Material Analysis
07:55

High-speed Continuous-wave Stimulated Brillouin Scattering Spectrometer for Material Analysis

Published on: September 22, 2017

10.5K

Area of Science:

  • Proteomics
  • Computational Biology
  • Bioinformatics

Background:

  • Spectral library searching is a key method for peptide identification in proteomics.
  • Existing algorithms face computational challenges with growing spectral library sizes.
  • This is particularly relevant for well-studied organisms like humans.

Purpose of the Study:

  • To present msSLASH, a novel software for fast spectral library searching.
  • To improve the computational efficiency of peptide identification using MS/MS spectra.
  • To offer a complementary approach to traditional protein database searching.

Main Methods:

  • Implementation of a fast spectral library searching algorithm using Locality-Sensitive Hashing (LSH).
  • Conversion of MS/MS spectra into bit-strings using LSH functions.
  • Computation of spectral similarity based on highly similar bit-strings.

Main Results:

  • Significant reduction in the number of spectral comparisons required.
  • Achieved a 2-9X speedup compared to the existing SpectraST algorithm.
  • Demonstrated effectiveness on large, real-world MS/MS spectra datasets.

Conclusions:

  • msSLASH offers a computationally efficient solution for spectral library searching.
  • The LSH-based algorithm accelerates peptide identification in proteomics.
  • The software is implemented in C/C++ and ready for proteomic data analysis.