2025/11/04 by Clyde Meli, Vitezslav Nezval, Meli, Clyde +7
Computer Science · Biochemistry, Genetics and Molecular Biology · #Evolutionary Algorithms and Applications #RNA and protein synthesis mechanisms #Software Testing and Debugging Techniques
paper · pdf · doi:10.48550/arxiv.2511.02897
Different bitstring representations can yield varying computational performance. This work compares three bitstring implementations in C++: std::bitset, boost::dynamicbitset, and a custom direct implementation. Their performance is benchmarked in the context of concatenation within a Linear Genetic Programming system. Benchmarks were conducted on three platforms (macOS, Linux, and Windows MSYS2) to assess platform specific performance variations. The results show that the custom direct implementation delivers the fastest performance on Linux and Windows, while std::bitset performs best on macOS. Although consistently slower, boost::dynamicbitset remains a viable and flexible option. These findings highlight the influence of compiler optimisations and system architecture on performance, providing practical guidance for selecting the optimal method based on platform and application requirements.