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

Discrete-Time Fourier Series01:20

Discrete-Time Fourier Series

The Discrete-Time Fourier Series (DTFS) is a fundamental concept in signal processing, serving as the discrete-time counterpart to the continuous-time Fourier series. It allows for the representation and analysis of discrete-time periodic signals in terms of their frequency components. Unlike its continuous counterpart, which utilizes integrals, the calculation of DTFS expansion coefficients involves summations due to the discrete nature of the signal.
For a discrete-time periodic signal x[n]...
Downsampling01:20

Downsampling

When considering a sampled sequence with zero values between sampling instants, one can replace it by taking every N-th value of the sequence. At these integer multiples of N, the original and sampled sequences coincide. This process, known as decimation, involves extracting every N-th sample from a sequence, thereby creating a more efficient sequence.
The Fourier transform of the decimated sequence reveals a combination of scaled and shifted versions of the original spectrum. This...
Discrete Fourier Transform01:15

Discrete Fourier Transform

The Discrete Fourier Transform (DFT) is a fundamental tool in signal processing, extending the discrete-time Fourier transform by evaluating discrete signals at uniformly spaced frequency intervals. This transformation converts a finite sequence of time-domain samples into frequency components, each representing complex sinusoids ordered by frequency. The DFT translates these sequences into the frequency domain, effectively indicating the magnitude and phase of each frequency component present...
Discrete-time Fourier transform01:26

Discrete-time Fourier transform

The Discrete-Time Fourier Transform (DTFT) is an essential mathematical tool for analyzing discrete-time signals, converting them from the time domain to the frequency domain. This transformation allows for examining the frequency components of discrete signals, providing insights into their spectral characteristics. In the DTFT, the continuous integral used in the continuous-time Fourier transform is replaced by a summation to accommodate the discrete nature of the signal.
One of the notable...
Basic Discrete Time Signals01:16

Basic Discrete Time Signals

The unit step sequence is defined as 1 for zero and positive values of the integer n. This sequence can be graphically displayed using a set of eight sample points, showing a step function starting from n=0 and remaining constant thereafter.
The unit impulse or sample sequence is mathematically expressed as zero for all n values except at n=0, where it is one. The unit impulse sequence, denoted by δ(n), is the first difference of the unit step sequence, while the unit step sequence u(n) is the...
Convergence of Fourier Series01:21

Convergence of Fourier Series

The Fourier series is a powerful mathematical tool for representing periodic signals as an infinite sum of complex exponentials. In practice, this infinite series is truncated to a finite number of terms, yielding a partial sum. This truncation makes the approximation of the signal feasible but introduces certain challenges, particularly near discontinuities, known as the Gibbs phenomenon.
The Gibbs phenomenon refers to the persistent oscillations and overshoots that occur near discontinuities...

You might also read

Related Articles

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

Sort by
Same author

Predictive modeling in biology and medicine: Digital twins and multi-scale modeling.

PLoS computational biology·2026
Same author

From FAIR to CURE: guidelines for computational models of biological systems.

NPJ systems biology and applications·2026
Same author

Dynamics of attractor transitions in Boolean networks under noise.

Chaos (Woodbury, N.Y.)·2026
Same author

Digital Twins are a Key Enabling Technology for Personalized Medicine.

Bulletin of mathematical biology·2026
Same author

The role of digital twins in P4 medicine: A paradigm for modern healthcare.

NPJ digital medicine·2025
Same author

Upper bound for the stability of Boolean networks.

Physical review. E·2025
Same journal

Mosquito Species and Gender Identification System Based on Artificial Intelligence and Image Processing Methods.

Journal of computational biology : a journal of computational molecular cell biology·2026
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
See all related articles

Related Experiment Video

Updated: Jun 11, 2026

Troubleshooting and Quality Assurance in Hyperpolarized Xenon Magnetic Resonance Imaging: Tools for High-Quality Image Acquisition
09:55

Troubleshooting and Quality Assurance in Hyperpolarized Xenon Magnetic Resonance Imaging: Tools for High-Quality Image Acquisition

Published on: January 5, 2024

Discretization of time series data.

Elena S Dimitrova1, M Paola Vera Licona, John McGee

  • 1Department of Mathematical Sciences, Clemson University, Clemson, South Carolina 29634-0975, USA. edimit@clemson.edu

Journal of Computational Biology : a Journal of Computational Molecular Cell Biology
|June 30, 2010
PubMed
Summary
This summary is machine-generated.

A new discretization algorithm, SSD, improves biochemical network inference from continuous experimental data. SSD outperforms other methods for short time series, preserving dynamics and noise robustness.

More Related Videos

Alignment of Synchronized Time-Series Data Using the Characterizing Loss of Cell Cycle Synchrony Model for Cross-Experiment Comparisons
07:59

Alignment of Synchronized Time-Series Data Using the Characterizing Loss of Cell Cycle Synchrony Model for Cross-Experiment Comparisons

Published on: June 9, 2023

Related Experiment Videos

Last Updated: Jun 11, 2026

Troubleshooting and Quality Assurance in Hyperpolarized Xenon Magnetic Resonance Imaging: Tools for High-Quality Image Acquisition
09:55

Troubleshooting and Quality Assurance in Hyperpolarized Xenon Magnetic Resonance Imaging: Tools for High-Quality Image Acquisition

Published on: January 5, 2024

Alignment of Synchronized Time-Series Data Using the Characterizing Loss of Cell Cycle Synchrony Model for Cross-Experiment Comparisons
07:59

Alignment of Synchronized Time-Series Data Using the Characterizing Loss of Cell Cycle Synchrony Model for Cross-Experiment Comparisons

Published on: June 9, 2023

Area of Science:

  • Computational Biology
  • Systems Biology
  • Bioinformatics

Background:

  • Biochemical network inference algorithms often require discrete data.
  • Experimental data is typically continuous, necessitating data transformation.
  • Effective discretization is vital for preserving variable dependencies and inference accuracy.

Purpose of the Study:

  • To compare the performance of different discretization algorithms for biochemical network inference.
  • To introduce and evaluate a novel discretization algorithm, SSD, designed for short time series data.

Main Methods:

  • Comparison of quantile, interval discretization, and the new SSD algorithm.
  • Evaluation using two network inference methods: dynamic Bayesian networks and discrete dynamical systems.
  • SSD's ability to determine the optimal number of discretization states was assessed.

Main Results:

  • Both inference methods performed better using the SSD discretization algorithm compared to quantile and interval methods.
  • SSD demonstrated robustness to noise in experimental data.
  • SSD effectively preserved the dynamic features of time series data.

Conclusions:

  • The SSD algorithm is a superior method for discretizing continuous data for biochemical network inference, especially for short time series.
  • SSD enhances the performance of network inference algorithms by preserving crucial data dynamics and offering noise resilience.