Optimizing Consensus Generation Algorithms for Highly Variable Amino Acid Sequence Clusters

Producing a functional consensus sequence is a preliminary bioinformatics task, which is a necessity for many research purposes. However, the existence of hypervariable regions in the input multiple sequence alignment files causes complications in generating a useful consensus sequence. The current methods for consensus generation, Threshold, and majority algorithms, have several problems, which exclude them as applicable algorithms for such highly variable sequence clusters. Hence, we designed a novel alternative algorithm for the same purpose. The algorithm was explained both using a mathematical formula and a practical implementation in Python programming language. A sequence set from HCV genotype 1b E2 protein has been utilized as a practical example for evaluating the algorithm’s performance. A few in silico tests have been performed on the output sequence and the results have been compared to results from other algorithms. Epitope-mapping analysis indicates the functionality of this algorithm, by preserving the hotspot residues in the consensus sequence, and the antigenicity index shows significant antigenicity of the consensus sequence. Moreover, phylogenetic analysis shows no significant change in the placement of the new consensus sequence on the phylogenetic tree compared to other algorithms. This approach will have several implications in designing a new vaccine for highly variable viruses such as HIV-1, Influenza, and Hepatitis C Viruses (HCV). ### Competing Interest Statement The authors have declared no competing interest.