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

Comparison of methods for searching protein sequence databases

W R Pearson1

  • 1Department of Biochemistry, University of Virginia, Charlottesville 22908, USA.

Protein Science : a Publication of the Protein Society
|June 1, 1995
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

Empirical determination of effective gap penalties for sequence comparison.

Bioinformatics (Oxford, England)·2002
Same author

Training for bioinformatics and computational biology.

Bioinformatics (Oxford, England)·2001
Same author

Flexible sequence similarity searching with the FASTA3 program package.

Methods in molecular biology (Clifton, N.J.)·1999
Same author

Evolution of protein sequences and structures.

Journal of molecular biology·1999
Same author

Generalized neighbor-joining: more reliable phylogenetic tree reconstruction.

Molecular biology and evolution·1999
Same author

Panning for genes--A visual strategy for identifying novel gene orthologs and paralogs.

Genome research·1999
Same journal

Macromolecular crowding inhibits degradation of alpha-synuclein amyloid fibrils induced by cathepsins and MMP9.

Protein science : a publication of the Protein Society·2026
Same journal

Sequence-encoded differences in the conformational ensembles of CITED transcriptional activation domains impact coactivator binding.

Protein science : a publication of the Protein Society·2026
Same journal

The phospholipid biosynthesis enzyme PlsB contains three distinct domains for membrane association, lysophosphatidic acid synthesis, and dimerization.

Protein science : a publication of the Protein Society·2026
Same journal

Structural basis of ligand selectivity in FAD/NAD(P)H-dependent dehydrogenases: insights from trypanothione reductase and type II NADH dehydrogenase.

Protein science : a publication of the Protein Society·2026
Same journal

Achieving protease substrate-specific inhibition by mAb dual functional selections.

Protein science : a publication of the Protein Society·2026
Same journal

How important are quantum mechanical effects in controlling biological functions: Enzymes, electron transfer and bird navigation.

Protein science : a publication of the Protein Society·2026
See all related articles

Optimizing sequence comparison algorithms like Smith-Waterman and FASTA with modern scoring matrices and gap penalties significantly improves search sensitivity. Logarithm-based scaling (ln()-scaling) further enhances performance, making Smith-Waterman with ln()-scaling the top performer for complete query sequences.

Area of Science:

  • Bioinformatics
  • Computational Biology
  • Sequence Analysis

Background:

  • Sequence comparison algorithms are crucial for analyzing biological data.
  • Traditional methods using older scoring matrices and gap penalties may limit search sensitivity.
  • The performance of algorithms like Smith-Waterman, FASTA, and BLASTP can vary based on parameter choices.

Purpose of the Study:

  • To systematically compare the performance of common sequence comparison algorithms.
  • To identify optimal scoring matrices and gap penalties for improved search sensitivity.
  • To evaluate the impact of sequence length scaling methods on algorithm performance.

Main Methods:

  • Statistical analysis of performance differences between sequence comparison algorithms.

Related Experiment Videos

  • Systematic testing of various scoring matrices (e.g., BLOSUM, JO93, Gonnet92) and gap penalties.
  • Implementation and evaluation of logarithm of the length of the library sequence (ln()-scaling) for similarity scores.

    • Main Results:

    • Modern scoring matrices (BLOSUM45-55, JO93) and optimized gap penalties significantly outperform conventional ones (PAM250).
    • Logarithm-based scaling (ln()-scaling) provides substantial improvements in search sensitivity.
    • The Smith-Waterman algorithm combined with ln()-scaling and optimal parameters achieved the best performance for complete query sequences, outperforming FASTA and BLASTP.

    Conclusions:

    • Optimized scoring matrices, gap penalties, and ln()-scaling are essential for maximizing the sensitivity of sequence comparison algorithms.
    • The Smith-Waterman algorithm with ln()-scaling represents the most effective approach for complete query sequence analysis.
    • Careful selection of parameters is critical for accurate and sensitive sequence similarity searches.