A new model for classifying DNA code inspired by neural networks and FSA

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4303 LNAI, Issue , 2006, Pages 187-198

  Kang, Byeong ^a   Kelarev, Andrei ^a   Sale, Arthur ^a   Williams, Ray ^a  

^a UNIVERSITY OF TASMANIA   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

DNA; DNA SEQUENCES; GENE ENCODING; KNOWLEDGE ACQUISITION; NETWORK CODING;

CLASSIFICATION TASKS; DNA CODES; MINIMISATION;

CLASSIFICATION (OF INFORMATION);

EID: 85006288116     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11961239_17     Document Type: Conference Paper

References (39)

1. Baldi, P. and Brunak, S.: “Bioinformatics: The Machine Learning Approach”. Cambridge, Mass, MIT Press, (2001).
2. Cormen, T.H., Leiserson, C.E., Rivest, R.L. and Stein, C.: “Introduction to Algorithms”, The MIT Press, Cambridge, 2001.
3. Dazeley, R.P., Kang, B.H.: Weighted MCRDR: deriving information about relationships between classifications in MCRDR, AI 2003: Advances in Artificial Intelligence, Perth, Australia, 2003, 245–255.
4. Dazeley, R.P., Kang, B.H.: An online classification and prediction hybrid system for knowledge discovery in databases, Proc. AISAT 2004, The 2nd Internat. Conf. Artificial Intelligence in Science and Technology, Hobart, Tasmania, 2004, 114–119.
5. Durbin, R., Eddy, S.R., Krogh, A. and Mitchison, G.: “Biological Sequence Analysis”. Cambridge University Press (1999).
6. Eilenberg, S.: “Automata, Languages, and Machines”. Vol. A,B, Academic Press, New York, 1974.
7. Gallian, J.A.: Graph labeling, Electronic J. Combinatorics, Dynamic Survey DS6, January 20, 2005, 148pp, www.combinatorics.org
8. Gusfield, D.: “Algorithms on Strings, Trees, and Sequences”, Computer Science and Computational Biology, Cambridge University Press, Cambridge, 1997.
9. Holub, J., Iliopoulos, C.S., Melichar, B. Mouchard, L.: Distributed string matching using finite automata, “Combinatorial Algorithms”. AWOCA 99, Perth, 114–127.
10. Jones, N.C. and Pevzner, P.A.: An Introduction to Bioinformatics Algorithms. Cambridge, Mass, MIT Press, (2004). http://www.bioalgorithms.info/
11. Kang, B.H.: “Pacific Knowledge Acquisition Workshop”. Auckland, New Zealand, 2004.
12. Kelarev, A.V.: “Ring Constructions and Applications”. World Scientific, 2002.
13. Kelarev, A.V.: “Graph Algebras and Automata”. Marcel Dekker, 2003.
14. Kelarev, A.V., Miller, M. and Sokratova, O.V.: Directed graphs and closure properties for languages. “Proc.12 Australasian Workshop on Combinatorial Algorithms” (Ed. E.T. Baskoro), Putri Gunung Hotel, Lembang, Bandung, Indonesia, July 14–17, 2001, 118–125.
15. Kelarev, A.V., Miller, M. and Sokratova, O.V.: Languages recognized by two-sided automata of graphs. Proc. Estonian Akademy of Science 54 (2005) (1), 46–54.
16. Kelarev, A.V. and Sokratova, O.V.: Languages recognized by a class of finite automata. Acta Cybernetica 15 (2001), 45–52.
17. Kelarev, A.V. and Sokratova, O.V.: Directed graphs and syntactic algebras of tree languages. J. Automata, Languages & Combinatorics 6 (2001)(3), 305–311.
18. Kelarev, A.V. and Sokratova, O.V.: Two algorithms for languages recognized by graph algebras. Internat. J. Computer Math. 79 (2002)(12) 1317–1327.
19. Kelarev, A.V. and Sokratova, O.V.: On congruences of automata defined by directed graphs. Theoret. Computer Science 301 (2003), 31–43.
20. Kelarev, A.V. and Trotter, P.G.: A combinatorial property of automata, languages and their syntactic monoids. Proceedings of the Internat. Conf. Words, Languages and Combinatorics III, Kyoto, Japan, 2003, 228–239.
21. Lee, K.H., Kay, J., Kang, B.H.: Keyword association network: a statistical multiterm indexing approach for document categorization. Proc. Fifth Australasian Document Computing Symposium, Brisbane, Australia, (2000) 9-16.
22. Lee, K., Kay, J., Kang, B.H.: KAN and RinSCut: lazy linear classifier and rank-inscore threshold in similarity-based text categorization. Proc. ICML-2002 Workshop on Text Learning, University of New South Wales, Sydney, Australia, 36-43 (2002)
23. 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. Proc. PRICAI 2002, Tokyo, Japan, (2002) 444–453.
24. Lee, K.H., Kang, B.H.: A new framework for uncertainty sampling: exploiting uncertain and positive-certain examples in similarity-based text classification. Proc. Internat. Conf. on Information Technology: Coding and Computing (ITCC2004), Las Vegas, Nevada, 2004, 12pp.
25. Luger, G.F, “Artificial Intelligence. Structures and Strategies for Complex Problem Solving”. Addison-Wesley, 2005.
26. Mount, D.: “Bioinformatics: Sequence and Genome Analysis”. Cold Spring Harbor Laboratory, (2001). http://www.bioinformaticsonline.org/
27. Park, S.S., Kim, Y., Park, G., Kang, B.H., Compton, P.: Automated information mediator for HTML and XML Based Web information delivery service. Proc. 18th Australian Joint Conf. on Artificial Intelligence, Sydney, 2005, 401–404.
28. Park, G.S., Kim, Y.S., Kang, B.H.: Synamic mobile content adaptation according to various delivery contexts. J. Security Engineering 2 (2005) 202-208.
29. Park, G.S., Kim, Y.T., Kim, Y., Kang, B.H.: SOAP message processing performance enhancement by simplifying system architecture. J. Security Engineering 2 (2005) 163–170.
30. Park, G.S., Park, S., Kim, Y., Kang, B.H.: Intelligent web document classification using incrementally changing training data Set, J. Security Engineering 2 (2005) 186–191.
31. Păun, G. and Salomaa, A.: “New Trends in Formal Languages”. Springer-Verlag, Berlin, 1997.
32. Petrovskiy, M.: Probability estimation in error correcting output coding framework using game theory. AI 2005: Advances in Artificial Intelligence, Sydney, Australia, 2005, Lect. Notes Artificial Intelligence 3809 (2005) 186–196.
33. Pin, J.E.: “Formal Properties of Finite Automata and Applications”. Lect. Notes Computer Science 386, Springer, New York, 1989.
34. Rozenberg, G. and Salomaa, A.: “Handbook of Formal Languages”. Vol. 1, Word, Language, Grammar, Springer-Verlag, Berlin, 1997.
35. Smyth, B.: “Computing Patterns in Strings”. Addison-Wesley, 2003.
36. Sugeng, K.A., Miller, M., Slamin and Bača, M.: (a, d)-edge-antimagic total labelings of caterpillars. Lecture Notes in Comput. Sci. 3330 (2005) 169–180.
37. Tuga, M. and Miller, M.: Δ-optimum exclusive sum labeling of certain graphs with radius one. Lecture Notes in Comput. Sci. 3330 (2005) 216–225.
38. van Leeuwen, J.: “Handbook of Theoretical Computer Science”. Vol. A,B, Algorithms and Complexity. Elsevier, Amsterdam, 1990.
39. Witten, I.H. and Frank, E.: “Data Mining: Practical Machine Learning Tools and Techniques with Java Implementations”. Morgan Kaufmann, 2005.