Using extremal events to characterize noisy time series

被引:0
作者
Eric Berry
Bree Cummins
Robert R. Nerem
Lauren M. Smith
Steven B. Haase
Tomas Gedeon
机构
[1] Montana State University,Department of Mathematical Sciences
[2] Duke University,Biology Department
来源
Journal of Mathematical Biology | 2020年 / 80卷
关键词
Time series; Merge trees; Order of extrema; Partial orders; 05C12; 06A06; 37M10;
D O I
暂无
中图分类号
学科分类号
摘要
Experimental time series provide an informative window into the underlying dynamical system, and the timing of the extrema of a time series (or its derivative) contains information about its structure. However, the time series often contain significant measurement errors. We describe a method for characterizing a time series for any assumed level of measurement error ε\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\varepsilon $$\end{document} by a sequence of intervals, each of which is guaranteed to contain an extremum for any function that ε\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\varepsilon $$\end{document}-approximates the time series. Based on the merge tree of a continuous function, we define a new object called the normalized branch decomposition, which allows us to compute intervals for any level ε\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\varepsilon $$\end{document}. We show that there is a well-defined total order on these intervals for a single time series, and that it is naturally extended to a partial order across a collection of time series comprising a dataset. We use the order of the extracted intervals in two applications. First, the partial order describing a single dataset can be used to pattern match against switching model output (Cummins et al. in SIAM J Appl Dyn Syst 17(2):1589–1616, 2018), which allows the rejection of a network model. Second, the comparison between graph distances of the partial orders of different datasets can be used to quantify similarity between biological replicates.
引用
收藏
页码:1523 / 1557
页数:34
相关论文
共 152 条
  • [1] Akutsu T(2000)Inferring qualitative relations in genetic networks and metabolic pathways Bioinformatics 16 727-734
  • [2] Miyano S(2007)Network inference, analysis, and modeling in systems biology Plant Cell 19 3327-3338
  • [3] Kuhara S(2013)Introduction to focus issue: quantitative approaches to genetic networks Chaos 23 025001-165
  • [4] Albert R(2011)Learning genetic regulatory network connectivity from time series data IEEE/ACM Trans Comput Biol Bioinform 8 152-3937
  • [5] Albert R(2014)Checkpoints couple transcription network oscillator dynamics to cell-cycle progression Genome Biol 15 446-1067
  • [6] Collins JJ(2016)Discovering governing equations from data by sparse identification of nonlinear dynamical systems Proc Natl Acad Sci 113 3932-308
  • [7] Glass L(2011)Recent advances in graph-based pattern recognition with applications in document analysis Pattern Recognit 44 1057-298
  • [8] Barker NA(2009)Topology and data Bull Am Math Soc (NS) 46 255-381
  • [9] Myers CJ(2017)Reverse engineering highlights potential principles of large gene regulatory network design and learning NPJ Syst Biol Appl 18 265-2212
  • [10] Kuwahara H(2017)Reconciling conflicting models for global control of cell-cycle transcription Cell Cycle 14 335-1616