Search research articles

ABOUT JoVE

Overview Leadership Blog JoVE Help Center

AUTHORS

Publishing Process Editorial Board Scope & Policies Peer Review FAQ Submit

LIBRARIANS

Testimonials Subscriptions Access Resources Library Advisory Board FAQ

RESEARCH

JoVE Journal Methods Collections JoVE Encyclopedia of Experiments Archive

EDUCATION

JoVE Core JoVE Business JoVE Science Education JoVE Lab Manual Faculty Resource Center Faculty Site

Terms & Conditions of Use

Related Concept Videos

Peptide Identification Using Tandem Mass Spectrometry

Peptide Identification Using Tandem Mass Spectrometry

Tandem mass spectrometry, also known as MS/MS or MS2, is an analytical technique that employs two mass analyzers. Essentially it is a series of mass spectrometers that helps isolate a particular biomolecule and then helps study its chemical properties.
This technique helps gather information regarding the protein from which the peptide was obtained and to study the peptides’ amino acid sequence. Identifying peptides from a complex mixture is an important component of the growing field of...

Evolutionary Relationships through Genome Comparisons

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...

You might also read

Related Articles

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

Sort by

Same author

A dual context-aware basecaller for nanopore direct RNA sequencing.

Nature communications·2026

Same author

Bryophytes hold a larger gene family space than vascular plants.

Nature genetics·2025

Same author

Efficient data filtering with multiple group conditions: a command tool for bioinformatics data analysis.

aBIOTECH·2025

Same author

Ubiquitination of OsCSN5 by OsPUB45 activates immunity by modulating the OsCUL3a-OsNPR1 module.

Science advances·2025

Same author

A sensitive one-pot ROA assay for rapid miRNA detection.

aBIOTECH·2024

Same author

BSAlign: A Library for Nucleotide Sequence Alignment.

Genomics, proteomics & bioinformatics·2024

Same journal

Closely related, yet phenotypically different - Genome assemblies of two sister species of widow spiders: <i>Latrodectus hasselti</i> and <i>L. katipo</i>, Theridiidae.

GigaByte (Hong Kong, China)·2026

Same journal

ChestPathCT5-S100: an open real-world chest CT dataset of five common thoracic pathologies with heterogeneous acquisition conditions.

GigaByte (Hong Kong, China)·2026

Same journal

AortaSeg-60: an open real-world CT-angiography dataset of the aorta with automated segmentation masks and pathological variability.

GigaByte (Hong Kong, China)·2026

Same journal

A chromosome-level reference genome for Pacific herring (<i>Clupea pallasii)</i> from the Bering Sea.

GigaByte (Hong Kong, China)·2026

Same journal

Efficient downsampling of genome alignments with Rasusa.

GigaByte (Hong Kong, China)·2026

Same journal

AI in practice: a multilingual survey of 2025 BioHackathon participants.

GigaByte (Hong Kong, China)·2026

See all related articles

Search research articles

Related Experiment Video

Updated: Jun 7, 2025

A Protocol for Computer-Based Protein Structure and Function Prediction

A Protocol for Computer-Based Protein Structure and Function Prediction

Published on: November 3, 2011

TSTA: thread and SIMD-based trapezoidal pairwise/multiple sequence-alignment method.

Peiyu Zong^1,2, Wenpeng Deng^1,2, Jian Liu²

¹Hubei Key Laboratory of Agricultural Bioinformatics, College of Informatics, Huazhong Agricultural University, Wuhan, 430070, China.

Gigabyte (Hong Kong, China)

|November 14, 2024

Summary

This summary is machine-generated.

The Needleman-Wunsch algorithm for sequence alignment is time-consuming. The new TSTA algorithm uses parallelism to significantly speed up pairwise and multiple sequence alignments.

More Related Videos

A Practical Guide to Phylogenetics for Nonexperts

A Practical Guide to Phylogenetics for Nonexperts

Published on: February 5, 2014

Demonstration of the Sequence Alignment to Predict Across Species Susceptibility Tool for Rapid Assessment of Protein Conservation

Demonstration of the Sequence Alignment to Predict Across Species Susceptibility Tool for Rapid Assessment of Protein Conservation

Published on: February 10, 2023

Related Experiment Videos

Last Updated: Jun 7, 2025

A Protocol for Computer-Based Protein Structure and Function Prediction

A Protocol for Computer-Based Protein Structure and Function Prediction

Published on: November 3, 2011

A Practical Guide to Phylogenetics for Nonexperts

A Practical Guide to Phylogenetics for Nonexperts

Published on: February 5, 2014

Demonstration of the Sequence Alignment to Predict Across Species Susceptibility Tool for Rapid Assessment of Protein Conservation

Demonstration of the Sequence Alignment to Predict Across Species Susceptibility Tool for Rapid Assessment of Protein Conservation

Published on: February 10, 2023

Area of Science:

Bioinformatics
Computational Biology
Genomics

Background:

Advancements in DNA sequencing generate large datasets, requiring efficient sequence alignment.
The Needleman-Wunsch algorithm provides global sequence alignment but is computationally intensive.
Existing methods struggle to keep pace with the increasing length and volume of sequencing data.

Purpose of the Study:

To develop a more efficient algorithm for sequence alignment.
To address the computational bottleneck of traditional dynamic programming methods.
To accelerate both pairwise and multiple sequence alignment tasks.

Main Methods:

The study proposes the TSTA algorithm, which utilizes both vector-level and thread-level parallelism.
The algorithm is designed to optimize the dynamic programming matrix calculation.
Implementation details and performance benchmarks are discussed.

Main Results:

The TSTA algorithm demonstrates significant speedups in sequence alignment tasks compared to existing methods.
Parallelism effectively reduces the computational time for aligning long sequences.
The algorithm shows scalability for both pairwise and multiple sequence alignment.

Conclusions:

The TSTA algorithm offers a substantial improvement in efficiency for sequence alignment.
Leveraging parallelism is crucial for handling large-scale genomic data.
The developed algorithm provides a valuable tool for modern bioinformatics research.