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 Videos

Algorithms for phylogenetic footprinting.

Mathieu Blanchette1, Benno Schwikowski, Martin Tompa

  • 1Department of Computer Science and Engineering, Box 352350, University of Washington, Seattle, WA 98195-2350, USA. blanchem@cs.washington.edu

Journal of Computational Biology : a Journal of Computational Molecular Cell Biology
|May 23, 2002
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

Graphylo Var: Predicting the impact of non-coding variants using a multi-species sequence model.

Bioinformatics (Oxford, England)·2026
Same author

Identification of monotonically classifying pairs of genes for ordinal disease outcomes.

Bioinformatics advances·2026
Same author

H3K27me3 spreading organizes canonical PRC1 chromatin architecture to regulate developmental programs.

Nature genetics·2026
Same author

Telomere-to-telomere assembly detects genomic diversity in Canadian strains of Borrelia burgdorferi.

Cell reports·2026
Same author

A multivariate approach to identify association between peripheral blood DNA methylation and cerebrospinal fluid biomarkers of Alzheimer disease.

Scientific reports·2025
Same author

Towards the genome-scale discovery of bivariate monotonic classifiers.

BMC bioinformatics·2025
Same journal

GMSA: A Graph Matching and Point Cloud Registration-Based Method for Spatial Transcriptomics Data Alignment.

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

Investigations on Multiple Protein Scaffold Filling.

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

Cell Type Prediction for Single-Cell RNA Sequencing Utilizing Unsupervised Domain Adaptation and Semi-Supervised Learning.

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

PPIGAN: Prediction of Protein-Protein Interactions Using Generative Adversarial Networks.

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

Deep Structure-Enhanced Cell Clustering Model for Single-Cell RNA Sequencing Data.

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

Asymmetric Drug-Drug Interaction Prediction Based on Generative Adversarial Networks and Knowledge Graph.

Journal of computational biology : a journal of computational molecular cell biology·2026
See all related articles

This study introduces the Substring Parsimony Problem and an efficient algorithm for phylogenetic footprinting, aiding in the discovery of regulatory DNA elements across species. The method accurately identifies known and novel conserved regions.

Area of Science:

  • Computational Biology
  • Bioinformatics
  • Genomics

Background:

  • Phylogenetic footprinting identifies regulatory elements by detecting conserved noncoding DNA regions across species.
  • Existing methods may face challenges with datasets where regulatory elements are not universally present.

Purpose of the Study:

  • To introduce the Substring Parsimony Problem as a formalization of phylogenetic footprinting.
  • To present an exact dynamic programming algorithm and optimizations for efficient motif discovery.
  • To develop methods for handling incomplete datasets and assessing statistical significance.

Main Methods:

  • Formalization of phylogenetic footprinting as the Substring Parsimony Problem.
  • Development of an exact dynamic programming algorithm.

Related Experiment Videos

  • Implementation of algorithmic optimizations for speed.
  • Methods for handling subsets of sequences containing the element.
  • Empirical assessment of statistical significance for discovered motifs.

    • Main Results:

    • Successful implementation and application of the developed algorithm.
    • Identification of known transcription factor binding sites.
    • Discovery of novel, highly conserved noncoding regions.
    • Demonstration of computational efficiency on relevant biological datasets.

    Conclusions:

    • The Substring Parsimony Problem and its algorithmic solution provide an effective tool for phylogenetic footprinting.
    • The method accurately identifies regulatory elements, including known and novel conserved regions.
    • The developed program offers a practical and efficient approach for motif discovery in comparative genomics.