Flexible Traceable Generic Genetic Algorithm

Abstract

This document elaborates on the generic implementation one of the main heuristics algorithms verified through its quick application to a biology problem requiring to find out an optimal sequences tree topology. In order to solve this problem, categorized as Non-Polynomial Hard (NP-Hard), “to minimize differences between given (leaf) and/or derived (parent) sequences”, many popular methods are used. “The higher the number of given sequences is, the more advisable and efficient it would be to go towards heuristics as they would provide a close-enough solution faster, as for instance genetic algorithms amongst others do. Thus, as part of a larger research in Heuristics and phylogenies, this paper aims to suggest a generic advanced flexible implementation of the Genetic Algorithm verified by a “general way to encode the problem into instances of different heuristic algorithms” as mentioned in our first reference below. The proposed algorithm will also present a chronology traceability feature for further analysis and potential improvements.