IRMA-International.org: Creator of Knowledge
Information Resources Management Association
Advancing the Concepts & Practices of Information Resources Management in Modern Organizations

Machine Learning Algorithms for Analysis of DNA Data Sets

Machine Learning Algorithms for Analysis of DNA Data Sets
View Sample PDF
Author(s): John Yearwood (Federation University, Australia), Adil Bagirov (University of Ballarat, Australia)and Andrei V. Kelarev (University of Ballarat, Australia)
Copyright: 2012
Pages: 12
Source title: Machine Learning Algorithms for Problem Solving in Computational Applications: Intelligent Techniques
Source Author(s)/Editor(s): Siddhivinayak Kulkarni (University of Ballarat, Australia)
DOI: 10.4018/978-1-4666-1833-6.ch004

Purchase

View Machine Learning Algorithms for Analysis of DNA Data Sets on the publisher's website for pricing and purchasing information.

Abstract

The applications of machine learning algorithms to the analysis of data sets of DNA sequences are very important. The present chapter is devoted to the experimental investigation of applications of several machine learning algorithms for the analysis of a JLA data set consisting of DNA sequences derived from non-coding segments in the junction of the large single copy region and inverted repeat A of the chloroplast genome in Eucalyptus collected by Australian biologists. Data sets of this sort represent a new situation, where sophisticated alignment scores have to be used as a measure of similarity. The alignment scores do not satisfy properties of the Minkowski metric, and new machine learning approaches have to be investigated. The authors’ experiments show that machine learning algorithms based on local alignment scores achieve very good agreement with known biological classes for this data set. A new machine learning algorithm based on graph partitioning performed best for clustering of the JLA data set. Our novel k-committees algorithm produced most accurate results for classification. Two new examples of synthetic data sets demonstrate that the authors’ k-committees algorithm can outperform both the Nearest Neighbour and k-medoids algorithms simultaneously.

Related Content

Bhargav Naidu Matcha, Sivakumar Sivanesan, K. C. Ng, Se Yong Eh Noum, Aman Sharma. © 2023. 60 pages.
Lavanya Sendhilvel, Kush Diwakar Desai, Simran Adake, Rachit Bisaria, Hemang Ghanshyambhai Vekariya. © 2023. 15 pages.
Jayanthi Ganapathy, Purushothaman R., Ramya M., Joselyn Diana C.. © 2023. 14 pages.
Prince Rajak, Anjali Sagar Jangde, Govind P. Gupta. © 2023. 14 pages.
Mustafa Eren Akpınar. © 2023. 9 pages.
Sreekantha Desai Karanam, Krithin M., R. V. Kulkarni. © 2023. 34 pages.
Omprakash Nayak, Tejaswini Pallapothala, Govind P. Gupta. © 2023. 19 pages.
Body Bottom