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 Method for Database Searching and Clustering.

Krause, Vingron

    Genome Informatics. Workshop on Genome Informatics
    |January 1, 1997
    PubMed
    Summary

    A new iterative search method accurately identifies related sequences, enabling a fast, set-theoretic clustering algorithm. This approach efficiently clusters large datasets like Swiss-Prot, assigning 80% of sequences automatically.

    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

    Reply to "Varicella vaccine revisited"

    Nature medicine·2000
    Same author

    Selective excitation of vibrational states by shaping of light-induced potentials

    Physical review letters·2000
    Same author

    Angular distributions of s-subshell electrons in open-shell atoms: 3s photoionization of atomic chlorine

    Physical review letters·2000
    Same author

    Multiple ionization in fast ion-atom collisions: simultaneous measurement of recoil momentum and projectile energy loss

    Physical review letters·2000
    Same author

    The allyl complex di-&mgr;-chloro-bis

    Acta crystallographica. Section C, Crystal structure communications·2000
    Same author

    Excitation functions of the analyzing power in pp--> scattering from 0.45 to 2.5 GeV

    Physical review letters·2000

    Area of Science:

    • Bioinformatics
    • Computational Biology
    • Database Management

    Background:

    • Traditional clustering methods can be computationally intensive and may produce inaccurate results.
    • Large biological sequence databases require efficient and scalable analysis techniques.

    Purpose of the Study:

    • To introduce a novel iterative database searching method for accurate sequence identification.
    • To develop a fast and scalable database clustering algorithm that avoids traditional distance-based approaches.
    • To achieve automatic, unambiguous clustering of large biological sequence datasets.

    Main Methods:

    • Development of an iterative database searching technique designed to minimize false positive hits.
    • Implementation of a novel set-theoretic clustering algorithm that leverages the accuracy of the search method.
    • Application of the clustering procedure to the Swiss-Prot database.

    Main Results:

    • The iterative search method effectively identifies large, relevant sets of sequences with minimal false positives.
    • The set-theoretic clustering algorithm demonstrates high speed and scalability, suitable for massive datasets.
    • Unambiguous assignment of 80% of Swiss-Prot sequences into non-overlapping clusters was achieved automatically.

    Conclusions:

    • The novel iterative search and set-theoretic clustering method offers an efficient and accurate approach for analyzing large biological sequence databases.
    • This method significantly improves upon traditional clustering techniques in terms of speed and automation.
    • The successful clustering of 80% of Swiss-Prot sequences highlights the practical applicability and robustness of the developed procedure.

    Related Experiment Videos