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

Phylogenetic Trees03:21

Phylogenetic Trees

51.7K
Phylogenetic trees come in many forms. It matters in which sequence the organisms are arranged from the bottom to the top of the tree, but the branches can rotate at their nodes without altering the information. The lines connecting individual nodes can be straight, angled, or even curved.
51.7K
Mismatch Repair01:36

Mismatch Repair

44.8K
Overview
44.8K
Mismatch Repair01:20

Mismatch Repair

6.9K
Organisms are capable of detecting and fixing nucleotide mismatches that occur during DNA replication. This sophisticated process requires identifying the new strand and replacing the erroneous bases with correct nucleotides. Mismatch repair is coordinated by many proteins in both prokaryotes and eukaryotes.
The Mutator Protein Family Plays a Key Role in DNA Mismatch Repair
The human genome has more than 3 billion base pairs of DNA per cell. Prior to cell division, that vast amount of genetic...
6.9K
Survival Tree01:19

Survival Tree

464
Survival trees are a non-parametric method used in survival analysis to model the relationship between a set of covariates and the time until an event of interest occurs, often referred to as the "time-to-event" or "survival time." This method is particularly useful when dealing with censored data, where the event has not occurred for some individuals by the end of the study period, or when the exact time of the event is unknown.
 Building a Survival Tree
Constructing a...
464
Trihybrid Crosses02:27

Trihybrid Crosses

26.5K
Trihybrid Crosses
Some of Mendel’s crosses examined three pairs of contrasting characteristics. Such a cross is called a trihybrid cross. A trihybrid cross is a combination of three individual monohybrid crosses. For example, plant height (tall vs. short), seed shape (round vs. wrinkled), and seed color (yellow vs. green).
The F1 generation plants of a trihybrid cross are heterozygous for all three traits and produce eight gametes. Upon self-fertilization, these gametes have an equal...
26.5K

You might also read

Related Articles

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

Sort by
Same author

Associations between controlling nutritional status and mortality in osteoporosis: evidence from NHANES, 2005-2018.

Calcified tissue international·2026
Same author

Femoral Osteochondritis Dissecans and Tibial Osteochondral Defect in an Adult Revealed by Bone SPECT/CT.

Diagnostics (Basel, Switzerland)·2026
Same author

A novel linear indexing method for strings under all internal nodes in a suffix tree.

Frontiers in bioinformatics·2025
Same author

A novel lossless encoding algorithm for data compression-genomics data as an exemplar.

Frontiers in bioinformatics·2025
Same author

ERAMER: A novel in silico tool for prediction of ERAP1 enzyme trimming.

Journal of immunological methods·2024
Same author

Teenage Girl With a Painful Ankle.

Annals of emergency medicine·2023

Related Experiment Video

Updated: Mar 21, 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

7.8K

ET-Motif: Solving the Exact (l, d)-Planted Motif Problem Using Error Tree Structure.

Anas Al-Okaily1, Chun-Hsi Huang1

  • 1Computer Science & Engineering Department, University of Connecticut , Storrs, Connecticut.

Journal of Computational Biology : a Journal of Computational Molecular Cell Biology
|May 7, 2016
PubMed
Summary

We introduce ET-Motif, an efficient algorithm for the (l, d)-planted motif search (PMS) problem. ET-Motif significantly improves computational efficiency for discovering biological motifs in DNA sequences.

Keywords:
common neighbor.genome informaticsmotif search

More Related Videos

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

17.4K
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.8K

Related Experiment Videos

Last Updated: Mar 21, 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

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

17.4K
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.8K

Area of Science:

  • Bioinformatics
  • Computational Biology
  • Genomics

Background:

  • Motif finding is crucial for identifying regulatory elements like promoters and enhancers.
  • The (l, d)-planted motif search (PMS) is a key problem in computational biology.
  • Existing methods face challenges in efficiency and scalability for large datasets.

Purpose of the Study:

  • To develop an efficient algorithm for solving the (l, d)-planted motif search problem.
  • To analyze the time and space complexity of the proposed algorithm.
  • To extend the algorithm for variations like edit distance PMS and edited PMS.

Main Methods:

  • The study proposes the ET-Motif algorithm.
  • Analysis of time and space complexity using theoretical bounds.
  • Adaptation of ET-Motif for related motif search problems.

Main Results:

  • ET-Motif solves the PMS problem in O(nm) time and O(n) space.
  • Improved time complexity of O(n) is achievable with O(nm) space when using a balanced suffix tree.
  • The algorithm can be modified to solve edit distance PMS and edited PMS with controlled increases in complexity.

Conclusions:

  • ET-Motif offers a significant advancement in motif discovery efficiency.
  • The algorithm provides a flexible framework for various motif search challenges.
  • This work contributes to more effective analysis of genomic sequences and regulatory elements.