A comparison of algorithms for a complete backtranslation of oligopeptides

In the context of new metabolic pathways discovery, a full backtranslation of oligopeptides can be a promising approach. When studying complex environments where the composing microorganisms are unknown it is also preferable to have all the complete nucleic sequences corresponding to an enzyme of interest. In this paper, we revisit the existing bioinformatics applications, which bring partial reverse translation solutions, and we compare two algorithms based on oligopeptide degeneracy able to efficiently compute a complete backtranslation of oligopeptides. Such algorithms are precious for the discovery of new organisms and we show their performances on simulated and real biological data sets.