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

Computationally efficient cluster representation in molecular sequence megaclassification

D J States1, N L Harris, L Hunter

  • 1Institute for Biomedical Computing, Washington University, St. Louis, MO 63110, USA.

Proceedings. International Conference on Intelligent Systems for Molecular Biology
|January 1, 1993
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

Flow-Xl: a new facility for the analysis of crystallization in flow systems.

Journal of applied crystallography·2024
Same author

Impact of maternal body mass index (BMI) and the challenges of fetal echocardiography.

Public health·2024
Same author

Pulmonary hypertension in adults completing tuberculosis treatment.

African journal of thoracic and critical care medicine·2023
Same author

Intestinal eosinophils: multifaceted roles in tissue homeostasis and disease.

Seminars in immunopathology·2021
Same author

Effects and side effects of maternal administration of indomethacin for fetal tricuspid valve dysplasia.

Ultrasound in obstetrics & gynecology : the official journal of the International Society of Ultrasound in Obstetrics and Gynecology·2020
Same author

A comparison of trauma scoring systems for injuries presenting to a district-level urban public hospital in Western Cape.

South African journal of surgery. Suid-Afrikaanse tydskrif vir chirurgie·2020
Same journal

Proceedings of the 8th International Conference on Intelligent Systems for Molecular Biology (ISMB 2000). San Diego, California, USA. August 19-23, 2000.

Proceedings. International Conference on Intelligent Systems for Molecular Biology·2001
Same journal

Analysis of gene expression data with pathway scores.

Proceedings. International Conference on Intelligent Systems for Molecular Biology·2000
Same journal

Towards a complete map of the protein space based on a unified sequence and structure analysis of all known proteins.

Proceedings. International Conference on Intelligent Systems for Molecular Biology·2000
Same journal

Mining for putative regulatory elements in the yeast genome using gene expression data.

Proceedings. International Conference on Intelligent Systems for Molecular Biology·2000
Same journal

A multiple alignment algorithm for metabolic pathway analysis using enzyme hierarchy.

Proceedings. International Conference on Intelligent Systems for Molecular Biology·2000
Same journal

Sequence database search using jumping alignments.

Proceedings. International Conference on Intelligent Systems for Molecular Biology·2000
See all related articles

This study introduces a graph theory approach for protein sequence analysis, using minimal spanning trees to efficiently represent sequence clusters. This method significantly reduces storage needs for large protein databases, enabling faster automated annotation.

Area of Science:

  • Bioinformatics
  • Computational Biology
  • Genomics

Background:

  • Automated protein sequence analysis and annotation are crucial for understanding biological functions.
  • Current methods for molecular sequence megaclassification require extensive storage for sequence pair similarity data, limiting implementation.
  • Public protein sequence databases exceed 80,000 entries, with similarity data tables requiring over 1 GB of storage.

Purpose of the Study:

  • To develop a computationally efficient method for representing protein sequence groups.
  • To reduce the memory footprint for large-scale protein sequence classification.
  • To simplify the analysis and manual correction of sequence classification artifacts.

Main Methods:

  • A graph theory approach is employed to represent sequence clusters using a minimal spanning tree (MST) of highest scoring similarity pairs.

Related Experiment Videos

  • The MST representation allows classification of N proteins to be stored in O(N) memory.
  • Methods for detecting and removing artifacts generated by the new tree representation are discussed.

    • Main Results:

    • The minimal spanning tree representation enables protein sequence classification storage in linear memory (O(N)).
    • This approach significantly reduces the storage requirements compared to traditional pair similarity matrices.
    • The MST representation facilitates easier group analysis, characteristic description, and manual artifact correction.

    Conclusions:

    • The minimal spanning tree approach offers a computationally efficient and memory-saving solution for molecular sequence megaclassification.
    • This method enhances the scalability of automated protein sequence analysis and annotation.
    • While improving efficiency, the new representation introduces potential artifacts that require specific detection and removal strategies.