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 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

SNPio: a Python interface for population genomic data processing.

BMC bioinformatics·2026
Same journal

SpaHNR: a spatial domain identification method via sparse attention-based hierarchical node representation and multi-view contrastive learning.

BMC bioinformatics·2026
Same journal

OpenIMC: an open-source platform for analyzing single-cell and spatial proteomics by imaging mass cytometry.

BMC bioinformatics·2026
Same journal

NAP: an open source pipeline for cross-domain microbiome profiling using Nanopore sequencing-derived amplicon data.

BMC bioinformatics·2026
Same journal

SurvGME: an R package for survival analysis with graphical and measurement error models.

BMC bioinformatics·2026
Same journal

SimMapNet: a Bayesian framework for gene regulatory network inference using gene ontology similarities as external hint.

BMC bioinformatics·2026
See all related articles

Related Experiment Video

Updated: May 28, 2026

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

PMS5: an efficient exact algorithm for the (ℓ, d)-motif finding problem.

Hieu Dinh1, Sanguthevar Rajasekaran, Vamsi K Kundeti

  • 1Department of CSE, University of Connecticut, Storrs, CT 06269, USA.

BMC Bioinformatics
|October 26, 2011
PubMed
Summary
This summary is machine-generated.

A new algorithm, PMS5, efficiently identifies complex biological sequence motifs. This breakthrough solves previously intractable (21, 8) and (23, 9) motif search instances, aiding future biological discoveries.

More Related Videos

Simultaneous Affinity Enrichment of Two Post-Translational Modifications for Quantification and Site Localization
12:11

Simultaneous Affinity Enrichment of Two Post-Translational Modifications for Quantification and Site Localization

Published on: February 27, 2020

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

Related Experiment Videos

Last Updated: May 28, 2026

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

Simultaneous Affinity Enrichment of Two Post-Translational Modifications for Quantification and Site Localization
12:11

Simultaneous Affinity Enrichment of Two Post-Translational Modifications for Quantification and Site Localization

Published on: February 27, 2020

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

Area of Science:

  • Bioinformatics
  • Computational Biology
  • Genomics

Background:

  • Biological sequence motifs are crucial for understanding gene function and disease.
  • Identifying these patterns, particularly transcription factor binding sites, is a key challenge in biology.
  • The (ℓ, d)-motif search, or Planted Motif Search (PMS), is a significant problem within this domain.

Purpose of the Study:

  • To develop a novel exact algorithm for the Planted Motif Search (PMS) problem.
  • To address the computational complexity of identifying large and challenging motif instances.
  • To provide a practical solution for discovering longer motifs in biological sequences.

Main Methods:

  • Focus on exact algorithms for the (ℓ, d)-motif search problem.
  • Development of a new algorithm, PMS5, integrating novel ideas with existing methods (PMS1, PMSPrune).
  • Empirical testing on challenging PMS instances, specifically (21, 8) and (23, 9).

Main Results:

  • PMS5 successfully solves previously intractable PMS instances (21, 8) and (23, 9).
  • The algorithm achieved solutions for (21, 8) in approximately 10 hours and (23, 9) in approximately 54 hours on a standard PC.
  • This represents a significant advancement over existing exact algorithms for PMS.

Conclusions:

  • PMS5 offers an efficient solution for tackling large and complex motif search problems.
  • The algorithm's ability to solve challenging instances paves the way for discovering longer biological motifs.
  • This advancement is expected to benefit future research in gene function, disease understanding, and drug design.