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 optimal degenerate patterns in DNA sequences.

Daisuke Shinozaki1, Tatsuya Akutsu, Osamu Maruyama

  • 1Graduate School of Mathematics, Kyushu University, Fukuoka, Japan.

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

On the Number of Control Nodes in Boolean Networks With Degree Constraints.

IEEE transactions on cybernetics·2026
Same author

DiCleavePlus: A Transformer-Based Model to Detect Human Dicer Cleavage Sites Within Cleavage Patterns.

Genes to cells : devoted to molecular & cellular mechanisms·2025
Same author

Effects of Different Tissue Factor and Phospholipid Concentrations on Thrombin Generation Assay Parameters in Normal and Abnormal Plasma Samples.

International journal of laboratory hematology·2025
Same author

Toward Environment-Sensitive Molecular Inference via Mixed Integer Linear Programming.

ACS omega·2025
Same author

Sinusoidal regulation reduces circadian period variability.

Scientific reports·2025
Same author

Enhancing epidemic forecasting with a physics-informed spatial identity neural network.

PloS one·2025

We developed SUPERPOSITION, a novel heuristic algorithm for identifying transcription factor binding sites. This method efficiently finds optimal degenerate patterns in DNA sequences, outperforming existing algorithms in computational experiments.

Area of Science:

  • Computational biology
  • Bioinformatics
  • Genomics

Background:

  • Identifying transcription factor binding sites (TFBS) is crucial for understanding gene regulation.
  • Degenerate patterns, using IUPAC nucleic acid codes, model TFBS but finding optimal patterns is NP-complete.
  • Existing methods struggle with the complexity of finding patterns consistent with both positive and negative sequence sets.

Purpose of the Study:

  • To develop a heuristic algorithm for finding optimal degenerate patterns representing TFBS.
  • To address the NP-complete challenge of TFBS identification using both positive and negative sequence data.
  • To create a computationally efficient method for discovering biologically relevant TFBS.

Main Methods:

  • An enumerative algorithm named SUPERPOSITION was developed.

Related Experiment Videos

  • SUPERPOSITION incorporates a pruning technique to enhance efficiency.
  • The algorithm is designed to work with various scoring functions.

    • Main Results:

    • SUPERPOSITION successfully identifies optimal degenerate patterns.
    • Performance was benchmarked against popular algorithms like YMF, MEME, and AlignACE.
    • SUPERPOSITION demonstrated superior performance on several yeast gene sets.

    Conclusions:

    • SUPERPOSITION is an effective algorithm for TFBS identification.
    • The algorithm offers an improvement over existing motif-finding tools.
    • The SUPERPOSITION Python script is publicly available for use.