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

Search research articles

Related Experiment Videos

Post-processing long pairwise alignments.

Z Zhang¹, P Berman, T Wiehe

¹Department of Computer Science and Engineering, Pennsylvania State University, University Park 16802, USA.

Bioinformatics (Oxford, England)

|April 4, 2000

Summary

This summary is machine-generated.

Related Concept Videos

You might also read

Related Articles

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

Sort by

Same author

Achievement of Target Gain Larger than Unity in an Inertial Fusion Experiment.

Physical review letters·2024

Same author

Lawson Criterion for Ignition Exceeded in an Inertial Fusion Experiment.

Physical review letters·2022

Same author

Letter from New York-Yellow Fever Prevented by Innoculation.

The Southern medical record·2022

Same author

Scintillation light detection in the 6-m drift-length ProtoDUNE Dual Phase liquid argon TPC.

The European physical journal. C, Particles and fields·2022

Same author

Prospects for beyond the Standard Model physics searches at the Deep Underground Neutrino Experiment: DUNE Collaboration.

The European physical journal. C, Particles and fields·2021

Same author

STAGdb: a 30K SNP genotyping array and Science Gateway for Acropora corals and their dinoflagellate symbionts.

Scientific reports·2020

Same journal

Biomedical Concept Recognition with Error-aware Negative-enhanced Ranking Framework.

Bioinformatics (Oxford, England)·2026

Same journal

TEDLH: Domain HMMs for sensitive detection of remote homologues.

Bioinformatics (Oxford, England)·2026

Same journal

PLNFGL: Joint Estimation of Multi-Condition Gene Networks from Single-cell RNA-seq Data.

Bioinformatics (Oxford, England)·2026

Same journal

MCFST: Spatial domain identification method based on multi-view graph convolutional network and graph fusion network.

Bioinformatics (Oxford, England)·2026

Same journal

SpaBiT: Enhancing Spatial Transcriptomics Resolution via Bidirectional Attention Transformers.

Bioinformatics (Oxford, England)·2026

Same journal

EDEL: Enhancing Dense Retrievers for Curation of Biomedical Knowledge Bases.

Bioinformatics (Oxford, England)·2026

See all related articles

We developed a new algorithm to improve sequence alignment by decomposing long alignments into smaller, more accurate sub-alignments, avoiding common flaws in genomic DNA analysis.

Area of Science:

Bioinformatics
Computational Biology
Genomic Sequence Analysis

Background:

The local alignment problem in bioinformatics seeks to identify and align similar regions within two sequences.
Current dynamic programming methods for sequence alignment, such as the Smith-Waterman algorithm, may contain flaws.
These flaws can lead to the inclusion of poorly scoring segments or alignments scoring less than their internal parts.

Purpose of the Study:

To address limitations in current sequence alignment algorithms.
To develop a novel method for improving the accuracy and reliability of local sequence alignments.
To provide a robust solution for analyzing genomic DNA sequences.

Main Methods:

Development of a novel algorithm for sequence alignment.

Related Experiment Videos

The algorithm decomposes large alignments into smaller, manageable sub-alignments.

The method's runtime is linearly proportional to the length of the original alignment.

Main Results:

The new algorithm effectively decomposes alignments, avoiding imperfections found in traditional methods.
The computational efficiency ensures practical applicability for large datasets.
Successful application demonstrated on alignments of genomic DNA sequences.

Conclusions:

The proposed algorithm offers a significant improvement over existing methods for local sequence alignment.
This approach enhances the accuracy of identifying meaningful similarities in biological sequences.
The method provides a valuable tool for genomic research and DNA sequence analysis.