{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:56:13Z","timestamp":1725476173458},"publisher-location":"Berlin, Heidelberg","reference-count":39,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540689553"},{"type":"electronic","value":"9783540689577"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11961239_17","type":"book-chapter","created":{"date-parts":[[2006,12,6]],"date-time":"2006-12-06T11:28:34Z","timestamp":1165404514000},"page":"187-198","source":"Crossref","is-referenced-by-count":11,"title":["A New Model for Classifying DNA Code Inspired by Neural Networks and FSA"],"prefix":"10.1007","author":[{"given":"Byeong","family":"Kang","sequence":"first","affiliation":[]},{"given":"Andrei","family":"Kelarev","sequence":"additional","affiliation":[]},{"given":"Arthur","family":"Sale","sequence":"additional","affiliation":[]},{"given":"Ray","family":"Williams","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","volume-title":"Bioinformatics : The Machine Learning Approach","author":"P. Baldi","year":"2001","unstructured":"Baldi, P., Brunak, S.: Bioinformatics: The Machine Learning Approach. MIT Press, Cambridge (2001)"},{"key":"17_CR2","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. The MIT Press, Cambridge (2001)"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"Dazeley, R.P., Kang, B.H.: Weighted MCRDR: deriving information about relationships between classifications. In: MCRDR, AI\u00a02003: Advances in Artificial Intelligence, Perth, Australia, pp. 245\u2013255 (2003)","DOI":"10.1007\/978-3-540-24581-0_21"},{"key":"17_CR4","unstructured":"Dazeley, R.P., Kang, B.H.: An online classification and prediction hybrid system for knowledge discovery in databases. In: Proc. AISAT 2004, The 2nd Internat. Conf. Artificial Intelligence in Science and Technology, Hobart, Tasmania, pp. 114\u2013119 (2004)"},{"key":"17_CR5","volume-title":"Biological Sequence Analysis","author":"R. Durbin","year":"1999","unstructured":"Durbin, R., Eddy, S.R., Krogh, A., Mitchison, G.: Biological Sequence Analysis. Cambridge University Press, Cambridge (1999)"},{"key":"17_CR6","volume-title":"Automata, Languages, and Machines","author":"S. Eilenberg","year":"1974","unstructured":"Eilenberg, S.: Automata, Languages, and Machines, vol.\u00a0A,B. Academic Press, New York (1974)"},{"key":"17_CR7","unstructured":"Gallian, J.A.: Graph labeling. Electronic J. Combinatorics, Dynamic Survey DS6, 148 (January 20, 2005), \n                      \n                        http:\/\/www.combinatorics.org"},{"key":"17_CR8","volume-title":"Computer Science and Computational Biology","author":"D. Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on Strings, Trees, and Sequences. In: Computer Science and Computational Biology, Cambridge University Press, Cambridge (1997)"},{"key":"17_CR9","unstructured":"Holub, J., Iliopoulos, C.S., Melichar, B., Mouchard, L.: Distributed string matching using finite automata, Combinatorial Algorithms. In: AWOCA 1999, Perth, pp. 114\u2013127 (1999)"},{"key":"17_CR10","volume-title":"An Introduction to Bioinformatics Algorithms","author":"N.C. Jones","year":"2004","unstructured":"Jones, N.C., Pevzner, P.A.: An Introduction to Bioinformatics Algorithms. MIT Press, Cambridge (2004), \n                      \n                        http:\/\/www.bioalgorithms.info\/"},{"key":"17_CR11","unstructured":"Kang, B.H.: Pacific Knowledge Acquisition Workshop, Auckland, New Zealand (2004)"},{"key":"17_CR12","volume-title":"Ring Constructions and Applications","author":"A.V. Kelarev","year":"2002","unstructured":"Kelarev, A.V.: Ring Constructions and Applications. World Scientific, Singapore (2002)"},{"key":"17_CR13","doi-asserted-by":"crossref","DOI":"10.1201\/9781482276367","volume-title":"Graph Algebras and Automata","author":"A.V. Kelarev","year":"2003","unstructured":"Kelarev, A.V.: Graph Algebras and Automata. Marcel Dekker, New York (2003)"},{"key":"17_CR14","unstructured":"Kelarev, A.V., Miller, M., Sokratova, O.V.: Directed graphs and closure properties for languages. In: Baskoro, E.T. (ed.) Proc.12 Australasian Workshop on Combinatorial Algorithms, Putri Gunung Hotel, Lembang, Bandung, Indonesia, July 14\u201317, pp. 118\u2013125 (2001)"},{"issue":"1","key":"17_CR15","first-page":"46","volume":"54","author":"A.V. Kelarev","year":"2005","unstructured":"Kelarev, A.V., Miller, M., Sokratova, O.V.: Languages recognized by two-sided automata of graphs. Proc. Estonian Akademy of Science\u00a054(1), 46\u201354 (2005)","journal-title":"Proc. Estonian Akademy of Science"},{"key":"17_CR16","first-page":"45","volume":"15","author":"A.V. Kelarev","year":"2001","unstructured":"Kelarev, A.V., Sokratova, O.V.: Languages recognized by a class of finite automata. Acta Cybernetica\u00a015, 45\u201352 (2001)","journal-title":"Acta Cybernetica"},{"issue":"3","key":"17_CR17","first-page":"305","volume":"6","author":"A.V. Kelarev","year":"2001","unstructured":"Kelarev, A.V., Sokratova, O.V.: Directed graphs and syntactic algebras of tree languages. J. Automata, Languages & Combinatorics\u00a06(3), 305\u2013311 (2001)","journal-title":"J. Automata, Languages & Combinatorics"},{"issue":"12","key":"17_CR18","doi-asserted-by":"publisher","first-page":"1317","DOI":"10.1080\/00207160214649","volume":"79","author":"A.V. Kelarev","year":"2002","unstructured":"Kelarev, A.V., Sokratova, O.V.: Two algorithms for languages recognized by graph algebras. Internat. J. Computer Math.\u00a079(12), 1317\u20131327 (2002)","journal-title":"Internat. J. Computer Math."},{"key":"17_CR19","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/S0304-3975(02)00544-3","volume":"301","author":"A.V. Kelarev","year":"2003","unstructured":"Kelarev, A.V., Sokratova, O.V.: On congruences of automata defined by directed graphs. Theoret. Computer Science\u00a0301, 31\u201343 (2003)","journal-title":"Theoret. Computer Science"},{"key":"17_CR20","doi-asserted-by":"crossref","unstructured":"Kelarev, A.V., Trotter, P.G.: A combinatorial property of automata, languages and their syntactic monoids. In: Proceedings of the Internat. Conf. Words, Languages and Combinatorics\u00a0III, Kyoto, Japan, pp. 228\u2013239 (2003)","DOI":"10.1142\/9789812704979_0018"},{"key":"17_CR21","unstructured":"Lee, K.H., Kay, J., Kang, B.H.: Keyword association network: a statistical multi-term indexing approach for document categorization. In: Proc. Fifth Australasian Document Computing Symposium, Brisbane, Australia, pp. 9\u201316 (2000)"},{"key":"17_CR22","unstructured":"Lee, K., Kay, J., Kang, B.H.: KAN and RinSCut: lazy linear classifier and rank-in-score threshold in similarity-based text categorization. In: Proc. ICML-2002 Workshop on Text Learning, University of New South Wales, Sydney, Australia, pp. 36\u201343 (2002)"},{"key":"17_CR23","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1007\/3-540-45683-X_48","volume-title":"PRICAI 2002: Trends in Artificial Intelligence","author":"K.H. Lee","year":"2002","unstructured":"Lee, K.H., Kay, J., Kang, B.H., Rosebrock, U.: A Comparative Study on Statistical Machine Learning Algorithms and Thresholding Strategies for Automatic Text Categorization. In: Ishizuka, M., Sattar, A. (eds.) PRICAI 2002. LNCS (LNAI), vol.\u00a02417, pp. 444\u2013453. Springer, Heidelberg (2002)"},{"key":"17_CR24","doi-asserted-by":"crossref","unstructured":"Lee, K.H., Kang, B.H.: A new framework for uncertainty sampling: exploiting uncertain and positive-certain examples in similarity-based text classification. In: Proc. Internat. Conf. on Information Technology: Coding and Computing (ITCC 2004), Las Vegas, Nevada, p. 12 (2004)","DOI":"10.1109\/ITCC.2004.1286699"},{"key":"17_CR25","volume-title":"Artificial Intelligence. Structures and Strategies for Complex Problem Solving","author":"G.F. Luger","year":"2005","unstructured":"Luger, G.F.: Artificial Intelligence. Structures and Strategies for Complex Problem Solving. Addison-Wesley, Reading (2005)"},{"key":"17_CR26","unstructured":"Mount, D.: Bioinformatics: Sequence and Genome Analysis, Cold Spring Harbor Laboratory (2001), \n                      \n                        http:\/\/www.bioinformaticsonline.org\/"},{"key":"17_CR27","doi-asserted-by":"crossref","unstructured":"Park, S.S., Kim, Y., Park, G., Kang, B.H., Compton, P.: Automated information mediator for HTML and XML Based Web information delivery service. In: Proc. 18th Australian Joint Conf. on Artificial Intelligence, Sydney, pp. 401\u2013404 (2005)","DOI":"10.1007\/11589990_42"},{"key":"17_CR28","first-page":"202","volume":"2","author":"G.S. Park","year":"2005","unstructured":"Park, G.S., Kim, Y.S., Kang, B.H.: Synamic mobile content adaptation according to various delivery contexts. J. Security Engineering\u00a02, 202\u2013208 (2005)","journal-title":"J. Security Engineering"},{"key":"17_CR29","first-page":"163","volume":"2","author":"G.S. Park","year":"2005","unstructured":"Park, G.S., Kim, Y.T., Kim, Y., Kang, B.H.: SOAP message processing performance enhancement by simplifying system architecture. J. Security Engineering\u00a02, 163\u2013170 (2005)","journal-title":"J. Security Engineering"},{"key":"17_CR30","first-page":"186","volume":"2","author":"G.S. Park","year":"2005","unstructured":"Park, G.S., Park, S., Kim, Y., Kang, B.H.: Intelligent web document classification using incrementally changing training data Set. J. Security Engineering\u00a02, 186\u2013191 (2005)","journal-title":"J. Security Engineering"},{"key":"17_CR31","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-62844-4","volume-title":"New Trends in Formal Languages","author":"G. P\u0103un","year":"1997","unstructured":"P\u0103un, G., Salomaa, A.: New Trends in Formal Languages. Springer, Berlin (1997)"},{"key":"17_CR32","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/11589990_21","volume-title":"AI 2005: Advances in Artificial Intelligence","author":"M. Petrovskiy","year":"2005","unstructured":"Petrovskiy, M.: Probability Estimation in Error Correcting Output Coding Framework Using Game Theory. In: Zhang, S., Jarvis, R. (eds.) AI 2005. LNCS (LNAI), vol.\u00a03809, pp. 186\u2013196. Springer, Heidelberg (2005)"},{"key":"17_CR33","series-title":"Lecture Notes in Computer Science","volume-title":"Formal Properties of Finite Automata and Applications","year":"1989","unstructured":"Pin, J.E. (ed.): LITP 1988. LNCS, vol.\u00a0386. Springer, Heidelberg (1989)"},{"key":"17_CR34","volume-title":"Word, Language, Grammar","author":"G. Rozenberg","year":"1997","unstructured":"Rozenberg, G., Salomaa, A.: Handbook of Formal Languages. In: Word, Language, Grammar, vol.\u00a01, Springer, Berlin (1997)"},{"key":"17_CR35","volume-title":"Computing Patterns in Strings","author":"B. Smyth","year":"2003","unstructured":"Smyth, B.: Computing Patterns in Strings. Addison-Wesley, Reading (2003)"},{"key":"17_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/978-3-540-30540-8_23","volume-title":"Combinatorial Geometry and Graph Theory","author":"M. Tuga","year":"2005","unstructured":"Tuga, M., Miller, M.: \u0394-Optimum Exclusive Sum Labeling of Certain Graphs with Radius One. In: Akiyama, J., Baskoro, E.T., Kano, M. (eds.) IJCCGGT 2003. LNCS, vol.\u00a03330, pp. 216\u2013225. Springer, Heidelberg (2005)"},{"key":"17_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/978-3-540-30540-8_19","volume-title":"Combinatorial Geometry and Graph Theory","author":"K.A. Sugeng","year":"2005","unstructured":"Sugeng, K.A., Miller, M., Slamin, Ba\u010da, M.: ( a, d)-Edge-Antimagic Total Labelings of Caterpillars. In: Akiyama, J., Baskoro, E.T., Kano, M. (eds.) IJCCGGT 2003. LNCS, vol.\u00a03330, pp. 169\u2013180. Springer, Heidelberg (2005)"},{"key":"17_CR38","volume-title":"Algorithms and Complexity","author":"J. Leeuwen van","year":"1990","unstructured":"van Leeuwen, J.: Handbook of Theoretical Computer Science. In: Algorithms and Complexity, vol.\u00a0A,B, Elsevier, Amsterdam (1990)"},{"key":"17_CR39","volume-title":"Data Mining: Practical Machine Learning Tools and Techniques with Java Implementations","author":"I.H. Witten","year":"2005","unstructured":"Witten, I.H., Frank, E.: Data Mining: Practical Machine Learning Tools and Techniques with Java Implementations. Morgan Kaufmann, San Francisco (2005)"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Acquisition and Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11961239_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:22:03Z","timestamp":1619508123000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11961239_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540689553","9783540689577"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/11961239_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}