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 Video

Updated: Jun 3, 2026

DNA-affinity-purified Chip (DAP-chip) Method to Determine Gene Targets for Bacterial Two component Regulatory Systems
12:24

DNA-affinity-purified Chip (DAP-chip) Method to Determine Gene Targets for Bacterial Two component Regulatory Systems

Published on: July 21, 2014

A speedup technique for (l, d)-motif finding algorithms.

Sanguthevar Rajasekaran1, Hieu Dinh

  • 1Department of CSE, University of Connecticut, Storrs, CT 06269, USA. rajasek@engr.uconn.edu.

BMC Research Notes
|March 10, 2011
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

<i>Special Issue:</i> 13th International Conference on Computational Advances in Bio and Medical Sciences.

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

Fast Algorithms for Computing Jaro Similarity.

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

Potent Acridone Antimalarial against All Three Life Stages of <i>Plasmodium</i>.

Research square·2025
Same author

<i>Special Section:</i> 12th International Computational Advances in Bio and Medical Sciences (ICCABS 2023).

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

Randomized feature selection based semi-supervised latent Dirichlet allocation for microbiome analysis.

Scientific reports·2024
Same author

KE: A Knowledge Enhancing Framework for Machine Learning Models.

The journal of physical chemistry. A·2023
Same journal

Sleep deprivation impairs gastric ulcer healing and induces anxiety-like behavior in rats.

BMC research notes·2026
Same journal

Caring across cultures: a qualitative exploration of Macedonian carers supporting community-dwelling older adults in a large regional city in Australia.

BMC research notes·2026
Same journal

Prevalence and determinants of dyslipidemia among residents of Kurdistan Region of Iraq; a community-based study.

BMC research notes·2026
Same journal

Modulation of brain-kidney crosstalk by olanzapine in aluminum chloride-induced memory impairment: a preclinical investigation.

BMC research notes·2026
Same journal

Tagged and untagged amyloid precursor protein E2 domain have comparable thermal stability and metal-ion binding propensity.

BMC research notes·2026
Same journal

Phenotypical and functional characterization of a HepG2 cell clone stably overexpressing cytochrome P450 (CYP) 2C9.

BMC research notes·2026
See all related articles

This study introduces a novel speedup technique for the Planted Motif Search (PMS) problem, significantly enhancing the efficiency of motif discovery algorithms in biological sequences. The method is broadly applicable and demonstrates effectiveness across various PMS algorithms.

Area of Science:

  • Bioinformatics
  • Computational Biology
  • Genomics

Background:

  • Pattern discovery in DNA, RNA, and protein sequences is crucial for solving biological problems.
  • Motifs, important patterns, aid in identifying regulatory elements, binding sites, and drug design targets.
  • Numerous algorithms exist for the motif search problem, particularly the Planted Motif Search (PMS).

Purpose of the Study:

  • To propose a generic technique for accelerating algorithms that solve the Planted Motif Search (PMS) problem.
  • To enhance the efficiency of existing PMS algorithms without compromising accuracy.

Main Methods:

  • Focus on the Planted Motif Search (PMS) problem, a variant of motif search.
  • Development of a generic speedup technique applicable to any PMS algorithm.

More Related Videos

Optimization of Synthetic Proteins: Identification of Interpositional Dependencies Indicating Structurally and/or Functionally Linked Residues
07:08

Optimization of Synthetic Proteins: Identification of Interpositional Dependencies Indicating Structurally and/or Functionally Linked Residues

Published on: July 14, 2015

A Simple, Robust, and High Throughput Single Molecule Flow Stretching Assay Implementation for Studying Transport of Molecules Along DNA
12:05

A Simple, Robust, and High Throughput Single Molecule Flow Stretching Assay Implementation for Studying Transport of Molecules Along DNA

Published on: October 1, 2017

Related Experiment Videos

Last Updated: Jun 3, 2026

DNA-affinity-purified Chip (DAP-chip) Method to Determine Gene Targets for Bacterial Two component Regulatory Systems
12:24

DNA-affinity-purified Chip (DAP-chip) Method to Determine Gene Targets for Bacterial Two component Regulatory Systems

Published on: July 21, 2014

Optimization of Synthetic Proteins: Identification of Interpositional Dependencies Indicating Structurally and/or Functionally Linked Residues
07:08

Optimization of Synthetic Proteins: Identification of Interpositional Dependencies Indicating Structurally and/or Functionally Linked Residues

Published on: July 14, 2015

A Simple, Robust, and High Throughput Single Molecule Flow Stretching Assay Implementation for Studying Transport of Molecules Along DNA
12:05

A Simple, Robust, and High Throughput Single Molecule Flow Stretching Assay Implementation for Studying Transport of Molecules Along DNA

Published on: October 1, 2017

  • Experimental testing of the speedup technique on various PMS algorithms.

    • Main Results:

    • The proposed speedup technique can be applied to any PMS algorithm.
    • Experimental results confirm the significant effectiveness of the speedup technique.
    • The exact version of the PMS problem is NP-hard, necessitating efficient algorithmic approaches.

    Conclusions:

    • The developed speedup technique is highly effective for PMS algorithms.
    • The implementation of the algorithms is publicly available for use.
    • This advancement contributes to more efficient motif discovery in biological sequence analysis.