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

Efficient filtering methods for clustering cDNAs with spliced sequence alignment.

Tetsuo Shibuya1, Hisashi Kashima, Akihiko Konagaya

  • 1IBM Tokyo Research Laboratory, 1623-14 Shimo-tsuruma, Yamato, Kanagawa 242-8502, Japan. tshibuya@jp.ibm.com

Bioinformatics (Oxford, England)
|December 25, 2003
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

Faster and More Accurate Estimation of Protein Hinges Based on Information Criteria.

Journal of computational biology : a journal of computational molecular cell biology·2025
Same author

Meta graphical lasso: uncovering hidden interactions among latent mechanisms.

Scientific reports·2024
Same author

Genetic algorithm-based feature selection with manifold learning for cancer classification using microarray data.

BMC bioinformatics·2023
Same author

More practical differentially private publication of key statistics in GWAS.

Bioinformatics advances·2023
Same author

Privacy-Preserving Statistical Analysis of Genomic Data Using Compressive Mechanism with Haar Wavelet Transform.

Journal of computational biology : a journal of computational molecular cell biology·2022
Same author

Co-creation environment with cloud virtual reality and real-time artificial intelligence toward the design of molecular robots.

Journal of integrative bioinformatics·2022
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

A new algorithm efficiently clusters full-length complementary DNA (cDNA) sequences into alternative splice forms. This method improves accuracy and speed compared to existing techniques, aiding splice variant identification.

Area of Science:

  • Bioinformatics
  • Computational Biology
  • Molecular Biology

Background:

  • Clustering full-length complementary DNA (cDNA) sequences into alternative splice form candidates is a critical challenge in molecular biology.
  • Existing clustering algorithms often generate excessive clusters with inaccurate splice form candidates.

Purpose of the Study:

  • To develop a novel, efficient algorithm for clustering full-length cDNA sequences into alternative splice form candidates.
  • To improve the accuracy and reduce computational time compared to current methods.

Main Methods:

  • Developed a new algorithm based on a spliced sequence alignment algorithm that incorporates splice site information.
  • Utilized a dynamic programming approach, optimized with novel techniques to reduce computation time for large datasets.

Related Experiment Videos

  • Applied the algorithm to 21,076 mouse cDNA sequences from the FANTOM 1.10 database.

    • Main Results:

    • Achieved a 2-12 fold speedup compared to traditional hash-based clustering techniques.
    • Successfully identified 87-89% of manually annotated clusters without relying on external genome or gene databases.
    • Demonstrated improved accuracy in clustering splice form candidates.

    Conclusions:

    • The developed algorithm offers an efficient and accurate solution for clustering full-length cDNA sequences into alternative splice forms.
    • This method enhances the identification of splice variants, contributing to a better understanding of gene expression and regulation.
    • A web service is available for cDNA clustering, requiring OBIGrid registration.