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

Matching sequences under deletion-insertion constraints.

Proceedings of the National Academy of Sciences of the United States of America

|January 1, 1972

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

A Genomics Approach to Mitochondrial Evolution.

The Biological bulletin·2017

Same author

Detection and validation of single gene inversions.

Bioinformatics (Oxford, England)·2003

Same author

Gene and genome duplication.

Current opinion in genetics & development·2001

Same author

Early eukaryote evolution based on mitochondrial gene order breakpoints.

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

Same author

The early introduction of dynamic programming into computational biology.

Bioinformatics (Oxford, England)·2000

Same author

Genome rearrangement with gene families.

Bioinformatics (Oxford, England)·2000

Same journal

Chemotactic self-organization captures the dynamics of mammalian hair follicle patterning.

Proceedings of the National Academy of Sciences of the United States of America·2026

Same journal

Tomographic imaging of superconducting order using particle-hole interference.

Proceedings of the National Academy of Sciences of the United States of America·2026

Same journal

Inhibitory potential of autologous neutralizing antibodies sets quantitative limits on the rebound-competent HIV-1 reservoir.

Proceedings of the National Academy of Sciences of the United States of America·2026

Same journal

Inferring epidemiological parameters under an infectious phylogeography model with visitor dynamics.

Proceedings of the National Academy of Sciences of the United States of America·2026

Same journal

Analytical modeling for suction cup designs for skin-interfaced wearable devices.

Proceedings of the National Academy of Sciences of the United States of America·2026

Same journal

Improving cell-free metabolism through direct integration of artificial respiratory chains.

Proceedings of the National Academy of Sciences of the United States of America·2026

See all related articles

This study introduces an efficient algorithm for finding constrained longest common subsequences, improving upon existing methods for analyzing genetic sequences.

Area of Science:

Bioinformatics
Computational Biology
Genetics

Background:

Longest common subsequences (LCS) are fundamental in sequence alignment.
Existing LCS algorithms lack efficiency for constrained analyses.
Genetic homology studies require precise sequence comparison.

Purpose of the Study:

To develop an economical algorithm for LCS with deletion/insertion constraints.
To enhance computational efficiency in sequence analysis.
To provide a tool for studying genetic homology.

Main Methods:

Modification of the Needleman-Wunsch algorithm.
Development of a novel algorithm for constrained LCS.
Focus on computational economy and efficiency.

Related Experiment Videos

Main Results:

An efficient algorithm for finding constrained LCS.
Improved computational performance compared to unconstrained methods.
Demonstrated utility in genetic homology studies.

Conclusions:

The new algorithm offers significant computational advantages.
It provides a valuable tool for analyzing nucleotide and amino-acid sequences.
This work advances the study of genetic homology.