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

A space-efficient algorithm for local similarities.

X Q Huang1, R C Hardison, W Miller

  • 1Department of Computer Science, Michigan Technological University, Houghton 49931.

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

[Trend analysis of quality improvement in reperfusion therapy for acute ischemic stroke from 2018 to 2024 in Beijing].

Zhonghua yi xue za zhi·2025
Same author

[Analysis of genetic association between exon polymorphisms of <i>ADH4</i> and <i>ADH7</i> and risky drinking behavior of alcoholic liver disease].

Zhonghua yu fang yi xue za zhi [Chinese journal of preventive medicine]·2024
Same author

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

Physical review letters·2024
Same author

Interaction of smoking and aging on emphysema and small airways disease in asymptomatic healthy men by CT-based parametric response mapping analysis.

Clinical radiology·2023
Same author

[Clinical efficacy and safety analysis of <sup>125</sup>I seed implantation in the treatment of mediastinal lymph node metastasis of lung cancer].

Zhonghua yi xue za zhi·2023
Same author

[Mutational features of immunoglobulin heavy chain variable region gene in patients with chronic lymphocytic leukemia].

Zhonghua bing li xue za zhi = Chinese journal of pathology·2022
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

This study introduces a new dynamic programming algorithm for sequence comparison that significantly reduces memory usage. This breakthrough enables the analysis of very long DNA sequences, like the human and rabbit beta-like globin gene clusters.

Area of Science:

  • Bioinformatics
  • Computational Biology
  • Genomics

Background:

  • Traditional dynamic programming algorithms for sequence alignment require substantial computational resources.
  • The space complexity, often proportional to the product of sequence lengths, limits the analysis of large genomic datasets.

Purpose of the Study:

  • To develop a more memory-efficient dynamic programming algorithm for local sequence similarity detection.
  • To enable the analysis of very long sequences, which are intractable for existing methods.

Main Methods:

  • A novel dynamic programming approach for local similarity identification.
  • Algorithm designed with space complexity proportional to the sum of sequence lengths.

Main Results:

Related Experiment Videos

  • The new algorithm achieves significant space savings compared to existing methods.
  • Successfully demonstrated on a large-scale comparative genomics problem involving human and rabbit globin gene clusters.

Conclusions:

  • The developed algorithm offers a practical solution for analyzing extensive genomic sequences.
  • This advancement expands the scope of dynamic programming applications in bioinformatics and comparative genomics.