Efficacy of the algorithm(s) in analytical software packages on DNA sequence data analysis. – F. U. Ogban, U. O. Udensi, G. A. Inyang, F Osang
Most recently, there has been upsurges of DNA and Protein sequence data deposited in Genbank or databases that are subjected to analysis, which is made possible through the utilization of bioinformatics tools. However, the accuracy and informativeness of the sequences often analyzed depend on the suitability of the bioinformatics Software employed during the analysis. This work intends to check the efficacies of the underlying algorithms in Molecular Evolutionary Genetic Analysis (Mega 7) and Phylogenetic Analysis Using Parsimony (PAUP 4) version 4 with respect to Maximum Likelihood, Parsimony and Neighbour-Joining methods. The underlying benchmarks shall be the Accuracy, Running time, Execution time and the response time. Understandably, these bioinformatics software are produced or written with algorithms that will enable the software to resolve the intended goal(s).The conundrum here is the fact that these software developers or programmers import algorithm of these software based on what they want to achieve. As such, student researchers using this software may not understand the intent of the programmer, implying that the result from such analysis might be less informative. Undoubtedly, every researcher is poised to achieving a certain goal and if the analytical tools used are not specific to achieving the desired goal(s), the results obtained thereof may cause wrong conclusion to be drawn.