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 new approach to sequence comparison: normalized sequence alignment.

A N Arslan1, O Eğecioğlu, P A Pevzner

  • 1Department of Computer Science, University of California, Santa Barbara, Santa Barbara, CA 93106, USA Department of Computer Science and Engineering, University of California, San Diego, San Diego, CA 92093, USA.

Bioinformatics (Oxford, England)
|April 13, 2001
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

Evolutionary expansion and specialization of the PDZ domains.

Molecular biology and evolution·2009
Same author

Microinversions in mammalian evolution.

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

Age-related changes in human crystallins determined from comparative analysis of post-translational modifications in young and aged lens: does deamidation contribute to crystallin insolubility?

Journal of proteome research·2006
Same author

Finding motifs in the twilight zone.

Bioinformatics (Oxford, England)·2002
Same author

Subtle motifs: defining the limits of motif finding algorithms.

Bioinformatics (Oxford, England)·2002
Same author

Finding weak motifs in DNA sequences.

Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing·2002
Same journal

3DICE: Interpretable 3D Cross-Modal Learning for Drug-Target Interaction Prediction and Large-Scale Drug Discovery.

Bioinformatics (Oxford, England)·2026
Same journal

KASSPer: Kinase Active Site Structure Prediction using Protein and Ligand Language Models and Its Application to Virtual Screening.

Bioinformatics (Oxford, England)·2026
Same journal

IDR searcher: a search engine solution for public image resources.

Bioinformatics (Oxford, England)·2026
Same journal

KCFtools: Rapid alignment-free method for introgression screening and GWAS using k-mer profiles.

Bioinformatics (Oxford, England)·2026
Same journal

Meta2DB: Curated shotgun metagenomic feature sets and metadata for health state prediction.

Bioinformatics (Oxford, England)·2026
Same journal

conMItion: an R package adjusting confounding factors for associations in multi-omics.

Bioinformatics (Oxford, England)·2026
See all related articles

A new normalized local alignment algorithm addresses flaws in the Smith-Waterman method for sequence comparison. This approach identifies regions with maximum similarity, improving genomic sequence analysis and gene prediction.

Area of Science:

  • Computational molecular biology
  • Bioinformatics
  • Genomic sequence analysis

Background:

  • The Smith-Waterman algorithm is crucial for local sequence alignment but fails to discard poorly conserved intermediate segments.
  • Existing methods cannot efficiently identify fragments with a specific high degree of similarity (e.g., >70%).
  • This limitation can lead to inaccurate comparisons of long genomic sequences and affect comparative gene prediction.

Purpose of the Study:

  • To introduce a novel sequence comparison algorithm, normalized local alignment, that identifies regions with the highest degree of similarity.
  • To overcome the limitations of the Smith-Waterman algorithm in handling poorly conserved intermediate segments.
  • To provide an efficient method for detecting highly similar fragments within sequences.

Main Methods:

Related Experiment Videos

  • Development of a new algorithm based on fractional programming.
  • Implementation of normalized local alignment for sequence comparison.
  • Analysis of the algorithm's running time complexity (O(n2log n)).

Main Results:

  • The normalized local alignment algorithm successfully reports regions with maximum similarity.
  • The algorithm addresses the flaw of including poorly conserved intermediate segments.
  • Its practical performance is only 3-5 times slower than the standard Smith-Waterman algorithm.

Conclusions:

  • Normalized local alignment offers a more accurate method for identifying conserved fragments in biological sequences.
  • This improved approach enhances the reliability of comparative genomics and gene prediction.
  • The algorithm provides an efficient solution for detecting highly similar sequence regions.