Search research articles

ABOUT JoVE

Overview Leadership Blog JoVE Help Center

AUTHORS

Publishing Process Editorial Board Scope & Policies Peer Review FAQ Submit

LIBRARIANS

Testimonials Subscriptions Access Resources Library Advisory Board FAQ

RESEARCH

JoVE Journal Methods Collections JoVE Encyclopedia of Experiments Archive

EDUCATION

JoVE Core JoVE Business JoVE Science Education JoVE Lab Manual Faculty Resource Center Faculty Site

Terms & Conditions of Use

Search research articles

Related Experiment Videos

A combinatorial optimization approach for diverse motif finding applications.

Elena Zaslavsky¹, Mona Singh

¹Department of Computer Science & Lewis-Sigler Institute for Integrative Genomics, Princeton University, Princeton, NJ 08544, USA. elenaz@cs.princeton.edu

Algorithms for Molecular Biology : AMB

|August 19, 2006

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

FBApro: A fast, simple linear transformation for diverse metabolic modeling tasks.

ArXiv·2026

Same author

Redundant and distinct mechanisms suppress innate immune activation during SARS-CoV-2 infection.

PLoS biology·2026

Same author

Fast, accurate construction of multiple sequence alignments from protein language embeddings.

bioRxiv : the preprint server for biology·2026

Same author

Single-cell transcriptomics reveals FXR1 as an actionable target for siRNA therapy in ovarian cancer.

Nature communications·2026

Same author

Exercise modulation of the alternative splicing landscape in human tissues.

bioRxiv : the preprint server for biology·2026

Same author

Multi-omic identification of key transcriptional regulatory programs during endurance exercise training in rats.

Nature communications·2026

Same journal

A k-mer-based estimator of the substitution rate between repetitive sequences.

Algorithms for molecular biology : AMB·2026

Same journal

Haplotype-aware long-read error correction.

Algorithms for molecular biology : AMB·2026

Same journal

Extension of partial atom-to-atom maps: uniqueness and algorithms.

Algorithms for molecular biology : AMB·2026

Same journal

Lossless pangenome indexing using tag arrays.

Algorithms for molecular biology : AMB·2026

Same journal

Dolphyin: a combinatorial algorithm for identifying 1-Dollo phylogenies in cancer.

Algorithms for molecular biology : AMB·2026

Same journal

Probing transcription factor subsets in gene regulatory networks.

Algorithms for molecular biology : AMB·2026

See all related articles

This study presents a novel computational framework for identifying biological sequence motifs. The approach combines graph pruning and integer programming to find statistically significant and optimal motifs in DNA and protein sequences.

Area of Science:

Computational biology
Bioinformatics
Genomics

Background:

Identifying recurring patterns (motifs) in biological sequences is crucial for understanding DNA regulation and protein function.
Motif discovery is applied in diverse contexts, leading to several problem variations.

Purpose of the Study:

To develop a versatile computational framework for motif finding.
To address variations of motif finding, including those with substitution matrices and phylogenetic distances.

Main Methods:

A combinatorial optimization framework integrating graph pruning and integer linear programming.
Development of a method for assessing the statistical significance of discovered motifs.

Main Results:

Related Experiment Videos

The framework successfully identified statistically significant motifs in DNA and protein datasets.

Identified motifs often correspond to known patterns or highly conserved elements.

The approach frequently yields provably optimal solutions.

Conclusions:

A combined graph theory and mathematical programming approach provides effective motif-finding techniques.
This method is adaptable for various motif discovery applications in computational molecular biology.