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 generic motif discovery algorithm for sequential data.

Kyle L Jensen1, Mark P Styczynski, Isidore Rigoutsos

  • 1Department of Chemical Engineering, Massachusetts Institute of Technology, Cambridge, MA 02139, USA.

Bioinformatics (Oxford, England)
|November 1, 2005
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

Programmable AND-gate strategy to reduce false positives in rolling circle amplification.

Biosensors & bioelectronics·2026
Same author

Several novel classes of small regulatory RNAs show widespread changes in schizophrenia and bipolar disorder and extensive linkages to critical brain processes.

Translational psychiatry·2026
Same author

Harnessing Plasmid Crosstalk in Transcription Factor Mediated Cell-Free Biosensors.

bioRxiv : the preprint server for biology·2025
Same author

Whole-cell and cell-free biosensor-driven metabolic engineering.

Current opinion in biotechnology·2025
Same author

Organism-Specific Sequence Motifs Link Ribosomal RNAs to Brain Disorders.

Molecular biology and evolution·2025
Same author

A mathematical model of cell-free transcription-translation with plasmid crosstalk.

Synthetic biology (Oxford, England)·2025
Same journal

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

Bioinformatics (Oxford, England)·2026
Same journal

KASSPer: Kinase Active Site Structure Prediction using Protein and Ligand Language Models and Its Application to Virtual Screening.

Bioinformatics (Oxford, England)·2026
Same journal

IDR searcher: a search engine solution for public image resources.

Bioinformatics (Oxford, England)·2026
Same journal

KCFtools: Rapid alignment-free method for introgression screening and GWAS using k-mer profiles.

Bioinformatics (Oxford, England)·2026
Same journal

Meta2DB: Curated shotgun metagenomic feature sets and metadata for health state prediction.

Bioinformatics (Oxford, England)·2026
Same journal

conMItion: an R package adjusting confounding factors for associations in multi-omics.

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

A new algorithm, Gemoda, enables comprehensive motif discovery in sequential data. It handles diverse data types and representations, offering maximal motifs and flexible similarity metrics for applications like DNA and protein analysis.

Area of Science:

  • Bioinformatics
  • Computational Biology
  • Data Mining

Background:

  • Motif discovery in sequential data is crucial for various applications.
  • Existing methods often lack the ability to combine exhaustive search with complex motif representations.
  • Previous algorithms are typically limited to specific problem classes.

Purpose of the Study:

  • To present a generic motif discovery algorithm for sequential data.
  • To overcome limitations of previous motif discovery methods.
  • To provide a flexible and widely applicable tool for motif analysis.

Main Methods:

  • Developed Gemoda, a generic motif discovery algorithm for sequential data.
  • Algorithm accommodates both categorical and real-valued data.

Related Experiment Videos

  • Supports user-defined similarity metrics for motif identification.

    • Main Results:

    • Gemoda deterministically discovers motifs that are maximal in composition and length.
    • Motif outputs are representation-agnostic (e.g., regular expressions, position weight matrices).
    • Demonstrated applications in amino acid sequences, DNA (l,d)-motif problem, and protein substructures.

    Conclusions:

    • Gemoda offers a versatile and powerful approach to motif discovery across various sequential datasets.
    • The algorithm's flexibility enhances its applicability in bioinformatics and related fields.
    • Gemoda provides a unified solution for diverse motif discovery challenges.