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

Algorithms for challenging motif problems.

Henry C M Leung1, Francis Y L Chin

  • 1Department of Computer Science, The University of Hong Kong, Pokfulam, Hong Kong, China. cmleung2@cs.hku.hk

Journal of Bioinformatics and Computational Biology
|March 29, 2006
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

Characterization of Large Genomic Rearrangements in BRCA1 and BRCA2 Genes in a Chinese High-Risk Cohort.

The Journal of molecular diagnostics : JMD·2025
Same author

Early measurable residual disease detection post-haematopoietic stem cell transplantation in acute myeloid leukaemia.

Therapeutic advances in hematology·2025
Same author

A multi-modal molecular characterization of the Philadelphia translocation featuring long read sequencing.

Gene·2025
Same author

Mutation Spectrum Comparison between Benign Breast Lesion Cohort, Unselected Cancer Cohort and High-Risk Breast Cancer Cohort.

Cancers·2024
Same author

Detecting structural variations with precise breakpoints using low-depth WGS data from a single oxford nanopore MinION flowcell.

Scientific reports·2022
Same author

CONNET: Accurate Genome Consensus in Assembling Nanopore Sequencing Data via Deep Learning.

iScience·2020
Same journal

CNV-ECOD: A copy number variation detection method based on ECOD algorithm using next-generation sequencing data.

Journal of bioinformatics and computational biology·2026
Same journal

ReinVar: A model-free paradigm-based reinforcement learning approach to detect copy number variation.

Journal of bioinformatics and computational biology·2026
Same journal

When pipelines run but coordinates fail: A simple spatial specificity check for false locality in post-GWAS analysis.

Journal of bioinformatics and computational biology·2026
Same journal

Comparative benchmarking of template-based, evolutionary-diffusion, and generative language models for IsPETase structure prediction.

Journal of bioinformatics and computational biology·2026
Same journal

Trap spaces as labelled ideals of SCC posets: A structural-functional theory of reachability in asynchronous boolean networks.

Journal of bioinformatics and computational biology·2026
Same journal

Erratum - DDINet: Drug-drug interaction prediction network based on multi-molecular fingerprint features and multi-head attention centered weighted autoencoder.

Journal of bioinformatics and computational biology·2026
See all related articles

New algorithms efficiently solve the Planted (l,d)-Motif Problem for gene promoter sequences. These methods find longer motifs and complex cis-regulatory modules (CRM) in reasonable time.

Area of Science:

  • Computational biology
  • Bioinformatics
  • Genomics

Background:

  • The Planted (l,d)-Motif Problem seeks similar patterns in gene promoter regions.
  • Existing algorithms often suffer from long runtimes or incomplete motif discovery.

Purpose of the Study:

  • Introduce novel algorithms to efficiently solve the Planted (l,d)-Motif Problem.
  • Address limitations of current computational approaches for motif discovery.

Main Methods:

  • Development of new algorithmic strategies for motif identification.
  • Focus on optimizing time and space complexity for motif searching.

Main Results:

  • Successfully identified motifs for challenging (9, 2), (11, 3), and (15, 5) parameters.

Related Experiment Videos

  • Demonstrated capability to find significantly longer motifs, e.g., (20, 7), (30, 11), (40, 15).
  • Algorithms show potential for extension to cis-regulatory modules (CRM).

    • Conclusions:

    • The novel algorithms offer a more efficient and reliable solution for the Planted (l,d)-Motif Problem.
    • These advancements enable the study of longer and more complex sequence motifs in genomics.
    • The approach is extendable for discovering cis-regulatory modules, advancing gene regulation research.