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 Experiment Videos

Aligning two sequences within a specified diagonal band.

K M Chao1, W R Pearson, W Miller

  • 1Department of Computer Science, Pennsylvania State University, University Park 16802.

Computer Applications in the Biosciences : CABIOS
|October 1, 1992
PubMed
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

DCA: an efficient implementation of the divide-and-conquer approach to simultaneous multiple sequence alignment.

Computer applications in the biosciences : CABIOS·1998
Same journal

Two applications to facilitate the viewing of database search result files on the Macintosh.

Computer applications in the biosciences : CABIOS·1998
Same journal

BioWish: a molecular biology command extension to Tcl/Tk.

Computer applications in the biosciences : CABIOS·1998
Same journal

The Sequence Alerting Server--a new WEB server.

Computer applications in the biosciences : CABIOS·1998
Same journal

A software tool for the analysis of mass spectrometric disulfide mapping experiments.

Computer applications in the biosciences : CABIOS·1998
Same journal

SAMBA: hardware accelerator for biological sequence comparison.

Computer applications in the biosciences : CABIOS·1998
See all related articles

A new algorithm efficiently aligns biological sequences within a diagonal band, reducing computation time and memory usage. This sequence alignment method enhances protein database searches and enables analysis on memory-limited computers.

Area of Science:

  • Bioinformatics
  • Computational Biology
  • Sequence Analysis

Background:

  • Sequence alignment is fundamental to bioinformatics.
  • Traditional algorithms can be computationally intensive, requiring significant memory and time.
  • Optimizing alignment for large databases and limited hardware presents challenges.

Purpose of the Study:

  • To develop an efficient algorithm for sequence alignment within a diagonal band.
  • To reduce computational time and memory requirements for sequence alignment.
  • To improve the performance of protein sequence database searches.

Main Methods:

  • An algorithm for aligning two sequences within a diagonal band was developed.
  • The algorithm utilizes O(NW) computation time and O(N) space complexity.

Related Experiment Videos

  • It supports both local and global alignment score calculations.
  • Local alignments are computed by identifying optimal start/end points within the band.

    • Main Results:

    • The algorithm reduces memory for local alignments from O(NW) to O(N).
    • It decreased the time for optimized scores in protein databases by 40%.
    • The method allows alignment of longer sequences and wider bands on memory-constrained systems.

    Conclusions:

    • The novel algorithm offers significant computational and memory efficiencies for sequence alignment.
    • Its integration into FASTA improves protein database search performance.
    • This advancement benefits research on computers with limited memory resources.