請用此 Handle URI 來引用此文件：
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/63145完整後設資料紀錄
| DC 欄位 | 值 | 語言 |
|---|---|---|
| dc.contributor.advisor | 劉長遠(Cheng-Yuan Liou) | |
| dc.contributor.author | Bo-Shiang Huang | en |
| dc.contributor.author | 黃柏翔 | zh_TW |
| dc.date.accessioned | 2021-06-16T16:24:57Z | - |
| dc.date.available | 2016-02-01 | |
| dc.date.copyright | 2013-02-01 | |
| dc.date.issued | 2013 | |
| dc.date.submitted | 2013-01-22 | |
| dc.identifier.citation | [1] Andrei E. Gabrielian and Alexander Bolshoy. Sequence complexity and DNA curvature.
Computers & Chemistry, 23(3-4):263–274, 1999. [2] 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. [3] Olga V. Kirillova. Entropy concepts and DNA investigations. 2000. [4] David Koslicki. Topological entropy of DNA sequences. Bioinformatics, 27(8):1061–1067, 2011. [5] Christos Koukouvinos, Veronika Pillwein, Dimitris E. Simos, and Zafeirakis Zafeirakopoulos. On the average complexity for the verification of compatible sequences. Inf. Process. Lett., 111(17):825–830, 2011. [6] Cheng-Yuan Liou, Tai-HeiWu, and Chia-Ying Lee. Modeling complexity in musical rhythm. Complexity, 15(4):19–30, 2010. [7] Sukanya Manna and Cheng-Yuan Liou. Reverse engineering approach in molecular evolution: Simulation and case study with enzyme proteins. In BIOCOMP, pages 529–533, 2006. [8] C. K. Peng, S. V. Buldyrev, A. L. Goldberger, S. Havlin, F. Sciortino, M. Simons, H. E. Stanley, et al. Long-range correlations in nucleotide sequences. Nature, 356(6365):168–170, 1992. [9] Kullback. S and Leibler. R.A. On information and sufficiency. Annals of Mathematical Statistics, 22(1):79–86, 1951. [10] Peter Ti˜no. Spatial representation of symbolic sequences through iterative function systems. Systems, Man and Cybernetics, Part A: Systems and Humans, IEEE Transactions on, 29(4):386–393, 1999. [11] E.N. Trifonov. Making sense of the human genome. In Structure and Methods: Human Genome Initiative and DNA Recombination, volume 1, pages 69–77. Adenine Press, 1990. [12] Olga G. Troyanskaya, Ora Arbell, Yair Koren, Gad M. Landau, and Alexander Bolshoy. Sequence complexity profiles of prokaryotic genomic sequences: A fast algorithm for calculating linguistic complexity. Bioinformatics, 18(5):679–688, 2002. [13] Terry A. Welch. A technique for high-performance data compression. IEEE Computer, 17(6):8–19, 1984. [14] Ren Zhang and Chun-Ting Zhang. Z curves, an intutive tool for visualizing and analyzing the DNA sequences. Journal of Biomolecular Structure and Dynamics, 11(4):767–782, 1994. | |
| dc.identifier.uri | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/63145 | - |
| dc.description.abstract | 本論文使用Lindenmayer系統來建造文本序列的樹狀結構，並且導
出其複雜度，此複雜度為文本序列的結構複雜度。我們使用不同編碼 方法將文本序列編碼成二進位字串，並且比較不同編碼方法所產生之 字串的複雜度。此外，我們也比較了兩個其他複雜度之計量方法，並 且探討如何利用我們的方法來偵測通訊異常的可能性。 | zh_TW |
| dc.description.abstract | This work uses the L-system to construct a tree structure for text sequence and derives its complexity [6]. This complexity serves as a measure of structural complexity of text sequence. We encode text sequences into binary strings and analyze their complexity between different encoding methods.
Besides we compare our methods to other measures of complexity [4, 12] and study the possibility of anomaly detection in Network by Kullback–Leibler divergence. | en |
| dc.description.provenance | Made available in DSpace on 2021-06-16T16:24:57Z (GMT). No. of bitstreams: 1 ntu-102-R98922104-1.pdf: 1925163 bytes, checksum: 728432b2df00421384c168120251790e (MD5) Previous issue date: 2013 | en |
| dc.description.tableofcontents | 致謝i
中文摘要iii Abstract v 1 Introduction 1 1.1 Transform binary string to rewriting rules . . . . . . . . . . . . . . . . . 1 1.2 Classify rewriting rules into different subsets . . . . . . . . . . . . . . . 2 1.3 Compute complexity based on classification . . . . . . . . . . . . . . . . 3 2 Encoding and Complexity 7 2.1 Introduction of LZW . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 2.2 Alignment of binary string element . . . . . . . . . . . . . . . . . . . . . 8 2.3 Result and Analysis . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 3 Compared to other Measures of Complexity 15 3.1 Topological entropy . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15 3.2 Linguistic complexity . . . . . . . . . . . . . . . . . . . . . . . . . . . . 16 3.3 Comparison and Analysis . . . . . . . . . . . . . . . . . . . . . . . . . . 16 4 Summary 23 Bibliography 25 | |
| dc.language.iso | zh-TW | |
| dc.subject | 編碼 | zh_TW |
| dc.subject | 序列 | zh_TW |
| dc.subject | L系統 | zh_TW |
| dc.subject | 結構複雜度 | zh_TW |
| dc.subject | 上下文無關文法 | zh_TW |
| dc.subject | Structural complexity | en |
| dc.subject | Encoding | en |
| dc.subject | Sequences | en |
| dc.subject | Context-free grammar | en |
| dc.subject | L-system | en |
| dc.title | 任意符號序列之語法敏感複雜度 | zh_TW |
| dc.title | Syntactic sensitive complexity for symbol-free sequence | en |
| dc.type | Thesis | |
| dc.date.schoolyear | 101-1 | |
| dc.description.degree | 碩士 | |
| dc.contributor.oralexamcommittee | 呂育道(Yuh-Dauh Lyuu),鄭為正,黃昭綺 | |
| dc.subject.keyword | 結構複雜度,編碼,序列,上下文無關文法,L系統, | zh_TW |
| dc.subject.keyword | Structural complexity,Encoding,Sequences,Context-free grammar,L-system, | en |
| dc.relation.page | 26 | |
| dc.rights.note | 有償授權 | |
| dc.date.accepted | 2013-01-22 | |
| dc.contributor.author-college | 電機資訊學院 | zh_TW |
| dc.contributor.author-dept | 資訊工程學研究所 | zh_TW |
| 顯示於系所單位： | 資訊工程學系 | |
文件中的檔案：
| 檔案 | 大小 | 格式 | |
|---|---|---|---|
| ntu-102-1.pdf 未授權公開取用 | 1.88 MB | Adobe PDF |
系統中的文件，除了特別指名其著作權條款之外，均受到著作權保護，並且保留所有的權利。