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

Finding subtle motifs by branching from sample strings.

Alkes Price1, Sriram Ramabhadran, Pavel A Pevzner

  • 1Department of Computer Science and Engineering, University of California at San Diego, La Jolla, CA 92093-0114, USA. aprice@cs.ucsd.edu

Bioinformatics (Oxford, England)
|October 10, 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

MGA: a tool for haplotype-mixed assembly of long and accurate reads.

Genome biology·2026
Same author

Functionally informed cis and trans proteome-wide association studies prioritize disease-critical genes.

Research square·2026
Same author

Complete sequencing of ape genomes.

Nature·2025
Same author

GenomeDecoder: inferring segmental duplications in highly repetitive genomic regions.

Bioinformatics (Oxford, England)·2025
Same author

Complete sequencing of ape genomes.

bioRxiv : the preprint server for biology·2024
Same author

UniAligner: a parameter-free framework for fast sequence alignment.

Nature methods·2023

This study introduces novel motif discovery algorithms, PatternBranching and ProfileBranching, that improve upon existing methods. These new approaches effectively identify subtle motifs by exploring motif space more efficiently.

Area of Science:

  • Bioinformatics
  • Computational Biology
  • Genomics

Background:

  • Current motif finding algorithms often use local search on seeds.
  • Techniques like Gibbs sampling and the EM algorithm may fail to find subtle motifs.
  • Existing methods can struggle to approximate globally optimal motifs.

Purpose of the Study:

  • To develop a new motif discovery approach that overcomes limitations of current methods.
  • To enhance the identification of subtle motifs in biological sequences.
  • To implement and evaluate new pattern-based and profile-based algorithms.

Main Methods:

  • Proposed a novel approach searching motif space by branching from sample strings.
  • Implemented the idea in both pattern-based and profile-based settings.

Related Experiment Videos

  • Developed PatternBranching and ProfileBranching algorithms.

    • Main Results:

    • PatternBranching and ProfileBranching algorithms demonstrated favorable results.
    • The new algorithms show improved performance compared to existing motif finding methods.
    • Effective identification of subtle motifs was achieved.

    Conclusions:

    • Branching from sample strings is an effective strategy for motif discovery.
    • PatternBranching and ProfileBranching offer improved performance for finding subtle motifs.
    • These algorithms represent a significant advancement in motif finding.