Page 1 of 12Free preview · 1–5

About this document

Published in Malaysian Journal of Science 45(2), pages 1 - 12 (June 2026), this study evaluates machine learning methods for classifying human, chimpanzee, and dog DNA sequences using six-base k-mer encoding. It compares naive Bayes, weighted naive Bayes, random forest, K-nearest neighbour, and decision tree classifiers. Naive Bayes achieves reported classification accuracies of 98.4% for human, 91.4% for chimpanzee, and 68.9% for dog datasets. A weighted naive Bayes model trained on human data reports prediction accuracies of 99.3% for chimpanzee and 92.6% for dog sequences. The authors discuss evolutionary relationships, dataset characteristics, and opportunities for improved feature engineering and algorithm selection.

Free preview text

The first 5 pages, shown as text so search engines and readers can find this document.

Page 1

1 Regular Issue Malaysian Journal of Science 45(2): 1-12 (June 2026) https://mjs.um.edu.my DOI:https//doi.org/10.22452/mjs.vol45no2.1 Malaysian Journal of Science 45(2): 1-12 (June 2026) Predicting DNA Sequence Similarity Across Species Using Machine Learning: a K-mer Based Approach Vinodkumar R. Patil1a*, Archana S. Vaidya2a and Manisha S. Patil3b Abstract: This study examines the effectiveness of machine learning methods for categorizing DNA sequences across human, chimpanzee, and dog samples. We employed k-mer encoding to renovate DNA structures into numerical representations suitable for machine learning models. Four classifiers, such as naive bayes and weighted naive bayes, random forest, K-nearest neighbors, and decision tree, were applied and evaluated using accuracy, precision, recall, and F1-score. The naive bayes classifier consistently outperformed the others across all three datasets, achieving the highest accuracy in classifying human DNA (98.4%), followed by chimpanzee DNA (91.4%), and exhibiting significantly lower accuracy for dog DNA (68.9%). This performance disparity is attributed to the increasing evolutionary distance from human DNA. Additionally, a weighted naive bayes model that was trained on human data showed very high accuracy in predicting chimpanzee (99.3%) and dog (92.6%) DNA sequences. The results presented here show the significance of taking into account evolutionary relations and dataset features whenever developing and training classification models for genetic sequence analysis. The research extends the present research by evaluating the performance of several different algorithms on separate DNA databases, identifying strengths and weaknesses, and suggesting avenues for future research focusing on advanced feature engineering and algorithm selection for improved cross-species classification. Keywords: DNA classification, machine learning, K-mer, naive bayes. 1. Introduction DNA is a hereditary molecule found in every living species that determines the basic characteristics of bodies and acts as a genomic scheme for a progressing organism. It is comprised of a phosphate category, a sugar category, and nitrogenous compounds (adenine, cytosine, guanine, and thymine) that make up its double-stranded molecule. DNA analysis is decisive in the recognition of diseases, tracing the extent of infections, solving crimes, and paternity tests. Primers, human nucleotide sequences, are used for DNA synthesis, which is an essential tool in molecular biology (Momenzadeh et al., 2020). These primers have been used for the recognition and detection of parasites, bacteria, and viruses. The PCR technology amplifies the DNA segment of a preexisting virus, making it possible to detect it. DNA analysis is now one of the most popular topics in computational biology. DNA sequencing is a way of ordering nucleotides in a DNA fragment that sometimes exists in double strands (Nayak et al., 2022). Different techniques have been designed for the application of DNA sequences for species identification purposes in different areas, including the score of correspondence, population genetic knowledge, and, particularly for species organizing features, phylogeny. DNA sequencing research is done through shotgun cloning and walking. Classification is one of the means of character recognition of single or groups of characters, like supermolecule sequences. There are several methods applied to classify these sequences into their particular division, secondary category, or family in order to eliminate alternatives, equalize their value, and finally categorize the sequence. Bioinformatics is the analysis of genetic material sequencing information, which refers to the identification of a DNA sequence’s structural order. Categorization breaks up a gene into different regions; selected- effect function genes are categorized into functional DNA and rubbish DNA (Benson et al., 2009). While unusable DNA loses the unselected-effect activity, healthy DNA possesses it. Efficient DNA sequences can be either precise, with the literal DNA choosing the nucleotide order, or indifferent, with the indifferent DNA choosing the existence or inactivity of an arbitrary pattern of DNA. Junk DNA is part of the organism's fitness and is below the variety neutrality, whereas waste DNA decreases it. Functional categories assigned to DNA regions may change over time. K-mers, substrings of length k, are applied in bioinformatics for sequence analysis and computational genomics. They are made up of nucleotides (A, T, C, and G) and are used to assemble DNA sequences (Benson et al., 2020; Solis- Reyes, 2009; Shadab et al., 2020). We apply several classifiers, among them are the Naive Bayes, Random Forest, K-Nearest Neighbour, and Decision Tree classifiers. The research considers three datasets: human, dog, and chimpanzee, based on protein coding sequences. The datasets are processed using k-mer Authors information: aDepartment of Computer Engineering, GES’s R. H. Sapat College of Engineering, Management Studies and Research, Nashik, INDIA. E-mail: borsevinodkumar@gmail.com1; archana.vaidya@ges-coengg.org2 bDepartment of Computer Science and Engineering (Data Science), R. C. Patel Institute of Technology, Shirpur, INDIA. E- mail: manishavpatil2007@gmail.com3 *Corresponding Author: borsevinodkumar@gmail.com Received: March, 2025 Accepted: July, 2025 Published: June, 2026

Page 2

2 Regular IssueMalaysian Journal of Science DOI:https//doi.org/10.22452/mjs.vol45no2.1 Malaysian Journal of Science 45(2): 1-12 (June 2026) encoding and machine learning classifiers, and classified using scikit-learn to determine gene similarity and predict potential relationships. The dataset has two columns: sequence and class, where class is a pre-determined integer value depending on the protein coding sequence (Solis-Reyes et al., 2009). The research paper seeks to investigate the efficacy of machine learning algorithms in DNA classification of protein sequence data and add to the existing literature by comparing results with prior studies, identifying strengths and weaknesses of various algorithms, and proposing areas for improvement (Shadab et al., 2020). 2. Literature Review Researchers identified new things to implement after evaluating significance, seeking speedy and precise completion. Past scholars contributed a lot to this research area. (Onesime et al., 2021) introduces a new approach to predicting genomic islands (GIs) in bacterial genomes based on seven sequence features extracted with the scikit-learn toolkit. The approach employs a chi-square test to identify significant features, which are subsequently input into a random forest algorithm. The method is appropriate to current approaches in standards of accuracy, precision, recall, and other measures. The article (Alotaibi et al., 2021) discusses the application of six machine learning algorithms (K-nn, RF, SVM, LR, SGD, and GNB) to predict DNA mixture contributors. The provided dataset includes DNA mixtures with a maximum of five contributors. Accuracy, F1-score, recall, and precision have been utilized to measure the metric of each algorithm. Logistic regression (LR) has the best accuracy (95%) for five-contributor mixtures. (Arowolo et al., 2021) Discusses a method for RNA-Seq data classification using genetic algorithm feature selection, decision tree, and K-nearest neighbors (KNN) classifiers. The method is applied to a set of Anopheles gambiae mosquitoes, a malaria vector. The feature selection using GA greatly enhances the performance of the two classifiers, with the decision tree having higher accuracy (98.3%) compared to KNN (88.3%). The paper also discusses literature related to machine learning approaches in the classification of gene expression. (Mathur et al., 2023) Research suggests a DNA sequence classification system for the identification of early diseases, based on NCBI database samples and convolutional neural networks for feature extraction and classification. (Arowolo et al., 2021) Research assesses the application of a genetic algorithm (GA) for feature selection in RNA sequencing data of the Anopheles gambiae malaria vector dataset with 88.3% classification accuracy for KNN and 98.3% for decision tree, showing its viability in bioinformatics. The article (Hamed et al., 2023) explains the application of machine learning models such as random forest, KNN, naïve bayes, decision tree, and SVM in classifying DNA sequences through pattern matching. The approach (Alshayeji et al., 2023) applies natural language processing and machine learning to automatically detect viruses from human biospecimens at 98.6% classification accuracy, precision, recall, and detection rate. The research employs natural language processing and machine learning to automatically detect viruses in human biospecimens with 98.6% accuracy of classification, precision, recall, and detection rate. The study (Li, F. et al., 2023) introduces an EpiTEAmDNA architecture, a combination of transfer learning and ensemble learning methods, for representing DNA methylation type features in 15 species, outperforming current methods. The study (Yadav, V. et al., 2025) uses genome sequencing to study DNA structure and species similarity between humans, chimpanzees, and dogs, revealing 99.30% and 98.40% similarity, suggesting further research could deepen understanding of life sciences. 3. Methods The study has two phases of research: preprocessing and postprocessing. The data preprocessing is dealt with in the preprocessing phase, while model learning and framework testing are covered under the article phase. Machine learning and NLP are applied in this research work to process the texting DNA sequence pattern into a series and to evaluate the various ML algorithms. Data Set The data file “human_data.txt” was downloaded from the Kaggle database and is used as a public dataset. The data includes two features: DNA sequencing and class. The data size is (4380, 2), consisting of 4380 samples and two features. It contains six gene family classes, including occurrences per class and numeric values. The data is converted from string to numeric classes. In order to demonstrate the occurrences for each class, a count plot was created. Transcription factor (class 6) contained the most data, with 1343 samples, and the Lon channel contained the least class, with 240 samples (Bhushan Bawankar et al., 2024). Feature Extraction DNA sequences are written as a set of shorter sub-sequences of length k, known as k-mers. These sub-sequences are similar to words in human language processing (NLP) and help understand DNA sequences and simplify analysis computation. In our model, k-mer encoding generates hexamer “words” with word length adjustable for various situations. In genomics, manipulations like "k-mer counting" are used. Python's natural language processing packages make this process easy. From each pattern string, a function (get_K-mers) is provided to gather all potential overlaid k-mers of a certain length. The data sequences are transformed into repeating k-mers of length six, and repeated operations are performed for every species DNA sequence in the dataset (Hamed et al., 2023). DNA Classification This section provides a classification model applied to human, chimpanzee, and dog DNA datasets. We utilize several classifiers; among them are the naive bayes, decision tree classifier, w-naive bayes classifier, random forest, and K-NN. Also, discuss various performance parameters utilized for the evaluation of classifier performance.

Page 3

3 Regular IssueMalaysian Journal of Science DOI:https//doi.org/10.22452/mjs.vol45no2.1 Malaysian Journal of Science 45(2): 1-12 (June 2026) Naive Bayes Classifier The bayes principle is applied in the naïve bayes technique, a machine learning statistical methodology, to solve classification issues. It uses an independent variable to establish the range of parameters and requires minimal training data (Peretz et al., 2024). Eq. (1), which employs the Gauss distribution as the decision function, is the most often used naïve bayes classifier (Zuhanda et al., 2025). Eq. (1) utilizes the most probable principle to provide the estimated mean and standard deviation. 𝑃𝑃(𝑣𝑣 𝑦𝑦⁄ ) = 1 √2𝜋𝜋𝜎𝜎2. 𝑒𝑒(𝑣𝑣−𝜇𝜇)2 2𝜎𝜎2� (1) In order to classify data, naïve bayes considers a Gaussian distribution and computes the mean, variance, and prior probability for each class in training data (Wickramasinghe et al., 2021). Weighted Naive Bayes Classifier The NB algorithm assumes condition attributes are independent, which reduces the computational cost. However, practical application varies, and hence, classification accuracy is reduced when the default ownership weight is 1(Xia et al., 2021). In this study, we employ the weighted naïve bayes (WNB) algorithm to assign appropriate attributes based on their classification contribution, preserving computation speed and reducing the impact of attribute conditional independence on classifier performance (Ye, 2021; Wickramasinghe et al., 2021). The weighted NB is calculated using the following Eq. (2). 𝑝𝑝�𝐶𝐶𝑗𝑗/𝑋𝑋� = arg max 𝑝𝑝�𝐶𝐶𝑗𝑗� � 𝑝𝑝(𝐴𝐴𝑖𝑖 / 𝐶𝐶𝑗𝑗)𝑤𝑤𝑖𝑖 𝑛𝑛 𝑖𝑖=1 (2) Random Forest Classifier RF is a technique for classification, an ensemble technique where a number of decision trees are parallel trained with bootstrapping and aggregation of the base learners through bagging. Thus, each decision tree is unequal because of the property of high variance of the decision tree. Aggregation of predictions of the final decision comes from individual base classifiers. The goodness of generalization of the classifiers is also much better and gives higher accuracy in comparison to the random forest, which overcomes overfitting (Onesime et al., 2021; Pazhanikumar et al., 2024). RF classifiers show more robust results in noisy data and are simpler to tune hyperparameters compared to DT classifiers. They give fast computation for the internal measure of variable importance, VIMP, which comes in handy with ranking variables, especially in large multi- dimensional genomic imbalance data sets (Rrmoku et al., 2022). Decision Tree Classifier Machine learning models can be classified into parametric and nonparametric algorithms. A decision tree model is a nonparametric model based on supervised learning, where the tree-like structure is used to represent the probability of an event based on training data. The model is arranged in a top-down tree structure, with nodes representing features and branches representing possible values (Benson et al., 2009). This process of building DTs from the training data is called DT induction, which can be represented using a conditional control statement for easy decision-making (Peretz et al., 2024) K-Nearest Neighbour Classifier The k-NN algorithm is a memory-based method that stores objects during training, requiring less computational effort than deep learning methods. It constructs an approximation of the objective function, which is different for each new data to be stored, which is advantageous when the objective function is complex (Corso et al., 2021). As a progressive method that stores new data only when it becomes accessible, K-NN may be employed to address challenging issues. Still, it cannot express itself precisely, a concise expression of the objects, and depends on the determination of the distance of any object from all training objects. The redundancy in attributes, along with redundant data, weakens the proposed model. This weakness can be compensated for by checking the reduction in the problem space or testing the variation of distance calculations (Wang et al., 2023). 4. Results and Discussion In this stage, we provide an analysis of the classification model performance by our results with human, chimpanzee, and dog DNA datasets. Table 1. Performance analysis of various classifiers based on human DNA data. Classifier Accuracy Precision Recall F1 Score Naive Bayes 0.984 0.984 0.984 0.984 Random Forest 0.918 0.926 0.918 0.919 K-Nearest Neighbour 0.824 0.874 0.824 0.827 Decision Tree 0.807 0.827 0.807 0.813

Page 4

4 Regular IssueMalaysian Journal of Science DOI:https//doi.org/10.22452/mjs.vol45no2.1 Malaysian Journal of Science 45(2): 1-12 (June 2026) Table 2. Confusion matrix of various classifier based on Human DNA data. 1. Naive bayes classifier 2. Random forest classifier 3. K-nearest neighbour classifier 4. Decision tree classifier We utilize several classifiers, among them are the naive bayes, decision tree classifiers, k-nearest neighbour, and random forest. As a part of the standard parameters, the test performance for classifiers was also executed in terms of accuracy, precision, recall, and F1 score. We compute the receiver operating characteristic and the Area under the curve values in each classifier. Table 1 shows the actual performance of a classifier, and Table 2 shows the confusion matrix of all classifiers based on human DNA data.

Page 5

5 Regular IssueMalaysian Journal of Science DOI:https//doi.org/10.22452/mjs.vol45no2.1 Malaysian Journal of Science 45(2): 1-12 (June 2026) Figure 1. ROC and AUC of different classifier based on human DNA data. Figure 2. Comparison of various classifier metrics of human DNA data. The naive bayes classifier performed better with an accuracy, precision, recall, and F1-score of 98.4 %. Random forest classifier performed fairly well with an accuracy of 91.8%. K-nearest neighbour and decision tree classifiers performed poorly, with an accuracy of 82.4% and 80.7 % respectively, as shown in Table 1. Table 3. Performance analysis of various classifiers based on chimpanzee DNA data. Classifier Accuracy Precision Recall F1 Score Naive Bayes 0.914 0.920 0.914 0.911 Random Forest 0.843 0.874 0.843 0.841 Decision Tree 0.769 0.767 0.769 0.766 K-Nearest Neighbour 0.682 0.852 0.682 0.705

Tags

Doxxly editorial guide

Predicting DNA Sequence Similarity Across Species Using Machine Learning: a K-mer Based Approach: summary, contents and background

This guide helps you understand the scope of Predicting DNA Sequence Similarity Across Species Using Machine Learning: a K-mer Based Approach before or alongside reading the original document. It is based on the catalogue record, credited creator, source, classification and topics shown on this page. It does not replace the original work and does not invent claims about passages that Doxxly cannot verify.

Summary and overview

Predicting DNA Sequence Similarity Across Species Using Machine Learning: a K-mer Based Approach is a 12-page documentcredited to Elias C. Alder. Published in Malaysian Journal of Science 45(2), pages 1 - 12 (June 2026), this study evaluates machine learning methods for classifying human, chimpanzee, and dog DNA sequences using six-base k-mer encoding. It compares naive Bayes, weighted naive Bayes, random forest, K-nearest neighbour, and decision tree classifiers. Naive Bayes achieves reported classification accuracies of 98.4% for human, 91.4% for chimpanzee, and 68.9% for dog datasets. A weighted naive Bayes model trained on human data reports prediction accuracies of 99.3% for chimpanzee and 92.6% for dog sequences. The authors discuss evolutionary relationships, dataset characteristics, and opportunities for improved feature engineering and algorithm selection. It appears in the Science & Engineering collection, which groups it with other material that readers may use for comparison and further study.

The item can be approached in several ways. A reader looking for a quick orientation can begin with the free five-page preview, inspect the page structure and use the metadata to judge relevance. Someone undertaking deeper research can work through the complete file, search its indexed text, record useful page references and compare its treatment of DNA classification, Machine learning, K-mer encoding, Naive Bayes, Weighted naive Bayes, Cross-species classification, Bioinformatics with the related resources linked below.

Rather than reducing the work to a single claim, this page treats it as a source that should be read in context. The title, creator, publication source, licence and format all help explain what kind of evidence it may offer. Readers should distinguish the original author's statements from Doxxly's catalogue description, and should cite the original edition when using the material in academic, professional or published work.

Key topics and reader takeaways

The catalogue connects this document with DNA classification, Machine learning, K-mer encoding, Naive Bayes, Weighted naive Bayes, Cross-species classification, Bioinformatics. These terms offer practical entry points rather than a substitute for close reading. Start by identifying the definitions, examples, arguments, tables or visual explanations attached to each topic. Then note where the creator draws connections, makes distinctions or moves from background material to a conclusion, recommendation, calculation or narrative development.

A useful reading method is to separate description from interpretation. First record what the item actually presents: names, headings, figures, formulas, quotations or stated propositions. Next consider why those details matter within the whole work. Finally compare them with another source from the same subject area. This process helps turn a long digital file into evidence that can be evaluated rather than merely skimmed.

Table of contents and reading guide

The following is an editorial content guide based on the verified catalogue topics. It is not represented as the original author's formal table of contents. Use it to organise notes while moving through the 12 pages in the player.

  1. Part 1

    DNA classification

    Use this section of the reading guide to identify how DNA classification appears in Predicting DNA Sequence Similarity Across Species Using Machine Learning: a K-mer Based Approach, note important terms, and connect the subject to the wider purpose of the work.

  2. Part 2

    Machine learning

    Use this section of the reading guide to identify how Machine learning appears in Predicting DNA Sequence Similarity Across Species Using Machine Learning: a K-mer Based Approach, note important terms, and connect the subject to the wider purpose of the work.

  3. Part 3

    K-mer encoding

    Use this section of the reading guide to identify how K-mer encoding appears in Predicting DNA Sequence Similarity Across Species Using Machine Learning: a K-mer Based Approach, note important terms, and connect the subject to the wider purpose of the work.

  4. Part 4

    Naive Bayes

    Use this section of the reading guide to identify how Naive Bayes appears in Predicting DNA Sequence Similarity Across Species Using Machine Learning: a K-mer Based Approach, note important terms, and connect the subject to the wider purpose of the work.

  5. Part 5

    Weighted naive Bayes

    Use this section of the reading guide to identify how Weighted naive Bayes appears in Predicting DNA Sequence Similarity Across Species Using Machine Learning: a K-mer Based Approach, note important terms, and connect the subject to the wider purpose of the work.

  6. Part 6

    Cross-species classification

    Use this section of the reading guide to identify how Cross-species classification appears in Predicting DNA Sequence Similarity Across Species Using Machine Learning: a K-mer Based Approach, note important terms, and connect the subject to the wider purpose of the work.

  7. Part 7

    Bioinformatics

    Use this section of the reading guide to identify how Bioinformatics appears in Predicting DNA Sequence Similarity Across Species Using Machine Learning: a K-mer Based Approach, note important terms, and connect the subject to the wider purpose of the work.

When a heading in the original differs from this guide, follow the original heading in your citation. Page numbers can also vary between editions. Doxxly's direct page field is useful for navigation, but formal references should include the title, creator, source and edition details available in the file itself.

About Elias C. Alder

Doxxly credits Elias C. Alder as the author or creator of Predicting DNA Sequence Similarity Across Species Using Machine Learning: a K-mer Based Approach. This page does not add an unverified biography, job title or institutional affiliation. The attribution is preserved so readers can distinguish the creator from the hosting library and follow the original record when an external author link is available.

Author context matters because a work reflects a particular purpose, audience and point of view. Before relying on the material, consider what the creator set out to explain, when the source was produced and whether later research or revised guidance should also be consulted. For literature and philosophy, compare translations and editions; for technical material, check whether a newer version has superseded the one shown here.

About the source organisation

The recorded source for this item is mojc.um.edu.my. Doxxly provides access and discovery tools but does not claim to be the original publisher unless explicitly stated. Source links, creator attribution and the recorded Publicly available file collected for editorial review licence are displayed to help readers assess provenance and permitted use.

Provenance is especially important for reports, standards, presentations and working spreadsheets. Check the original source for amendments, supporting files and current policy. A trustworthy research workflow keeps the source URL with any notes or downloaded copy, verifies important figures against the original, and avoids treating an archived document as automatically current.

Visit mojc.um.edu.my

How to read and use this document

Begin with the title and opening pages, then use the guide above to decide whether to read sequentially or move to a particular topic. The Doxxly player provides previous and next navigation, a direct page field, zoom steps, fit-to-width and fit-to-page modes, rotation and fullscreen. These controls are useful when a page contains small type, a wide table, an image, a scanned layout or a dense sequence of notes.

The first five pages are open to every visitor. A plan unlocks the complete item and full-document search. Search is best used for distinctive names, technical terms or short phrases; broad words can produce too many possible contexts. When you find a useful passage, read the surrounding pages so that a sentence, chart or formula is not separated from its explanation.

If downloading is enabled, members can obtain the original PDF file. Keep the original format when formulas, slide sequencing, pagination or layout carries meaning. Respect the Publicly available file collected for editorial review terms displayed on this page, and use the rights-report link if you believe the attribution or availability needs review.

Research questions to consider

As you read Predicting DNA Sequence Similarity Across Species Using Machine Learning: a K-mer Based Approach, ask which audience the creator addresses, what problem or idea organises the work, what evidence is presented, and which assumptions remain unstated. Note whether important terms are defined consistently and whether examples represent a broader pattern or a narrow case. For quantitative material, record units, time periods, formulas and data sources. For interpretive material, separate the creator's language from your own summary.

A second set of questions concerns relevance today. Which parts remain durable, which depend on their historical or institutional setting, and what would need confirmation from a newer source? Following the tags and the Science & Engineering collection can reveal useful comparisons. Agreement between sources can strengthen confidence, while disagreement can point to changing definitions, methods, evidence or priorities.

Finally, decide what you need from the item: background knowledge, a quotation, a worked example, a model, a visual explanation or a starting bibliography. That purpose should guide the depth of reading and the notes you keep. Doxxly helps locate and navigate the source; careful interpretation remains the reader's responsibility.

Explore more Science & Engineering resources

Frequently asked questions about Predicting DNA Sequence Similarity Across Species Using Machine Learning: a K-mer Based Approach

Practical answers about reading, downloading and understanding this document on Doxxly.

More in Science & Engineering