Papers › MutaGAN: A Seq2seq GAN Framework to Predict Mutations of Evolving Protein Populations

MutaGAN: A Seq2seq GAN Framework to Predict Mutations of Evolving Protein Populations

26 Aug 2020arXiv:2008.11790archive 2025-07-28

Daniel S. Berman, Craig Howser, Thomas Mehoke, Jared D. Evans

The ability to predict the evolution of a pathogen would significantly improve the ability to control, prevent, and treat disease. Despite significant progress in other problem spaces, deep learning has yet to contribute to the issue of predicting mutations of evolving populations. To address this gap, we developed a novel machine learning framework using generative adversarial networks (GANs) with recurrent neural networks (RNNs) to accurately predict genetic mutations and evolution of future biological populations. Using a generalized time-reversible phylogenetic model of protein evolution with bootstrapped maximum likelihood tree estimation, we trained a sequence-to-sequence generator within an adversarial framework, named MutaGAN, to generate complete protein sequences augmented with possible mutations of future virus populations. Influenza virus sequences were identified as an ideal test case for this deep learning framework because it is a significant human pathogen with new strains emerging annually and global surveillance efforts have generated a large amount of publicly available data from the National Center for Biotechnology Information's (NCBI) Influenza Virus Resource (IVR). MutaGAN generated "child" sequences from a given "parent" protein sequence with a median Levenshtein distance of 2.00 amino acids. Additionally, the generator was able to augment the majority of parent proteins with at least one mutation identified within the global influenza virus population. These results demonstrate the power of the MutaGAN framework to aid in pathogen forecasting with implications for broad utility in evolutionary prediction for any protein population.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2008.11790")

Code

Syntology Ran 0 of 18 code samples harvested from 2 repositories linked to this paper; 18 have no recorded run.

By repository: community (archive-listed): 18 samples from 2 repositories, 0 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

1hachem/mutaGAN mentioned on GitHubpytorchMIT report
anuprulez/clade_prediction mentioned on GitHubtfMIT report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

18 samples harvested; 0 ran; 0 honoured the contract we drafted; 18 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

18unverified

Licence: 0 of the 18 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from 2 repositories linked to this paper, official or community; each sample names its own and says which. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

call anuprulez/clade_prediction/encoder_decoder_attention.py community (archive-listed) unverified MIT (permissive) · a179307e89c155b9 · report
combine_mutation anuprulez/clade_prediction/fetch_clades_mutations.py community (archive-listed) unverified MIT (permissive) · 9b7e2102240fb4e1 · report
compare_mutations anuprulez/clade_prediction/comparison_with_wuhan.py community (archive-listed) unverified MIT (permissive) · 81574ebc24b4093d · report
create_pf_model anuprulez/clade_prediction/neural_network.py community (archive-listed) unverified MIT (permissive) · 71684890ef30c730 · report
discriminator_loss anuprulez/clade_prediction/train_model.py community (archive-listed) unverified MIT (permissive) · ded44dd1ac77a10e · report
generator_loss anuprulez/clade_prediction/train_model.py community (archive-listed) unverified MIT (permissive) · 694eab49f2d16df0 · report
get_POS anuprulez/clade_prediction/common_mut_tr_gen.py community (archive-listed) unverified MIT (permissive) · e467f7788d72a508 · report
get_frac_seq_mat anuprulez/clade_prediction/create_plots.py community (archive-listed) unverified MIT (permissive) · d9835f90f03c1b68 · report
get_item anuprulez/clade_prediction/fetch_clades_mutations.py community (archive-listed) unverified MIT (permissive) · d07b5ad7e24e5427 · report
get_path_all_gen_files anuprulez/clade_prediction/analyse_generated_seqs.py community (archive-listed) unverified MIT (permissive) · 8e9ecf5dfc8df936 · report
get_vocab 1hachem/mutaGAN/src/encode.py community (archive-listed) unverified MIT (permissive) · 2af3d0d3b56301ba · report
make_disc_par_gen_model anuprulez/clade_prediction/neural_network.py community (archive-listed) unverified MIT (permissive) · a89a1950be074cac · report
make_generator_model anuprulez/clade_prediction/neural_network.py community (archive-listed) unverified MIT (permissive) · df9c791b35996ec0 · report
read_json 1hachem/mutaGAN/utils/utils.py community (archive-listed) unverified MIT (permissive) · dc880616a10bffc7 · report
read_json anuprulez/clade_prediction/comparison_with_wuhan.py community (archive-listed) unverified MIT (permissive) · b2ab6cedad111e4d · report
read_wuhan_hu_1_spike anuprulez/clade_prediction/comparison_with_wuhan.py community (archive-listed) unverified MIT (permissive) · 2eff351d33712372 · report
recursive_branch anuprulez/clade_prediction/fetch_clades_mutations.py community (archive-listed) unverified MIT (permissive) · b5bcb33681468538 · report
wasserstein_loss anuprulez/clade_prediction/train_model.py community (archive-listed) unverified MIT (permissive) · 0dea6a4fd298ee87 · report

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections