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

Efficient sequence alignment algorithms.

M S Waterman

    Journal of Theoretical Biology
    |June 7, 1984
    PubMed
    Summary
    This summary is machine-generated.

    Sequence alignment is crucial for analyzing increasing nucleic acid data. This study presents a new O(n2) algorithm for multiple insertions/deletions using concave weighting functions, improving computational efficiency.

    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

    Topological classification and enumeration of RNA structures by genus.

    Journal of mathematical biology·2012
    Same author

    DNA sequence assembly and multiple sequence alignment by an Eulerian path approach.

    Cold Spring Harbor symposia on quantitative biology·2004
    Same author

    An Eulerian path approach to DNA fragment assembly.

    Proceedings of the National Academy of Sciences of the United States of America·2001
    Same author

    Probabilistic and statistical properties of words: an overview.

    Journal of computational biology : a journal of computational molecular cell biology·2000
    Same author

    Estimation for restriction sites observed by optical mapping using reversible-jump Markov Chain Monte Carlo.

    Journal of computational biology : a journal of computational molecular cell biology·1998
    Same author

    A new computational method for detection of chimeric 16S rRNA artifacts generated by PCR amplification from mixed bacterial populations.

    Applied and environmental microbiology·1997
    Same journal

    The male-biased sex ratio in humans and its role in the transition from promiscuity to pair bonding.

    Journal of theoretical biology·2026
    Same journal

    Quantifying the counter-intuitive effects of vaccination by coupling the transmission dynamics of COVID-19 and the evolution of human behaviors.

    Journal of theoretical biology·2026
    Same journal

    An integrative model of FGF2-induced signaling and muscle cell proliferation.

    Journal of theoretical biology·2026
    Same journal

    A hybrid reaction-diffusion and mechanical stimulus model for mandibular bone remodeling under chewing and vibratory loading.

    Journal of theoretical biology·2026
    Same journal

    Integrated tick management strategies in fragmented peridomestic environments.

    Journal of theoretical biology·2026
    Same journal

    Joint likelihood-free inference of the number of selected single nucleotide polymorphisms and their selection coefficients in an evolving population.

    Journal of theoretical biology·2026
    See all related articles

    Area of Science:

    • Bioinformatics
    • Computational Biology
    • Genomics

    Background:

    • Nucleic acid data analysis relies heavily on sequence alignment.
    • Accurate alignment may require multiple insertion/deletion events, not just single ones.
    • Existing algorithms face computational challenges with multiple insertions/deletions.

    Purpose of the Study:

    • To address the computational complexity of multiple insertion/deletion events in sequence alignment.
    • To explore the use of concave weighting functions for improved efficiency.
    • To develop a new algorithm for sequence alignment with multiple insertions/deletions.

    Main Methods:

    • Reviewing existing sequence alignment algorithms and their limitations.
    • Analyzing the impact of multiple insertion/deletion weighting functions.

    Related Experiment Videos

  • Deriving a novel algorithm for sequence alignment using concave weighting functions.

    • Main Results:

    • The study proposes a new algorithm conjectured to achieve O(n2) time complexity.
    • This algorithm is specifically designed for scenarios requiring multiple insertion/deletions.
    • It offers a potential improvement over existing O(n3) methods when using concave weighting functions.

    Conclusions:

    • Concave weighting functions are desirable for efficient multiple insertion/deletion alignment.
    • The derived algorithm offers a computationally feasible approach for complex sequence alignments.
    • This work contributes to advancing bioinformatics tools for large-scale genomic data analysis.