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

Sequence search algorithm assessment and testing toolkit (SAT).

J Park1, L Holm, C Chothia

  • 1European Bioinformatics Institute, EMBL Outstation, Cambridge, UK. jong@ebi.ac.uk

Bioinformatics (Oxford, England)
|June 8, 2000
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

Analysis of the mouse transcriptome based on functional annotation of 60,770 full-length cDNAs.

Nature·2002
Same author

Small-molecule metabolism: an enzyme mosaic.

Trends in biotechnology·2001
Same author

Assignment of homology to genome sequences using a library of hidden Markov models that represent all proteins of known structure.

Journal of molecular biology·2001
Same author

Identification of a vibrational frequency corresponding to H-atom translocation in hypericin.

Photochemistry and photobiology·2001
Same author

Tumor cell toxicity of hypericin and related analogs.

Photochemistry and photobiology·2001
Same author

Self-assembled monolayer of a redox-active calix[4]arene: voltammetric recognition of the Ba2+ ion in aqueous media.

Analytical chemistry·2001
Same journal

MCFST: Spatial domain identification method based on multi-view graph convolutional network and graph fusion network.

Bioinformatics (Oxford, England)·2026
Same journal

SpaBiT: Enhancing Spatial Transcriptomics Resolution via Bidirectional Attention Transformers.

Bioinformatics (Oxford, England)·2026
Same journal

EDEL: Enhancing Dense Retrievers for Curation of Biomedical Knowledge Bases.

Bioinformatics (Oxford, England)·2026
Same journal

Informative Relational Learning for Adverse Reaction Prediction with Enhanced Generalization to Novel Drugs.

Bioinformatics (Oxford, England)·2026
Same journal

An interpretable deep learning framework uncovers features governing CRISPR-Cas9 genome-editing efficiency.

Bioinformatics (Oxford, England)·2026
Same journal

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

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

The Sequence Search Algorithm Assessment and Testing Toolkit (SAT) provides a comprehensive package for comparing protein homology search algorithms. Using SAT, researchers found that smaller, non-redundant sequence databases are more efficient for homology detection.

Area of Science:

  • Bioinformatics
  • Computational Biology
  • Structural Bioinformatics

Background:

  • Protein homology search algorithms are crucial for understanding protein function and evolution.
  • Existing assessments of these algorithms are often repetitive and lack standardization.
  • Structural classification of proteins offers a robust criterion for evaluating homology detection.

Purpose of the Study:

  • To introduce the Sequence Search Algorithm Assessment and Testing Toolkit (SAT) as a standardized package for comparing protein homology search algorithms.
  • To provide a comprehensive resource for developers to save time and improve the comparability of algorithm performance assessments.
  • To leverage structural protein classifications for more accurate homology detection evaluations.

Main Methods:

Related Experiment Videos

  • Development of the Sequence Search Algorithm Assessment and Testing Toolkit (SAT).
  • Inclusion of a non-redundant large sequence resource database and a well-characterized protein domain query database.
  • Integration of parsers, PSI-BLAST, and a hidden Markov model algorithm within the SAT package.
  • Comparative analysis of a full protein sequence database (RSDB100) versus a non-redundant representative sequence database (RSDB50) using the SAT package.

    • Main Results:

    • The SAT package was utilized to compare the performance of two distinct protein sequence databases.
    • Performance measurements revealed that the full protein sequence database (RSDB100) is sub-optimal for homology searches.
    • A smaller, non-redundant representative sequence database (RSDB50) demonstrated superior efficiency and speed for homology detection within the SAT framework.

    Conclusions:

    • The SAT package offers a valuable and time-saving resource for the bioinformatics community.
    • The findings underscore the inefficiency of large, redundant sequence databases for homology searching.
    • The use of smaller, non-redundant databases like RSDB50 is recommended for optimized performance in homology detection tools.