Skip to content
2000
Volume 25, Issue 3
  • ISSN: 1386-2073
  • E-ISSN: 1875-5402

Abstract

Background: Advancement in sequencing technology yields a huge number of genomes from a multitude of organisms on our planet. One of the fundamental tasks for processing and analyzing these sequences is to organize them in the existing taxonomic orders. Methods: Recently, we proposed a novel approach, GenFooT, for taxonomy classification using the concept of genomic footprint (GFP). The technique is further refined and enhanced in this work leading to improved accuracies in the task of taxonomic classification based on various benchmark datasets. GenFooT maps a genome sequence in a 2D coordinate space and extracts features from that representation. It uses two hyper-parameters, namely block size and number of fragments of genomic sequence while computing the feature. In this work, we propose an analysis of choosing values of those parameters adaptively from the sequences. The enhanced version of GenFooT is named GenFooT2. Results: We have tested GenFooT2 on ten different biological datasets of genomic sequences of various organisms belonging to different taxonomy ranks. Our experimental results indicate a 3% improved classification performance of the proposed GenFooT2 featured with a Logistic regression classifier as compared to GenFooT. We also performed the statistical test to compare the performance of GenFooT2 to the state-of-the-art methods including our previous method, GenFooT. Conclusion: The experimental results as well as the statistical test exhibit that the performance of the proposed GenFooT2 is significantly better.

Loading

Article metrics loading...

/content/journals/cchts/10.2174/1386207324666210811102109
2022-03-01
2025-04-11
Loading full text...

Full text loading...

/content/journals/cchts/10.2174/1386207324666210811102109
Loading
This is a required field
Please enter a valid email address
Approval was a Success
Invalid data
An Error Occurred
Approval was partially successful, following selected items could not be processed due to error
Please enter a valid_number test