{"isi":1,"file_date_updated":"2020-10-12T12:02:09Z","acknowledgement":"This work was supported by the European Research Council under the European Union’s Seventh Framework Programme (FP7/2007-2013, ERC grant agreement 335980_EinME) and Startup package to the Ivankov laboratory at Skolkovo Institute of Science and Technology. The work was started at the School of Molecular and Theoretical Biology 2017 supported by the Zimin Foundation. N.S.B. was supported by the Woman Scientists Support Grant in Centre for Genomic Regulation (CRG). ","ddc":["000","570"],"project":[{"call_identifier":"FP7","grant_number":"335980","name":"Systematic investigation of epistasis in molecular evolution","_id":"26120F5C-B435-11E9-9278-68D0E5697425"}],"volume":36,"intvolume":"        36","year":"2020","ec_funded":1,"citation":{"short":"L.A. Esteban, L.R. Lonishin, D.M. Bobrovskiy, G. Leleytner, N.S. Bogatyreva, F. Kondrashov, D.N. Ivankov, Bioinformatics 36 (2020) 1960–1962.","apa":"Esteban, L. A., Lonishin, L. R., Bobrovskiy, D. M., Leleytner, G., Bogatyreva, N. S., Kondrashov, F., &#38; Ivankov, D. N. (2020). HypercubeME: Two hundred million combinatorially complete datasets from a single experiment. <i>Bioinformatics</i>. Oxford Academic. <a href=\"https://doi.org/10.1093/bioinformatics/btz841\">https://doi.org/10.1093/bioinformatics/btz841</a>","ista":"Esteban LA, Lonishin LR, Bobrovskiy DM, Leleytner G, Bogatyreva NS, Kondrashov F, Ivankov DN. 2020. HypercubeME: Two hundred million combinatorially complete datasets from a single experiment. Bioinformatics. 36(6), 1960–1962.","chicago":"Esteban, Laura A, Lyubov R Lonishin, Daniil M Bobrovskiy, Gregory Leleytner, Natalya S Bogatyreva, Fyodor Kondrashov, and Dmitry N  Ivankov. “HypercubeME: Two Hundred Million Combinatorially Complete Datasets from a Single Experiment.” <i>Bioinformatics</i>. Oxford Academic, 2020. <a href=\"https://doi.org/10.1093/bioinformatics/btz841\">https://doi.org/10.1093/bioinformatics/btz841</a>.","ama":"Esteban LA, Lonishin LR, Bobrovskiy DM, et al. HypercubeME: Two hundred million combinatorially complete datasets from a single experiment. <i>Bioinformatics</i>. 2020;36(6):1960-1962. doi:<a href=\"https://doi.org/10.1093/bioinformatics/btz841\">10.1093/bioinformatics/btz841</a>","ieee":"L. A. Esteban <i>et al.</i>, “HypercubeME: Two hundred million combinatorially complete datasets from a single experiment,” <i>Bioinformatics</i>, vol. 36, no. 6. Oxford Academic, pp. 1960–1962, 2020.","mla":"Esteban, Laura A., et al. “HypercubeME: Two Hundred Million Combinatorially Complete Datasets from a Single Experiment.” <i>Bioinformatics</i>, vol. 36, no. 6, Oxford Academic, 2020, pp. 1960–62, doi:<a href=\"https://doi.org/10.1093/bioinformatics/btz841\">10.1093/bioinformatics/btz841</a>."},"article_type":"original","language":[{"iso":"eng"}],"_id":"8645","doi":"10.1093/bioinformatics/btz841","page":"1960-1962","publication":"Bioinformatics","author":[{"full_name":"Esteban, Laura A","first_name":"Laura A","last_name":"Esteban"},{"full_name":"Lonishin, Lyubov R","last_name":"Lonishin","first_name":"Lyubov R"},{"last_name":"Bobrovskiy","first_name":"Daniil M","full_name":"Bobrovskiy, Daniil M"},{"full_name":"Leleytner, Gregory","last_name":"Leleytner","first_name":"Gregory"},{"full_name":"Bogatyreva, Natalya S","first_name":"Natalya S","last_name":"Bogatyreva"},{"orcid":"0000-0001-8243-4694","id":"44FDEF62-F248-11E8-B48F-1D18A9856A87","full_name":"Kondrashov, Fyodor","first_name":"Fyodor","last_name":"Kondrashov"},{"full_name":"Ivankov, Dmitry N ","last_name":"Ivankov","first_name":"Dmitry N "}],"has_accepted_license":"1","publication_identifier":{"eissn":["1460-2059"],"issn":["1367-4803"]},"external_id":{"isi":["000538696800054"],"pmid":["31742320"]},"status":"public","quality_controlled":"1","title":"HypercubeME: Two hundred million combinatorially complete datasets from a single experiment","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","date_created":"2020-10-11T22:01:14Z","oa":1,"oa_version":"Published Version","scopus_import":"1","publisher":"Oxford Academic","issue":"6","publication_status":"published","date_published":"2020-03-15T00:00:00Z","abstract":[{"text":"Epistasis, the context-dependence of the contribution of an amino acid substitution to fitness, is common in evolution. To detect epistasis, fitness must be measured for at least four genotypes: the reference genotype, two different single mutants and a double mutant with both of the single mutations. For higher-order epistasis of the order n, fitness has to be measured for all 2n genotypes of an n-dimensional hypercube in genotype space forming a ‘combinatorially complete dataset’. So far, only a handful of such datasets have been produced by manual curation. Concurrently, random mutagenesis experiments have produced measurements of fitness and other phenotypes in a high-throughput manner, potentially containing a number of combinatorially complete datasets. We present an effective recursive algorithm for finding all hypercube structures in random mutagenesis experimental data. To test the algorithm, we applied it to the data from a recent HIS3 protein dataset and found all 199 847 053 unique combinatorially complete genotype combinations of dimensionality ranging from 2 to 12. The algorithm may be useful for researchers looking for higher-order epistasis in their high-throughput experimental data.","lang":"eng"}],"department":[{"_id":"FyKo"}],"day":"15","file":[{"content_type":"application/pdf","creator":"dernst","access_level":"open_access","file_name":"2020_Bioinformatics_Esteban.pdf","checksum":"21d6f71839deb3b83e4a356193f72767","relation":"main_file","success":1,"file_id":"8649","file_size":308341,"date_created":"2020-10-12T12:02:09Z","date_updated":"2020-10-12T12:02:09Z"}],"license":"https://creativecommons.org/licenses/by-nc/4.0/","type":"journal_article","tmp":{"name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","image":"/images/cc_by_nc.png","short":"CC BY-NC (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode"},"pmid":1,"date_updated":"2023-08-22T09:57:29Z","month":"03","article_processing_charge":"No"}