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

Double modulation SRS and SREF microscopy: signal contributions under pre-resonance conditions.

Physical chemistry chemical physics : PCCP·2020
Same author

Raman image-activated cell sorting.

Nature communications·2020
Same author

Synchronized subharmonic modulation in stimulated emission microscopy.

Optics express·2019
Same author

Label-free chemical imaging flow cytometry by high-speed multicolor stimulated Raman scattering.

Proceedings of the National Academy of Sciences of the United States of America·2019

Related Experiment Video

Updated: Apr 4, 2026

Temporal Ordering of Dynamic Expression Data from Detailed Spatial Expression Maps
11:52

Temporal Ordering of Dynamic Expression Data from Detailed Spatial Expression Maps

Published on: February 9, 2017

6.6K

Improved Exact Enumerative Algorithms for the Planted (l, d)-Motif Search Problem.

Shunji Tanaka

    IEEE/ACM Transactions on Computational Biology and Bioinformatics
    |September 11, 2015
    PubMed
    Summary

    This study presents efficient algorithms for the planted (l, d)-motif search problem, finding motifs with few mismatches. New techniques improve upon existing methods, significantly reducing computation time for motif discovery.

    More Related Videos

    Identification of Plasmodesmal Localization Sequences in Proteins In Planta
    08:07

    Identification of Plasmodesmal Localization Sequences in Proteins In Planta

    Published on: August 15, 2017

    8.9K
    Inherent Dynamics Visualizer, an Interactive Application for Evaluating and Visualizing Outputs from a Gene Regulatory Network Inference Pipeline
    10:44

    Inherent Dynamics Visualizer, an Interactive Application for Evaluating and Visualizing Outputs from a Gene Regulatory Network Inference Pipeline

    Published on: December 7, 2021

    2.7K

    Related Experiment Videos

    Last Updated: Apr 4, 2026

    Temporal Ordering of Dynamic Expression Data from Detailed Spatial Expression Maps
    11:52

    Temporal Ordering of Dynamic Expression Data from Detailed Spatial Expression Maps

    Published on: February 9, 2017

    6.6K
    Identification of Plasmodesmal Localization Sequences in Proteins In Planta
    08:07

    Identification of Plasmodesmal Localization Sequences in Proteins In Planta

    Published on: August 15, 2017

    8.9K
    Inherent Dynamics Visualizer, an Interactive Application for Evaluating and Visualizing Outputs from a Gene Regulatory Network Inference Pipeline
    10:44

    Inherent Dynamics Visualizer, an Interactive Application for Evaluating and Visualizing Outputs from a Gene Regulatory Network Inference Pipeline

    Published on: December 7, 2021

    2.7K

    Area of Science:

    • Bioinformatics
    • Computational Biology
    • Algorithm Design

    Background:

    • The planted (l, d)-motif search problem is crucial for identifying conserved DNA or protein sequences.
    • Existing algorithms like qPMSPruneI and qPMS7 provide a foundation but can be computationally intensive.
    • Addressing the need for faster motif discovery is essential for large-scale genomic analysis.

    Purpose of the Study:

    • To propose novel, efficient exact algorithms for the planted (l, d)-motif search problem.
    • To extend these algorithms to the quorum version, identifying motifs present in at least q sequences.
    • To enhance existing tree-traversal algorithms for reduced computation time.

    Main Methods:

    • Development of efficient exact algorithms based on tree traversal.
    • Introduction of new techniques to optimize the search tree traversal process.
    • Adaptation of algorithms for both the standard and quorum versions of the motif search problem.

    Main Results:

    • The proposed algorithms demonstrate improved efficiency compared to previous methods.
    • Computational experiments confirm significant reductions in computation time.
    • Successful identification of planted motifs with at most d mismatches across input strings.

    Conclusions:

    • The developed algorithms offer a more efficient solution for the planted (l, d)-motif search problem.
    • These advancements contribute to faster and more effective motif discovery in bioinformatics.
    • The improved performance is validated through experimental results, outperforming prior algorithms.