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

Conserved Binding Sites01:49

Conserved Binding Sites

Many proteins’ biological role depends on their interactions with their ligands, small molecules that bind to specific locations on the protein known as ligand-binding sites. Ligand-binding sites are often conserved among homologous proteins as these sites are critical for protein function.
Binding sites are often located in large pockets, and if their location on a protein’s surface is unknown, it can be predicted using various approaches. The energetic method computationally analyses the...
Modern Molecular Taxonomy01:29

Modern Molecular Taxonomy

Advancements in molecular biology have revolutionized the identification and characterization of bacteria, with multiple methods leveraging DNA sequencing for enhanced precision. As sequencing technologies improve and costs decline, these approaches are increasingly used in clinical, environmental, and evolutionary studies.Multilocus Sequence Typing (MLST) examines several housekeeping genes, essential chromosomal genes encoding cellular functions, to distinguish strains. Approximately...
Wilcoxon Signed-Ranks Test for Matched Pairs01:09

Wilcoxon Signed-Ranks Test for Matched Pairs

The Wilcoxon signed-rank test for matched pairs evaluates the null hypothesis by combining the ranks of differences with their signs. It essentially tests whether the median of the differences in a population of matched pairs is zero. Since the test incorporates more information than the sign test, it generally yields more trustable conclusions. This test also does not require the data to follow a normal distribution, but two conditions must be met for it to be applicable: (1) the data must...

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

The Local Anesthetic Bupivacaine Inhibits the Progression of Non-Small Cell Lung Cancer by Inducing Autophagy Through Akt/mTOR Signaling.

Frontiers in oncology·2021
Same author

Light exposure mediates circadian rhythms of rhizosphere microbial communities.

The ISME journal·2021
Same author

Novel Potent Selective Orally Active S1P5 Receptor Antagonists.

ACS medicinal chemistry letters·2021
Same author

Biodegradable metals for bone fracture repair in animal models: a systematic review.

Regenerative biomaterials·2021
Same author

Rectangular multilayer dielectric gratings with broadband high diffraction efficiency and enhanced laser damage resistance.

Optics express·2021
Same author

Invariant Image Representation Using Novel Fractional-Order Polar Harmonic Fourier Moments.

Sensors (Basel, Switzerland)·2021
Same journal

Novel Gene Discovery in the Human Malaria Parasite using Nucleosome Positioning Data.

Computational systems bioinformatics. Computational Systems Bioinformatics Conference·2014
Same journal

Proceedings of Computational Systems Bioinformatics 2008. August 26-29, 2008. Palo Alto, California, USA.

Computational systems bioinformatics. Computational Systems Bioinformatics Conference·2009
Same journal

Graph wavelet alignment kernels for drug virtual screening.

Computational systems bioinformatics. Computational Systems Bioinformatics Conference·2009
Same journal

Fast multisegment alignments for temporal expression profiles.

Computational systems bioinformatics. Computational Systems Bioinformatics Conference·2009
Same journal

Knowledge representation and data mining for biological imaging.

Computational systems bioinformatics. Computational Systems Bioinformatics Conference·2009
Same journal

Efficient haplotype inference from pedigrees with missing data using linear systems with disjoint-set data structures.

Computational systems bioinformatics. Computational Systems Bioinformatics Conference·2009
See all related articles

Related Experiment Video

Updated: Jun 21, 2026

Using SCOPE to Identify Potential Regulatory Motifs in Coregulated Genes
07:55

Using SCOPE to Identify Potential Regulatory Motifs in Coregulated Genes

Published on: May 31, 2011

Voting algorithms for the motif finding problem.

Xiaowen Liu1, Bin Ma, Lusheng Wang

  • 1Department of Computer Science, University of Western Ontario, London, ON, Canada. liuxiaowencs@gmail.com

Computational Systems Bioinformatics. Computational Systems Bioinformatics Conference
|August 1, 2009
PubMed
Summary
This summary is machine-generated.

This study introduces new algorithms for identifying DNA regulatory motifs. The Selecting k Voting algorithm with progressive filtering efficiently and accurately finds motifs, outperforming existing methods.

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

Selecting Multiple Biomarker Subsets with Similarly Effective Binary Classification Performances
07:35

Selecting Multiple Biomarker Subsets with Similarly Effective Binary Classification Performances

Published on: October 11, 2018

Related Experiment Videos

Last Updated: Jun 21, 2026

Using SCOPE to Identify Potential Regulatory Motifs in Coregulated Genes
07:55

Using SCOPE to Identify Potential Regulatory Motifs in Coregulated Genes

Published on: May 31, 2011

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

Selecting Multiple Biomarker Subsets with Similarly Effective Binary Classification Performances
07:35

Selecting Multiple Biomarker Subsets with Similarly Effective Binary Classification Performances

Published on: October 11, 2018

Area of Science:

  • Computational Biology
  • Bioinformatics
  • Genomics

Background:

  • Identifying regulatory motifs in DNA sequences is crucial for understanding gene regulation.
  • The planted motif problem involves finding a common motif planted with mutations across multiple sequences.
  • The VM model, proposed by Pevzner and Sze, provides a framework for studying this problem.

Purpose of the Study:

  • To develop and analyze algorithms for solving the planted motif problem.
  • To investigate the effectiveness of voting-based algorithms in motif discovery.
  • To improve the computational efficiency of motif finding algorithms.

Main Methods:

  • Development of a simple Selecting One Voting algorithm.
  • Development of a more powerful Selecting k Voting algorithm.
  • Introduction of a progressive filtering algorithm to enhance computational speed.

Main Results:

  • Theoretical proof that voting algorithms find motif consensus with high probability given sufficient data.
  • Demonstration that a large number of input sequences is critical for reliable motif discovery.
  • Experimental validation showing the Selecting k Voting algorithm with progressive filtering achieves high accuracy and speed.

Conclusions:

  • The proposed algorithms, particularly Selecting k Voting with progressive filtering, are effective for motif discovery in computational biology.
  • The study highlights the importance of sequence data volume in motif identification.
  • The optimized algorithm offers a practical and superior alternative to existing motif-finding methods.