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

Fast optimal alignment.

J W Fickett

    Nucleic Acids Research
    |January 11, 1984
    PubMed
    Summary
    This summary is machine-generated.

    We present a novel method to accelerate sequence alignment algorithms, ensuring optimal alignments are found faster. This approach significantly reduces computation time by reordering matrix calculations, making sequence alignment more efficient.

    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

    An assessment of gene prediction accuracy in large DNA sequences.

    Genome research·2000
    Same author

    Human-mouse genome comparisons to locate regulatory sites.

    Nature genetics·2000
    Same author

    Discovery and modeling of transcriptional regulatory regions.

    Current opinion in biotechnology·2000
    Same author

    Frequent alternative splicing of human genes.

    Genome research·1999
    Same author

    Bacterial start site prediction.

    Nucleic acids research·1999
    Same author

    Predictive methods using nucleotide sequences.

    Methods of biochemical analysis·1998
    Same journal

    Correction to 'New origin firing is inhibited by APC/CCdh1 activation in S-phase after severe replication stress'.

    Nucleic acids research·2026
    Same journal

    VeloRM: disentangling pre- and post-splicing RNA modification dynamics at single-cell resolution.

    Nucleic acids research·2026
    Same journal

    Accessibility of telomeric overhangs to stabilizing small-molecule ligands.

    Nucleic acids research·2026
    Same journal

    Multivalent interactions mediate SNAIL transcription factor stimulation of the nucleosome deacetylase activity of the CoREST complex.

    Nucleic acids research·2026
    Same journal

    Genome-wide mapping of DNA G-quadruplexes in Trypanosoma brucei chromatin reveals enrichment in coding regions and transcription start sites.

    Nucleic acids research·2026
    Same journal

    Correction to 'The Gene Ontology knowledgebase in 2026'.

    Nucleic acids research·2026
    See all related articles

    Area of Science:

    • Bioinformatics
    • Computational Biology
    • Algorithm Optimization

    Background:

    • Sequence alignment is fundamental in bioinformatics for comparing DNA, RNA, and protein sequences.
    • Existing algorithms like Needleman-Wunsch can be computationally intensive.
    • Previous attempts to speed up alignment often compromised alignment accuracy.

    Purpose of the Study:

    • To introduce a modified sequence alignment algorithm that maintains optimal alignment accuracy.
    • To significantly reduce the computational time required for sequence alignment.
    • To improve the efficiency of bioinformatics analyses reliant on sequence comparison.

    Main Methods:

    • Reordering the computation of the alignment matrix.
    • Developing a method that fills only a fraction of the matrix.

    Related Experiment Videos

  • Relating the number of computed elements to sequence similarity.

    • Main Results:

    • Achieved optimal sequence alignments in significantly reduced time, often 1/10th of the usual duration.
    • Demonstrated that the algorithm's speed is proportional to the similarity between sequences.
    • Successfully avoided the trade-off between speed and accuracy seen in other methods.

    Conclusions:

    • The modified algorithm provides a substantial speedup for sequence alignment while guaranteeing optimal results.
    • This method offers a more efficient tool for large-scale genomic and proteomic analyses.
    • The reordered computation strategy is a key innovation for accelerating bioinformatics algorithms.