透過您的圖書館登入
IP:3.137.180.32
  • 學位論文

時間序列的複雜度

Complexity of time series

指導教授 : 劉長遠

摘要


複雜度分析是現代分子生物學中的一個重要領域。目前有許多的工 具和技術可以來幫助我們測量序列整體的結構特性。本篇論文中,我 們介紹一個方法來計算序列的複雜度。先前的研究可應用在DNA序列 和文本序列中。基於這些成果,我們運用此方法來計算時間序列的複 雜度。計算時間序列複雜度的方式為將時間序列轉換成兩個符號的序 列或四個符號的序列並且計算其複雜度。並且,我們也比較不同的時 間序列的複雜度來觀查它們之間的關係。我們分析了幾個實驗並顯示 其結果。

並列摘要


Complexity analysis is an important field in modern molecular biology. There are many tools and techniques to help us measure the overall structural property of sequences. In this thesis, we introduce a method to compute the sequence complexity. Previously works can be applying on DNA sequence and text sequence. Based on these achievements, we use the method to compute the complexity for time series. The way for complexity of time series is translating time series into two-symbol sequence or four-symbol sequence and computing the complexity. And, we also compare the complexity for different time series to see their relation. We analyze several experiments and show the result.

參考文獻


[1] Bai-Lin Hao, H.C. Lee, and Shu-Yu Zhang. Fractals related to long DNA sequences
and complete genomes. Chaos, Solitons & Fractals, 11(6):825–836, 2000.
[2] David Koslicki. Topological entropy of DNA sequences. Bioinformatics,
27(8):1061–1067, 2011.
[3] Cheng-Yuan Liou, Tai-HeiWu, and Chia-Ying Lee. Modeling complexity in musical

延伸閱讀


國際替代計量