[{"has_accepted_license":"1","_id":"5552","department":[{"_id":"NiBa"}],"doi":"10.15479/AT:ISTA:36","oa":1,"related_material":{"record":[{"relation":"research_paper","status":"public","id":"1398"}]},"title":"Pollinator visitation data for wild Antirrhinum majus plants, with phenotypic and frequency data.","abstract":[{"lang":"eng","text":"Data on pollinator visitation to wild snapdragons in a natural hybrid zone, collected as part of Tom Ellis' PhD thesis (submitted February 2016).\r\n\r\nSnapdragon flowers have a mouth-like structure which pollinators must open to access nectar. We placed 5mm cellophane tags in these mouths, which are held in place by the pressure of the flower until a pollinator visits. When she opens the flower, the tag drops out, and one can infer a visit. We surveyed plants over multiple days in 2010, 2011 and 2012.\r\n\r\nAlso included are data on phenotypic and demographic variables which may be explanatory variables for pollinator visitation."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","author":[{"first_name":"Thomas","last_name":"Ellis","full_name":"Ellis, Thomas","orcid":"0000-0002-8511-0254","id":"3153D6D4-F248-11E8-B48F-1D18A9856A87"}],"citation":{"apa":"Ellis, T. (2016). Pollinator visitation data for wild Antirrhinum majus plants, with phenotypic and frequency data. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:36\">https://doi.org/10.15479/AT:ISTA:36</a>","mla":"Ellis, Thomas. <i>Pollinator Visitation Data for Wild Antirrhinum Majus Plants, with Phenotypic and Frequency Data.</i> Institute of Science and Technology Austria, 2016, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:36\">10.15479/AT:ISTA:36</a>.","ama":"Ellis T. Pollinator visitation data for wild Antirrhinum majus plants, with phenotypic and frequency data. 2016. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:36\">10.15479/AT:ISTA:36</a>","ieee":"T. Ellis, “Pollinator visitation data for wild Antirrhinum majus plants, with phenotypic and frequency data.” Institute of Science and Technology Austria, 2016.","ista":"Ellis T. 2016. Pollinator visitation data for wild Antirrhinum majus plants, with phenotypic and frequency data., Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:36\">10.15479/AT:ISTA:36</a>.","short":"T. Ellis, (2016).","chicago":"Ellis, Thomas. “Pollinator Visitation Data for Wild Antirrhinum Majus Plants, with Phenotypic and Frequency Data.” Institute of Science and Technology Austria, 2016. <a href=\"https://doi.org/10.15479/AT:ISTA:36\">https://doi.org/10.15479/AT:ISTA:36</a>."},"year":"2016","day":"19","contributor":[{"id":"419049E2-F248-11E8-B48F-1D18A9856A87","last_name":"Field","first_name":"David"},{"last_name":"Barton","first_name":"Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8548-5240"}],"oa_version":"Published Version","type":"research_data","date_updated":"2024-02-21T13:51:40Z","status":"public","month":"02","date_created":"2018-12-12T12:31:30Z","file":[{"creator":"system","content_type":"application/zip","file_size":44905,"relation":"main_file","date_created":"2018-12-12T13:03:07Z","file_name":"IST-2016-36-v1+1_tag_assay_archive.zip","checksum":"cbc61b523d4d475a04a737d50dc470ef","access_level":"open_access","date_updated":"2020-07-14T12:47:01Z","file_id":"5625"}],"date_published":"2016-02-19T00:00:00Z","publisher":"Institute of Science and Technology Austria","datarep_id":"36","file_date_updated":"2020-07-14T12:47:01Z"},{"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Field","first_name":"David","id":"419049E2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4014-8478","full_name":"Field, David"},{"last_name":"Ellis","first_name":"Thomas","full_name":"Ellis, Thomas","orcid":"0000-0002-8511-0254","id":"3153D6D4-F248-11E8-B48F-1D18A9856A87"}],"citation":{"ista":"Field D, Ellis T. 2016. Inference of mating patterns among wild snapdragons in a natural hybrid zone in 2012, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:37\">10.15479/AT:ISTA:37</a>.","short":"D. Field, T. Ellis, (2016).","chicago":"Field, David, and Thomas Ellis. “Inference of Mating Patterns among Wild Snapdragons in a Natural Hybrid Zone in 2012.” Institute of Science and Technology Austria, 2016. <a href=\"https://doi.org/10.15479/AT:ISTA:37\">https://doi.org/10.15479/AT:ISTA:37</a>.","ama":"Field D, Ellis T. Inference of mating patterns among wild snapdragons in a natural hybrid zone in 2012. 2016. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:37\">10.15479/AT:ISTA:37</a>","ieee":"D. Field and T. Ellis, “Inference of mating patterns among wild snapdragons in a natural hybrid zone in 2012.” Institute of Science and Technology Austria, 2016.","apa":"Field, D., &#38; Ellis, T. (2016). Inference of mating patterns among wild snapdragons in a natural hybrid zone in 2012. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:37\">https://doi.org/10.15479/AT:ISTA:37</a>","mla":"Field, David, and Thomas Ellis. <i>Inference of Mating Patterns among Wild Snapdragons in a Natural Hybrid Zone in 2012</i>. Institute of Science and Technology Austria, 2016, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:37\">10.15479/AT:ISTA:37</a>."},"year":"2016","day":"19","contributor":[{"orcid":"0000-0002-8548-5240","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","last_name":"Barton","contributor_type":"project_manager","first_name":"Nicholas H"}],"oa_version":"Published Version","tmp":{"short":"CC0 (1.0)","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","name":"Creative Commons Public Domain Dedication (CC0 1.0)","image":"/images/cc_0.png"},"date_updated":"2024-02-21T13:51:14Z","type":"research_data","department":[{"_id":"NiBa"}],"_id":"5553","has_accepted_license":"1","ddc":["576"],"license":"https://creativecommons.org/publicdomain/zero/1.0/","doi":"10.15479/AT:ISTA:37","related_material":{"record":[{"status":"public","relation":"research_paper","id":"1398"}]},"oa":1,"title":"Inference of mating patterns among wild snapdragons in a natural hybrid zone in 2012","abstract":[{"text":"Genotypic, phenotypic and demographic data for 2128 wild snapdragons and 1127 open-pollinated progeny from a natural hybrid zone, collected as part of Tom Ellis' PhD thesis (submitted) February 2016).\r\n\r\nTissue samples were sent to LGC Genomics in Berlin for DNA extraction, and genotyping at 70 SNP markers by KASPR genotyping. 29 of these SNPs failed to amplify reliably, and have been removed from this dataset.\r\n\r\nOther data were retreived from an online database of this population at www.antspec.org.","lang":"eng"}],"file":[{"access_level":"open_access","file_name":"IST-2016-37-v1+1_paternity_archive.zip","checksum":"4ae751b1fa4897fa216241f975a57313","date_updated":"2020-07-14T12:47:01Z","file_id":"5620","file_size":132808,"creator":"system","content_type":"application/zip","date_created":"2018-12-12T13:03:02Z","relation":"main_file"}],"keyword":["paternity assignment","pedigree","matting patterns","assortative mating","Antirrhinum majus","frequency-dependent selection","plant-pollinator interaction"],"date_published":"2016-02-19T00:00:00Z","publisher":"Institute of Science and Technology Austria","datarep_id":"37","file_date_updated":"2020-07-14T12:47:01Z","status":"public","month":"02","date_created":"2018-12-12T12:31:30Z"},{"status":"public","date_created":"2018-12-12T12:31:30Z","month":"05","date_published":"2016-05-12T00:00:00Z","file":[{"file_size":1123495,"creator":"system","content_type":"application/zip","date_created":"2018-12-12T13:03:08Z","relation":"main_file","access_level":"open_access","file_name":"IST-2016-43-v1+1_DATA_MTugrul_PhDThesis_Chapter3.zip","checksum":"1fc0a10bb7ce110fcb5e1fbe3cf0c4e2","date_updated":"2020-07-14T12:47:01Z","file_id":"5626"}],"keyword":["RNAP binding","de novo promoter evolution","lac promoter"],"publisher":"Institute of Science and Technology Austria","file_date_updated":"2020-07-14T12:47:01Z","datarep_id":"43","doi":"10.15479/AT:ISTA:43","oa":1,"related_material":{"record":[{"id":"1131","relation":"used_in_publication","status":"public"}]},"department":[{"_id":"NiBa"},{"_id":"JoBo"}],"_id":"5554","has_accepted_license":"1","title":"Experimental Data for Binding Site Evolution of Bacterial RNA Polymerase","abstract":[{"lang":"eng","text":"The data stored here is used in Murat Tugrul's PhD thesis (Chapter 3), which is related to the evolution of bacterial RNA polymerase binding.\r\nMagdalena Steinrueck (PhD Student in Calin Guet's group at IST Austria) performed the experiments and created the data on de novo promoter evolution. Fabienne Jesse (PhD Student in Jon Bollback's group at IST Austria) performed the experiments and created the data on lac promoter evolution."}],"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Tugrul","first_name":"Murat","full_name":"Tugrul, Murat","orcid":"0000-0002-8523-0758","id":"37C323C6-F248-11E8-B48F-1D18A9856A87"}],"citation":{"ama":"Tugrul M. Experimental Data for Binding Site Evolution of Bacterial RNA Polymerase. 2016. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:43\">10.15479/AT:ISTA:43</a>","ieee":"M. Tugrul, “Experimental Data for Binding Site Evolution of Bacterial RNA Polymerase.” Institute of Science and Technology Austria, 2016.","ista":"Tugrul M. 2016. Experimental Data for Binding Site Evolution of Bacterial RNA Polymerase, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:43\">10.15479/AT:ISTA:43</a>.","short":"M. Tugrul, (2016).","chicago":"Tugrul, Murat. “Experimental Data for Binding Site Evolution of Bacterial RNA Polymerase.” Institute of Science and Technology Austria, 2016. <a href=\"https://doi.org/10.15479/AT:ISTA:43\">https://doi.org/10.15479/AT:ISTA:43</a>.","apa":"Tugrul, M. (2016). Experimental Data for Binding Site Evolution of Bacterial RNA Polymerase. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:43\">https://doi.org/10.15479/AT:ISTA:43</a>","mla":"Tugrul, Murat. <i>Experimental Data for Binding Site Evolution of Bacterial RNA Polymerase</i>. Institute of Science and Technology Austria, 2016, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:43\">10.15479/AT:ISTA:43</a>."},"contributor":[{"last_name":"Steinrück","contributor_type":"researcher","first_name":"Magdalena","id":"2C023F40-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Fabienne","last_name":"Jesse","contributor_type":"researcher","id":"4C8C26A4-F248-11E8-B48F-1D18A9856A87"}],"day":"12","year":"2016","date_updated":"2024-02-21T13:50:34Z","tmp":{"short":"CC0 (1.0)","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","name":"Creative Commons Public Domain Dedication (CC0 1.0)","image":"/images/cc_0.png"},"type":"research_data","oa_version":"Published Version"},{"status":"public","date_created":"2018-12-12T12:31:31Z","month":"07","publisher":"Institute of Science and Technology Austria","file_date_updated":"2020-07-14T12:47:02Z","datarep_id":"44","date_published":"2016-07-08T00:00:00Z","keyword":["cell migration","wide field microscopy","FIJI"],"file":[{"date_updated":"2020-07-14T12:47:02Z","file_id":"5621","file_name":"IST-2016-44-v1+1_migrationAnalyzer.zip","checksum":"9f96cddbcd4ed689f48712ffe234d5e5","access_level":"open_access","relation":"main_file","date_created":"2018-12-12T13:03:03Z","content_type":"application/zip","creator":"system","file_size":20692}],"abstract":[{"text":"This FIJI script calculates the population average of the migration speed as a function of time of all cells from wide field microscopy movies.","lang":"eng"}],"ddc":["570"],"oa":1,"doi":"10.15479/AT:ISTA:44","_id":"5555","department":[{"_id":"Bio"}],"has_accepted_license":"1","title":"Fiji script to determine average speed and direction of migration of cells","day":"08","year":"2016","tmp":{"short":"CC0 (1.0)","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","name":"Creative Commons Public Domain Dedication (CC0 1.0)","image":"/images/cc_0.png"},"date_updated":"2024-02-21T13:50:06Z","type":"research_data","oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","author":[{"id":"4E01D6B4-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-9843-3522","full_name":"Hauschild, Robert","first_name":"Robert","last_name":"Hauschild"}],"citation":{"ieee":"R. Hauschild, “Fiji script to determine average speed and direction of migration of cells.” Institute of Science and Technology Austria, 2016.","ama":"Hauschild R. Fiji script to determine average speed and direction of migration of cells. 2016. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:44\">10.15479/AT:ISTA:44</a>","short":"R. Hauschild, (2016).","chicago":"Hauschild, Robert. “Fiji Script to Determine Average Speed and Direction of Migration of Cells.” Institute of Science and Technology Austria, 2016. <a href=\"https://doi.org/10.15479/AT:ISTA:44\">https://doi.org/10.15479/AT:ISTA:44</a>.","ista":"Hauschild R. 2016. Fiji script to determine average speed and direction of migration of cells, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:44\">10.15479/AT:ISTA:44</a>.","mla":"Hauschild, Robert. <i>Fiji Script to Determine Average Speed and Direction of Migration of Cells</i>. Institute of Science and Technology Austria, 2016, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:44\">10.15479/AT:ISTA:44</a>.","apa":"Hauschild, R. (2016). Fiji script to determine average speed and direction of migration of cells. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:44\">https://doi.org/10.15479/AT:ISTA:44</a>"}},{"citation":{"mla":"Lukacisin, Martin, et al. <i>MATLAB Analysis Code for “Sequence-Specific Thermodynamic Properties of Nucleic Acids Influence Both Transcriptional Pausing and Backtracking in Yeast.”</i> Institute of Science and Technology Austria, 2016, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:45\">10.15479/AT:ISTA:45</a>.","apa":"Lukacisin, M., Landon, M., &#38; Jajoo, R. (2016). MATLAB analysis code for “Sequence-Specific Thermodynamic Properties of Nucleic Acids Influence Both Transcriptional Pausing and Backtracking in Yeast.” Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:45\">https://doi.org/10.15479/AT:ISTA:45</a>","ista":"Lukacisin M, Landon M, Jajoo R. 2016. MATLAB analysis code for ‘Sequence-Specific Thermodynamic Properties of Nucleic Acids Influence Both Transcriptional Pausing and Backtracking in Yeast’, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:45\">10.15479/AT:ISTA:45</a>.","chicago":"Lukacisin, Martin, Matthieu Landon, and Rishi Jajoo. “MATLAB Analysis Code for ‘Sequence-Specific Thermodynamic Properties of Nucleic Acids Influence Both Transcriptional Pausing and Backtracking in Yeast.’” Institute of Science and Technology Austria, 2016. <a href=\"https://doi.org/10.15479/AT:ISTA:45\">https://doi.org/10.15479/AT:ISTA:45</a>.","short":"M. Lukacisin, M. Landon, R. Jajoo, (2016).","ieee":"M. Lukacisin, M. Landon, and R. Jajoo, “MATLAB analysis code for ‘Sequence-Specific Thermodynamic Properties of Nucleic Acids Influence Both Transcriptional Pausing and Backtracking in Yeast.’” Institute of Science and Technology Austria, 2016.","ama":"Lukacisin M, Landon M, Jajoo R. MATLAB analysis code for “Sequence-Specific Thermodynamic Properties of Nucleic Acids Influence Both Transcriptional Pausing and Backtracking in Yeast.” 2016. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:45\">10.15479/AT:ISTA:45</a>"},"author":[{"last_name":"Lukacisin","first_name":"Martin","orcid":"0000-0001-6549-4177","full_name":"Lukacisin, Martin","id":"298FFE8C-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Matthieu","last_name":"Landon","full_name":"Landon, Matthieu"},{"full_name":"Jajoo, Rishi","last_name":"Jajoo","first_name":"Rishi"}],"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"research_data","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","short":"CC BY-SA (4.0)","name":"Creative Commons Attribution-ShareAlike 4.0 International Public License (CC BY-SA 4.0)","image":"/images/cc_by_sa.png"},"date_updated":"2024-02-21T13:51:53Z","oa_version":"Published Version","day":"25","year":"2016","title":"MATLAB analysis code for 'Sequence-Specific Thermodynamic Properties of Nucleic Acids Influence Both Transcriptional Pausing and Backtracking in Yeast'","oa":1,"license":"https://creativecommons.org/licenses/by-sa/4.0/","doi":"10.15479/AT:ISTA:45","related_material":{"record":[{"status":"deleted","relation":"used_in_publication","id":"8431"},{"status":"public","relation":"research_paper","id":"1029"}]},"ddc":["571"],"_id":"5556","department":[{"_id":"ToBo"}],"has_accepted_license":"1","abstract":[{"lang":"eng","text":"MATLAB code and processed datasets available for reproducing the results in: \r\nLukačišin, M.*, Landon, M.*, Jajoo, R*. (2016) Sequence-Specific Thermodynamic Properties of Nucleic Acids Influence Both Transcriptional Pausing and Backtracking in Yeast.\r\n*equal contributions"}],"date_published":"2016-08-25T00:00:00Z","file":[{"creator":"system","content_type":"application/zip","file_size":296722548,"date_created":"2018-12-12T13:02:58Z","relation":"main_file","access_level":"open_access","file_name":"IST-2016-45-v1+1_PaperCode.zip","checksum":"ee697f2b1ade4dc14d6ac0334dd832ab","date_updated":"2020-07-14T12:47:02Z","file_id":"5616"}],"keyword":["transcription","pausing","backtracking","polymerase","RNA","NET-seq","nucleosome","basepairing"],"file_date_updated":"2020-07-14T12:47:02Z","datarep_id":"45","publisher":"Institute of Science and Technology Austria","date_created":"2018-12-12T12:31:31Z","month":"08","status":"public"},{"has_accepted_license":"1","_id":"5557","department":[{"_id":"VlKo"}],"ddc":["006"],"doi":"10.15479/AT:ISTA:46","oa":1,"title":"Synthetic discrete tomography problems","abstract":[{"lang":"eng","text":"Small synthetic discrete tomography problems.\r\nSizes are 32x32, 64z64 and 256x256.\r\nProjection angles are 2, 4, and 6.\r\nNumber of labels are 3 and 5."}],"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Swoboda, Paul","id":"446560C6-F248-11E8-B48F-1D18A9856A87","last_name":"Swoboda","first_name":"Paul"}],"citation":{"mla":"Swoboda, Paul. <i>Synthetic Discrete Tomography Problems</i>. Institute of Science and Technology Austria, 2016, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:46\">10.15479/AT:ISTA:46</a>.","apa":"Swoboda, P. (2016). Synthetic discrete tomography problems. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:46\">https://doi.org/10.15479/AT:ISTA:46</a>","ista":"Swoboda P. 2016. Synthetic discrete tomography problems, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:46\">10.15479/AT:ISTA:46</a>.","short":"P. Swoboda, (2016).","chicago":"Swoboda, Paul. “Synthetic Discrete Tomography Problems.” Institute of Science and Technology Austria, 2016. <a href=\"https://doi.org/10.15479/AT:ISTA:46\">https://doi.org/10.15479/AT:ISTA:46</a>.","ama":"Swoboda P. Synthetic discrete tomography problems. 2016. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:46\">10.15479/AT:ISTA:46</a>","ieee":"P. Swoboda, “Synthetic discrete tomography problems.” Institute of Science and Technology Austria, 2016."},"year":"2016","day":"20","contributor":[{"first_name":"Jan","contributor_type":"data_collector","last_name":"Kuske"}],"oa_version":"Published Version","tmp":{"short":"CC0 (1.0)","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","name":"Creative Commons Public Domain Dedication (CC0 1.0)","image":"/images/cc_0.png"},"date_updated":"2024-02-21T13:50:21Z","type":"research_data","status":"public","month":"09","date_created":"2018-12-12T12:31:31Z","keyword":["discrete tomography"],"file":[{"file_id":"5645","date_updated":"2020-07-14T12:47:02Z","checksum":"aa5a16a0dc888da7186fb8fc45e88439","file_name":"IST-2016-46-v1+1_discrete_tomography_synthetic.zip","access_level":"open_access","relation":"main_file","date_created":"2018-12-12T13:05:19Z","file_size":36058401,"content_type":"application/zip","creator":"system"}],"date_published":"2016-09-20T00:00:00Z","publisher":"Institute of Science and Technology Austria","datarep_id":"46","file_date_updated":"2020-07-14T12:47:02Z"},{"author":[{"id":"439F0C8C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4417-3224","full_name":"Bojsen-Hansen, Morten","first_name":"Morten","last_name":"Bojsen-Hansen"}],"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Bojsen-Hansen, Morten. <i>Tracking, Correcting and Absorbing Water Surface Waves</i>. Institute of Science and Technology Austria, 2016, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:48\">10.15479/AT:ISTA:48</a>.","apa":"Bojsen-Hansen, M. (2016). Tracking, Correcting and Absorbing Water Surface Waves. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:48\">https://doi.org/10.15479/AT:ISTA:48</a>","ama":"Bojsen-Hansen M. Tracking, Correcting and Absorbing Water Surface Waves. 2016. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:48\">10.15479/AT:ISTA:48</a>","ieee":"M. Bojsen-Hansen, “Tracking, Correcting and Absorbing Water Surface Waves.” Institute of Science and Technology Austria, 2016.","ista":"Bojsen-Hansen M. 2016. Tracking, Correcting and Absorbing Water Surface Waves, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:48\">10.15479/AT:ISTA:48</a>.","chicago":"Bojsen-Hansen, Morten. “Tracking, Correcting and Absorbing Water Surface Waves.” Institute of Science and Technology Austria, 2016. <a href=\"https://doi.org/10.15479/AT:ISTA:48\">https://doi.org/10.15479/AT:ISTA:48</a>.","short":"M. Bojsen-Hansen, (2016)."},"year":"2016","day":"23","oa_version":"Published Version","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"type":"research_data","date_updated":"2024-02-21T13:50:48Z","_id":"5558","has_accepted_license":"1","department":[{"_id":"ChWo"}],"doi":"10.15479/AT:ISTA:48","related_material":{"record":[{"status":"public","relation":"other","id":"1122"}]},"ddc":["004"],"oa":1,"title":"Tracking, Correcting and Absorbing Water Surface Waves","abstract":[{"lang":"eng","text":"PhD thesis LaTeX source code"}],"pubrep_id":"640","file":[{"relation":"main_file","date_created":"2018-12-12T13:02:18Z","content_type":"application/x-bzip2","creator":"system","file_size":55237885,"date_updated":"2020-07-14T12:47:02Z","file_id":"5589","file_name":"IST-2016-48-v1+1_2016_Bojsen-Hansen_TCaAWSW.tar.bz2","checksum":"5b1b256ad796fbddb4b7729f5e45e444","access_level":"open_access"}],"date_published":"2016-09-23T00:00:00Z","publisher":"Institute of Science and Technology Austria","datarep_id":"48","file_date_updated":"2020-07-14T12:47:02Z","publist_id":"6238","status":"public","month":"09","date_created":"2018-12-12T12:31:31Z"},{"publisher":"Oxford University Press","file_date_updated":"2020-07-14T12:47:10Z","volume":33,"issue":"3","pubrep_id":"587","status":"public","date_created":"2018-12-18T13:18:10Z","month":"03","intvolume":"        33","year":"2016","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"},"quality_controlled":"1","author":[{"last_name":"Wielgoss","first_name":"Sébastien","full_name":"Wielgoss, Sébastien"},{"full_name":"Bergmiller, Tobias","orcid":"0000-0001-5396-4346","id":"2C471CFA-F248-11E8-B48F-1D18A9856A87","first_name":"Tobias","last_name":"Bergmiller"},{"full_name":"Bischofberger, Anna M.","first_name":"Anna M.","last_name":"Bischofberger"},{"full_name":"Hall, Alex R.","last_name":"Hall","first_name":"Alex R."}],"citation":{"ieee":"S. Wielgoss, T. Bergmiller, A. M. Bischofberger, and A. R. Hall, “Adaptation to parasites and costs of parasite resistance in mutator and nonmutator bacteria,” <i>Molecular Biology and Evolution</i>, vol. 33, no. 3. Oxford University Press, pp. 770–782, 2016.","ama":"Wielgoss S, Bergmiller T, Bischofberger AM, Hall AR. Adaptation to parasites and costs of parasite resistance in mutator and nonmutator bacteria. <i>Molecular Biology and Evolution</i>. 2016;33(3):770-782. doi:<a href=\"https://doi.org/10.1093/molbev/msv270\">10.1093/molbev/msv270</a>","ista":"Wielgoss S, Bergmiller T, Bischofberger AM, Hall AR. 2016. Adaptation to parasites and costs of parasite resistance in mutator and nonmutator bacteria. Molecular Biology and Evolution. 33(3), 770–782.","chicago":"Wielgoss, Sébastien, Tobias Bergmiller, Anna M. Bischofberger, and Alex R. Hall. “Adaptation to Parasites and Costs of Parasite Resistance in Mutator and Nonmutator Bacteria.” <i>Molecular Biology and Evolution</i>. Oxford University Press, 2016. <a href=\"https://doi.org/10.1093/molbev/msv270\">https://doi.org/10.1093/molbev/msv270</a>.","short":"S. Wielgoss, T. Bergmiller, A.M. Bischofberger, A.R. Hall, Molecular Biology and Evolution 33 (2016) 770–782.","mla":"Wielgoss, Sébastien, et al. “Adaptation to Parasites and Costs of Parasite Resistance in Mutator and Nonmutator Bacteria.” <i>Molecular Biology and Evolution</i>, vol. 33, no. 3, Oxford University Press, 2016, pp. 770–82, doi:<a href=\"https://doi.org/10.1093/molbev/msv270\">10.1093/molbev/msv270</a>.","apa":"Wielgoss, S., Bergmiller, T., Bischofberger, A. M., &#38; Hall, A. R. (2016). Adaptation to parasites and costs of parasite resistance in mutator and nonmutator bacteria. <i>Molecular Biology and Evolution</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/molbev/msv270\">https://doi.org/10.1093/molbev/msv270</a>"},"publication_status":"published","abstract":[{"lang":"eng","text":"Parasitism creates selection for resistance mechanisms in host populations and is hypothesized to promote increased host evolvability. However, the influence of these traits on host evolution when parasites are no longer present is unclear. We used experimental evolution and whole-genome sequencing of Escherichia coli to determine the effects of past and present exposure to parasitic viruses (phages) on the spread of mutator alleles, resistance, and bacterial competitive fitness. We found that mutator alleles spread rapidly during adaptation to any of four different phage species, and this pattern was even more pronounced with multiple phages present simultaneously. However, hypermutability did not detectably accelerate adaptation in the absence of phages and recovery of fitness costs associated with resistance. Several lineages evolved phage resistance through elevated mucoidy, and during subsequent evolution in phage-free conditions they rapidly reverted to nonmucoid, phage-susceptible phenotypes. Genome sequencing revealed that this phenotypic reversion was achieved by additional genetic changes rather than by genotypic reversion of the initial resistance mutations. Insertion sequence (IS) elements played a key role in both the acquisition of resistance and adaptation in the absence of parasites; unlike single nucleotide polymorphisms, IS insertions were not more frequent in mutator lineages. Our results provide a genetic explanation for rapid reversion of mucoidy, a phenotype observed in other bacterial species including human pathogens. Moreover, this demonstrates that the types of genetic change underlying adaptation to fitness costs, and consequently the impact of evolvability mechanisms such as increased point-mutation rates, depend critically on the mechanism of resistance."}],"related_material":{"record":[{"relation":"research_data","status":"public","id":"9719"}]},"oa":1,"ddc":["576"],"_id":"5749","title":"Adaptation to parasites and costs of parasite resistance in mutator and nonmutator bacteria","publication":"Molecular Biology and Evolution","pmid":1,"page":"770-782","date_published":"2016-03-01T00:00:00Z","external_id":{"pmid":["26609077"]},"file":[{"access_level":"open_access","file_name":"2016_MolBiolEvol_Wielgoss.pdf","checksum":"47d9010690b6c5c17f2ac830cc63ac5c","file_id":"5750","date_updated":"2020-07-14T12:47:10Z","file_size":634037,"content_type":"application/pdf","creator":"dernst","date_created":"2018-12-18T13:21:45Z","relation":"main_file"}],"publication_identifier":{"eissn":["1537-1719"],"issn":["0737-4038"]},"scopus_import":"1","day":"01","date_updated":"2023-09-05T13:46:05Z","type":"journal_article","oa_version":"Published Version","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","article_processing_charge":"No","acknowledgement":"The authors thank three anonymous reviewers and the editor for helpful comments on the manuscript, as well as Dominique Schneider for feedback on an earlier draft, Jenna Gallie for lytic λ and Julien Capelle for T5 and T6. This work was supported by the Swiss National Science Foundation (PZ00P3_148255 to A.H.) and an EU Marie Curie PEOPLE Postdoctoral Fellowship for Career Development (FP7-PEOPLE-2012-IEF-331824 to S.W.).","doi":"10.1093/molbev/msv270","language":[{"iso":"eng"}],"has_accepted_license":"1","department":[{"_id":"CaGu"}]},{"day":"02","oa_version":"None","type":"book_chapter","date_updated":"2022-01-28T08:01:22Z","article_processing_charge":"No","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","department":[{"_id":"HeEd"}],"doi":"10.1007/978-3-319-39441-1_23","language":[{"iso":"eng"}],"page":"253-264","date_published":"2016-06-02T00:00:00Z","publication_identifier":{"eisbn":["978-3-319-39441-1"],"issn":["0302-9743"],"eissn":["1611-3349"],"isbn":["978-3-319-39440-4"]},"alternative_title":["LNCS"],"year":"2016","quality_controlled":"1","extern":"1","author":[{"first_name":"Nabhasmita","last_name":"Sen","full_name":"Sen, Nabhasmita"},{"first_name":"Ranita","last_name":"Biswas","orcid":"0000-0002-5372-7890","full_name":"Biswas, Ranita","id":"3C2B033E-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Partha","last_name":"Bhowmick","full_name":"Bhowmick, Partha"}],"citation":{"short":"N. Sen, R. Biswas, P. Bhowmick, in:, Computational Topology in Image Context, Springer Nature, Cham, 2016, pp. 253–264.","chicago":"Sen, Nabhasmita, Ranita Biswas, and Partha Bhowmick. “On Some Local Topological Properties of Naive Discrete Sphere.” In <i>Computational Topology in Image Context</i>, 9667:253–64. Cham: Springer Nature, 2016. <a href=\"https://doi.org/10.1007/978-3-319-39441-1_23\">https://doi.org/10.1007/978-3-319-39441-1_23</a>.","ista":"Sen N, Biswas R, Bhowmick P. 2016.On some local topological properties of naive discrete sphere. In: Computational Topology in Image Context. LNCS, vol. 9667, 253–264.","ama":"Sen N, Biswas R, Bhowmick P. On some local topological properties of naive discrete sphere. In: <i>Computational Topology in Image Context</i>. Vol 9667. Cham: Springer Nature; 2016:253-264. doi:<a href=\"https://doi.org/10.1007/978-3-319-39441-1_23\">10.1007/978-3-319-39441-1_23</a>","ieee":"N. Sen, R. Biswas, and P. Bhowmick, “On some local topological properties of naive discrete sphere,” in <i>Computational Topology in Image Context</i>, vol. 9667, Cham: Springer Nature, 2016, pp. 253–264.","apa":"Sen, N., Biswas, R., &#38; Bhowmick, P. (2016). On some local topological properties of naive discrete sphere. In <i>Computational Topology in Image Context</i> (Vol. 9667, pp. 253–264). Cham: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-319-39441-1_23\">https://doi.org/10.1007/978-3-319-39441-1_23</a>","mla":"Sen, Nabhasmita, et al. “On Some Local Topological Properties of Naive Discrete Sphere.” <i>Computational Topology in Image Context</i>, vol. 9667, Springer Nature, 2016, pp. 253–64, doi:<a href=\"https://doi.org/10.1007/978-3-319-39441-1_23\">10.1007/978-3-319-39441-1_23</a>."},"abstract":[{"lang":"eng","text":"Discretization of sphere in the integer space follows a particular discretization scheme, which, in principle, conforms to some topological model. This eventually gives rise to interesting topological properties of a discrete spherical surface, which need to be investigated for its analytical characterization. This paper presents some novel results on the local topological properties of the naive model of discrete sphere. They follow from the bijection of each quadraginta octant of naive sphere with its projection map called f -map on the corresponding functional plane and from the characterization of certain jumps in the f-map. As an application, we have shown how these properties can be used in designing an efficient reconstruction algorithm for a naive spherical surface from an input voxel set when it is sparse or noisy."}],"publication_status":"published","_id":"5805","title":"On some local topological properties of naive discrete sphere","publication":"Computational Topology in Image Context","publisher":"Springer Nature","volume":9667,"status":"public","month":"06","conference":{"start_date":"2016-06-15","location":"Marseille, France","end_date":"2016-06-17","name":"CTIC: Computational Topology in Image Context"},"date_created":"2019-01-08T20:44:24Z","place":"Cham","intvolume":"      9667"},{"year":"2016","citation":{"ista":"Biswas R, Bhowmick P. 2016. On functionality of quadraginta octants of naive sphere with application to circle drawing. Discrete Geometry for Computer Imagery. DGCI: International Conference on Discrete Geometry for Computer Imagery, LNCS, vol. 9647, 256–267.","chicago":"Biswas, Ranita, and Partha Bhowmick. “On Functionality of Quadraginta Octants of Naive Sphere with Application to Circle Drawing.” In <i>Discrete Geometry for Computer Imagery</i>, 9647:256–67. Cham: Springer Nature, 2016. <a href=\"https://doi.org/10.1007/978-3-319-32360-2_20\">https://doi.org/10.1007/978-3-319-32360-2_20</a>.","short":"R. Biswas, P. Bhowmick, in:, Discrete Geometry for Computer Imagery, Springer Nature, Cham, 2016, pp. 256–267.","ama":"Biswas R, Bhowmick P. On functionality of quadraginta octants of naive sphere with application to circle drawing. In: <i>Discrete Geometry for Computer Imagery</i>. Vol 9647. Cham: Springer Nature; 2016:256-267. doi:<a href=\"https://doi.org/10.1007/978-3-319-32360-2_20\">10.1007/978-3-319-32360-2_20</a>","ieee":"R. Biswas and P. Bhowmick, “On functionality of quadraginta octants of naive sphere with application to circle drawing,” in <i>Discrete Geometry for Computer Imagery</i>, Nantes, France, 2016, vol. 9647, pp. 256–267.","apa":"Biswas, R., &#38; Bhowmick, P. (2016). On functionality of quadraginta octants of naive sphere with application to circle drawing. In <i>Discrete Geometry for Computer Imagery</i> (Vol. 9647, pp. 256–267). Cham: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-319-32360-2_20\">https://doi.org/10.1007/978-3-319-32360-2_20</a>","mla":"Biswas, Ranita, and Partha Bhowmick. “On Functionality of Quadraginta Octants of Naive Sphere with Application to Circle Drawing.” <i>Discrete Geometry for Computer Imagery</i>, vol. 9647, Springer Nature, 2016, pp. 256–67, doi:<a href=\"https://doi.org/10.1007/978-3-319-32360-2_20\">10.1007/978-3-319-32360-2_20</a>."},"extern":"1","author":[{"id":"3C2B033E-F248-11E8-B48F-1D18A9856A87","full_name":"Biswas, Ranita","orcid":"0000-0002-5372-7890","first_name":"Ranita","last_name":"Biswas"},{"full_name":"Bhowmick, Partha","first_name":"Partha","last_name":"Bhowmick"}],"quality_controlled":"1","abstract":[{"lang":"eng","text":"Although the concept of functional plane for naive plane is studied and reported in the literature in great detail, no similar study is yet found for naive sphere. This article exposes the first study in this line, opening up further prospects of analyzing the topological properties of sphere in the discrete space. We show that each quadraginta octant Q of a naive sphere forms a bijection with its projected pixel set on a unique coordinate plane, which thereby serves as the functional plane of Q, and hence gives rise to merely mono-jumps during back projection. The other two coordinate planes serve as para-functional and dia-functional planes for Q, as the former is ‘mono-jumping’ but not bijective, whereas the latter holds neither of the two. Owing to this, the quadraginta octants form symmetry groups and subgroups with equivalent jump conditions. We also show a potential application in generating a special class of discrete 3D circles based on back projection and jump bridging by Steiner voxels. A circle in this class possesses 4-symmetry, uniqueness, and bounded distance from the underlying real sphere and real plane."}],"publication_status":"published","title":"On functionality of quadraginta octants of naive sphere with application to circle drawing","publication":"Discrete Geometry for Computer Imagery","_id":"5806","publisher":"Springer Nature","volume":9647,"conference":{"start_date":"2016-04-18","location":"Nantes, France","end_date":"2016-04-20","name":"DGCI: International Conference on Discrete Geometry for Computer Imagery"},"month":"04","date_created":"2019-01-08T20:44:37Z","status":"public","intvolume":"      9647","place":"Cham","oa_version":"None","type":"conference","date_updated":"2022-01-28T08:10:11Z","day":"09","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","article_processing_charge":"No","department":[{"_id":"HeEd"}],"doi":"10.1007/978-3-319-32360-2_20","language":[{"iso":"eng"}],"date_published":"2016-04-09T00:00:00Z","page":"256-267","alternative_title":["LNCS"],"publication_identifier":{"isbn":["978-3-319-32359-6"],"issn":["0302-9743","1611-3349"],"eisbn":["978-3-319-32360-2"]}},{"conference":{"name":"IWCIA: International Workshop on Combinatorial Image Analysis","end_date":"2015-11-27","start_date":"2015-11-24","location":"Kolkata, India"},"month":"01","date_created":"2019-01-08T20:45:19Z","status":"public","intvolume":"      9448","place":"Cham","publication_identifier":{"eissn":["1611-3349"],"isbn":["978-3-319-26144-7"],"eisbn":["978-3-319-26145-4"],"issn":["0302-9743"]},"publisher":"Springer Nature","date_published":"2016-01-06T00:00:00Z","page":"86-100","volume":9448,"abstract":[{"lang":"eng","text":"A discrete spherical circle is a topologically well-connected 3D circle in the integer space, which belongs to a discrete sphere as well as a discrete plane. It is one of the most important 3D geometric primitives, but has not possibly yet been studied up to its merit. This paper is a maiden exposition of some of its elementary properties, which indicates a sense of its profound theoretical prospects in the framework of digital geometry. We have shown how different types of discretization can lead to forbidden and admissible classes, when one attempts to define the discretization of a spherical circle in terms of intersection between a discrete sphere and a discrete plane. Several fundamental theoretical results have been presented, the algorithm for construction of discrete spherical circles has been discussed, and some test results have been furnished to demonstrate its practicality and usefulness."}],"publication_status":"published","title":"On the connectivity and smoothness of discrete spherical circles","publication":"Combinatorial image analysis","department":[{"_id":"HeEd"}],"_id":"5809","doi":"10.1007/978-3-319-26145-4_7","language":[{"iso":"eng"}],"oa_version":"None","date_updated":"2022-01-28T08:13:03Z","type":"book_chapter","year":"2016","day":"06","citation":{"apa":"Biswas, R., Bhowmick, P., &#38; Brimkov, V. E. (2016). On the connectivity and smoothness of discrete spherical circles. In <i>Combinatorial image analysis</i> (Vol. 9448, pp. 86–100). Cham: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-319-26145-4_7\">https://doi.org/10.1007/978-3-319-26145-4_7</a>","mla":"Biswas, Ranita, et al. “On the Connectivity and Smoothness of Discrete Spherical Circles.” <i>Combinatorial Image Analysis</i>, vol. 9448, Springer Nature, 2016, pp. 86–100, doi:<a href=\"https://doi.org/10.1007/978-3-319-26145-4_7\">10.1007/978-3-319-26145-4_7</a>.","chicago":"Biswas, Ranita, Partha Bhowmick, and Valentin E. Brimkov. “On the Connectivity and Smoothness of Discrete Spherical Circles.” In <i>Combinatorial Image Analysis</i>, 9448:86–100. Cham: Springer Nature, 2016. <a href=\"https://doi.org/10.1007/978-3-319-26145-4_7\">https://doi.org/10.1007/978-3-319-26145-4_7</a>.","short":"R. Biswas, P. Bhowmick, V.E. Brimkov, in:, Combinatorial Image Analysis, Springer Nature, Cham, 2016, pp. 86–100.","ista":"Biswas R, Bhowmick P, Brimkov VE. 2016.On the connectivity and smoothness of discrete spherical circles. In: Combinatorial image analysis. vol. 9448, 86–100.","ama":"Biswas R, Bhowmick P, Brimkov VE. On the connectivity and smoothness of discrete spherical circles. In: <i>Combinatorial Image Analysis</i>. Vol 9448. Cham: Springer Nature; 2016:86-100. doi:<a href=\"https://doi.org/10.1007/978-3-319-26145-4_7\">10.1007/978-3-319-26145-4_7</a>","ieee":"R. Biswas, P. Bhowmick, and V. E. Brimkov, “On the connectivity and smoothness of discrete spherical circles,” in <i>Combinatorial image analysis</i>, vol. 9448, Cham: Springer Nature, 2016, pp. 86–100."},"author":[{"id":"3C2B033E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-5372-7890","full_name":"Biswas, Ranita","first_name":"Ranita","last_name":"Biswas"},{"full_name":"Bhowmick, Partha","first_name":"Partha","last_name":"Bhowmick"},{"full_name":"Brimkov, Valentin E.","first_name":"Valentin E.","last_name":"Brimkov"}],"quality_controlled":"1","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","extern":"1","article_processing_charge":"No"},{"quality_controlled":"1","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Gnügge, Robert","last_name":"Gnügge","first_name":"Robert"},{"first_name":"Lekshmi","last_name":"Dharmarajan","full_name":"Dharmarajan, Lekshmi"},{"first_name":"Moritz","last_name":"Lang","id":"29E0800A-F248-11E8-B48F-1D18A9856A87","full_name":"Lang, Moritz"},{"first_name":"Jörg","last_name":"Stelling","full_name":"Stelling, Jörg"}],"citation":{"ieee":"R. Gnügge, L. Dharmarajan, M. Lang, and J. Stelling, “An orthogonal permease–inducer–repressor feedback loop shows bistability,” <i>ACS Synthetic Biology</i>, vol. 5, no. 10. American Chemical Society, pp. 1098–1107, 2016.","ama":"Gnügge R, Dharmarajan L, Lang M, Stelling J. An orthogonal permease–inducer–repressor feedback loop shows bistability. <i>ACS Synthetic Biology</i>. 2016;5(10):1098-1107. doi:<a href=\"https://doi.org/10.1021/acssynbio.6b00013\">10.1021/acssynbio.6b00013</a>","ista":"Gnügge R, Dharmarajan L, Lang M, Stelling J. 2016. An orthogonal permease–inducer–repressor feedback loop shows bistability. ACS Synthetic Biology. 5(10), 1098–1107.","chicago":"Gnügge, Robert, Lekshmi Dharmarajan, Moritz Lang, and Jörg Stelling. “An Orthogonal Permease–Inducer–Repressor Feedback Loop Shows Bistability.” <i>ACS Synthetic Biology</i>. American Chemical Society, 2016. <a href=\"https://doi.org/10.1021/acssynbio.6b00013\">https://doi.org/10.1021/acssynbio.6b00013</a>.","short":"R. Gnügge, L. Dharmarajan, M. Lang, J. Stelling, ACS Synthetic Biology 5 (2016) 1098–1107.","mla":"Gnügge, Robert, et al. “An Orthogonal Permease–Inducer–Repressor Feedback Loop Shows Bistability.” <i>ACS Synthetic Biology</i>, vol. 5, no. 10, American Chemical Society, 2016, pp. 1098–107, doi:<a href=\"https://doi.org/10.1021/acssynbio.6b00013\">10.1021/acssynbio.6b00013</a>.","apa":"Gnügge, R., Dharmarajan, L., Lang, M., &#38; Stelling, J. (2016). An orthogonal permease–inducer–repressor feedback loop shows bistability. <i>ACS Synthetic Biology</i>. American Chemical Society. <a href=\"https://doi.org/10.1021/acssynbio.6b00013\">https://doi.org/10.1021/acssynbio.6b00013</a>"},"day":"05","year":"2016","date_updated":"2021-01-12T06:47:37Z","type":"journal_article","oa_version":"None","language":[{"iso":"eng"}],"doi":"10.1021/acssynbio.6b00013","_id":"1008","department":[{"_id":"CaGu"}],"publication":"ACS Synthetic Biology","title":"An orthogonal permease–inducer–repressor feedback loop shows bistability","publication_status":"published","abstract":[{"lang":"eng","text":"Feedback loops in biological networks, among others, enable differentiation and cell cycle progression, and increase robustness in signal transduction. In natural networks, feedback loops are often complex and intertwined, making it challenging to identify which loops are mainly responsible for an observed behavior. However, minimal synthetic replicas could allow for such identification. Here, we engineered a synthetic permease-inducer-repressor system in Saccharomyces cerevisiae to analyze if a transport-mediated positive feedback loop could be a core mechanism for the switch-like behavior in the regulation of metabolic gene networks such as the S. cerevisiae GAL system or the Escherichia coli lac operon. We characterized the synthetic circuit using deterministic and stochastic mathematical models. Similar to its natural counterparts, our synthetic system shows bistable and hysteretic behavior, and the inducer concentration range for bistability as well as the switching rates between the two stable states depend on the repressor concentration. Our results indicate that a generic permease–inducer–repressor circuit with a single feedback loop is sufficient to explain the experimentally observed bistable behavior of the natural systems. We anticipate that the approach of reimplementing natural systems with orthogonal parts to identify crucial network components is applicable to other natural systems such as signaling pathways."}],"acknowledgement":"We thank Julio Polaina (Instituto de Agroqu ı ́ mica y Tecnolog ı ́ a de Alimentos, C.S.I.C., Paterna, Spain) for the gift of plasmid pMR4, Gregor W. Schmidt for provision of and support with the micro fl uidic device, Markus Du ̈ rr for the cell tracking R script, and Lukas Widmer for the script for MEIGO using “ parfor ” in MATLAB. We acknowledge the members of the Stelling group for discussions, comments, and support.","issue":"10","page":"1098 - 1107","volume":5,"date_published":"2016-05-05T00:00:00Z","publisher":"American Chemical Society","publist_id":"6390","intvolume":"         5","status":"public","date_created":"2018-12-11T11:49:40Z","month":"05"},{"tmp":{"short":"CC BY (3.0)","legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)","image":"/images/cc_by.png"},"year":"2016","citation":{"apa":"Chatterjee, K., Dvorák, W., Henzinger, M. H., &#38; Loitzenbauer, V. (2016). Conditionally optimal algorithms for generalized Büchi Games (Vol. 58). Presented at the MFCS: Mathematical Foundations of Computer Science (SG), Krakow, Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2016.25\">https://doi.org/10.4230/LIPIcs.MFCS.2016.25</a>","mla":"Chatterjee, Krishnendu, et al. <i>Conditionally Optimal Algorithms for Generalized Büchi Games</i>. Vol. 58, 25, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016, doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2016.25\">10.4230/LIPIcs.MFCS.2016.25</a>.","chicago":"Chatterjee, Krishnendu, Wolfgang Dvorák, Monika H Henzinger, and Veronika Loitzenbauer. “Conditionally Optimal Algorithms for Generalized Büchi Games,” Vol. 58. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016. <a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2016.25\">https://doi.org/10.4230/LIPIcs.MFCS.2016.25</a>.","short":"K. Chatterjee, W. Dvorák, M.H. Henzinger, V. Loitzenbauer, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016.","ista":"Chatterjee K, Dvorák W, Henzinger MH, Loitzenbauer V. 2016. Conditionally optimal algorithms for generalized Büchi Games. MFCS: Mathematical Foundations of Computer Science (SG), LIPIcs, vol. 58, 25.","ama":"Chatterjee K, Dvorák W, Henzinger MH, Loitzenbauer V. Conditionally optimal algorithms for generalized Büchi Games. In: Vol 58. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2016. doi:<a href=\"https://doi.org/10.4230/LIPIcs.MFCS.2016.25\">10.4230/LIPIcs.MFCS.2016.25</a>","ieee":"K. Chatterjee, W. Dvorák, M. H. Henzinger, and V. Loitzenbauer, “Conditionally optimal algorithms for generalized Büchi Games,” presented at the MFCS: Mathematical Foundations of Computer Science (SG), Krakow, Poland, 2016, vol. 58."},"author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu"},{"last_name":"Dvorák","first_name":"Wolfgang","full_name":"Dvorák, Wolfgang"},{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","first_name":"Monika H","last_name":"Henzinger"},{"first_name":"Veronika","last_name":"Loitzenbauer","full_name":"Loitzenbauer, Veronika"}],"quality_controlled":"1","project":[{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425"}],"abstract":[{"text":"Games on graphs provide the appropriate framework to study several central problems in computer science, such as verification and synthesis of reactive systems. One of the most basic objectives for games on graphs is the liveness (or Büchi) objective that given a target set of vertices requires that some vertex in the target set is visited infinitely often. We study generalized Büchi objectives (i.e., conjunction of liveness objectives), and implications between two generalized Büchi objectives (known as GR(1) objectives), that arise in numerous applications in computer-aided verification. We present improved algorithms and conditional super-linear lower bounds based on widely believed assumptions about the complexity of (A1) combinatorial Boolean matrix multiplication and (A2) CNF-SAT. We consider graph games with n vertices, m edges, and generalized Büchi objectives with k conjunctions. First, we present an algorithm with running time O(k*n^2), improving the previously known O(k*n*m) and O(k^2*n^2) worst-case bounds. Our algorithm is optimal for dense graphs under (A1). Second, we show that the basic algorithm for the problem is optimal for sparse graphs when the target sets have constant size under (A2). Finally, we consider GR(1) objectives, with k_1 conjunctions in the antecedent and k_2 conjunctions in the consequent, and present an O(k_1 k_2 n^{2.5})-time algorithm, improving the previously known O(k_1*k_2*n*m)-time algorithm for m &gt; n^{1.5}. ","lang":"eng"}],"publication_status":"published","title":"Conditionally optimal algorithms for generalized Büchi Games","_id":"1068","oa":1,"ddc":["000","004","006"],"file_date_updated":"2018-12-12T10:16:02Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","pubrep_id":"779","volume":58,"conference":{"name":"MFCS: Mathematical Foundations of Computer Science (SG)","end_date":"2016-08-26","start_date":"2016-08-22","location":"Krakow, Poland"},"month":"08","date_created":"2018-12-11T11:49:58Z","article_number":"25","status":"public","intvolume":"        58","publist_id":"6317","oa_version":"Published Version","date_updated":"2025-06-02T08:53:50Z","type":"conference","day":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","acknowledgement":"K. C., M. H., and W. D. are partially supported by the Vienna Science and Technology Fund (WWTF) through project ICT15-003. K. C. is partially supported by the Austrian Science Fund (FWF) NFN Grant No S11407-N23 (RiSE/SHiNE) and an ERC Start grant (279307","ec_funded":1,"has_accepted_license":"1","department":[{"_id":"KrCh"}],"doi":"10.4230/LIPIcs.MFCS.2016.25","license":"https://creativecommons.org/licenses/by/3.0/","language":[{"iso":"eng"}],"file":[{"relation":"main_file","date_created":"2018-12-12T10:16:02Z","file_size":632786,"content_type":"application/pdf","creator":"system","file_id":"5187","date_updated":"2018-12-12T10:16:02Z","file_name":"IST-2017-779-v1+1_LIPIcs-MFCS-2016-25.pdf","access_level":"open_access"}],"date_published":"2016-08-01T00:00:00Z","alternative_title":["LIPIcs"],"scopus_import":"1"},{"doi":"10.4230/LIPIcs.ICALP.2016.100","language":[{"iso":"eng"}],"has_accepted_license":"1","department":[{"_id":"KrCh"}],"ec_funded":1,"acknowledgement":"Ventsislav Chonev is supported by Austrian Science Fund (FWF) NFN Grant No S11407-N23 (RiSE/SHiNE), ERC Start grant (279307:  Graph Games), and ERC Advanced Grant (267989: QUAREM).","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","day":"01","date_updated":"2021-01-12T06:48:03Z","type":"conference","oa_version":"Published Version","scopus_import":1,"alternative_title":["LIPIcs"],"date_published":"2016-08-01T00:00:00Z","file":[{"file_id":"5213","date_updated":"2018-12-12T10:16:26Z","access_level":"open_access","file_name":"IST-2017-778-v1+1_LIPIcs-ICALP-2016-100.pdf","date_created":"2018-12-12T10:16:26Z","relation":"main_file","content_type":"application/pdf","creator":"system","file_size":521415}],"ddc":["004","006"],"oa":1,"_id":"1069","title":"On the skolem problem for continuous linear dynamical systems","publication_status":"published","abstract":[{"lang":"eng","text":"The Continuous Skolem Problem asks whether a real-valued function satisfying a linear differen-\r\ntial equation has a zero in a given interval of real numbers. This is a fundamental reachability\r\nproblem for continuous linear dynamical systems, such as linear hybrid automata and continuous-\r\ntime Markov chains. Decidability of the problem is currently open – indeed decidability is open\r\neven for the sub-problem in which a zero is sought in a bounded interval. In this paper we show\r\ndecidability of the bounded problem subject to Schanuel’s Conjecture, a unifying conjecture in\r\ntranscendental number theory. We furthermore analyse the unbounded problem in terms of the\r\nfrequencies of the differential equation, that is, the imaginary parts of the characteristic roots.\r\nWe show that the unbounded problem can be reduced to the bounded problem if there is at most\r\none rationally linearly independent frequency, or if there are two rationally linearly independent\r\nfrequencies and all characteristic roots are simple. We complete the picture by showing that de-\r\ncidability of the unbounded problem in the case of two (or more) rationally linearly independent\r\nfrequencies would entail a major new effectiveness result in Diophantine approximation, namely\r\ncomputability of the Diophantine-approximation types of all real algebraic numbers."}],"project":[{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"},{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"267989","name":"Quantitative Reactive Modeling"}],"quality_controlled":"1","author":[{"id":"36CBE2E6-F248-11E8-B48F-1D18A9856A87","full_name":"Chonev, Ventsislav K","last_name":"Chonev","first_name":"Ventsislav K"},{"full_name":"Ouaknine, Joël","last_name":"Ouaknine","first_name":"Joël"},{"full_name":"Worrell, James","last_name":"Worrell","first_name":"James"}],"citation":{"mla":"Chonev, Ventsislav K., et al. <i>On the Skolem Problem for Continuous Linear Dynamical Systems</i>. Vol. 55, 100, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik, 2016, doi:<a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2016.100\">10.4230/LIPIcs.ICALP.2016.100</a>.","apa":"Chonev, V. K., Ouaknine, J., &#38; Worrell, J. (2016). On the skolem problem for continuous linear dynamical systems (Vol. 55). Presented at the ICALP: Automata, Languages and Programming, Rome, Italy: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2016.100\">https://doi.org/10.4230/LIPIcs.ICALP.2016.100</a>","ama":"Chonev VK, Ouaknine J, Worrell J. On the skolem problem for continuous linear dynamical systems. In: Vol 55. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik; 2016. doi:<a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2016.100\">10.4230/LIPIcs.ICALP.2016.100</a>","ieee":"V. K. Chonev, J. Ouaknine, and J. Worrell, “On the skolem problem for continuous linear dynamical systems,” presented at the ICALP: Automata, Languages and Programming, Rome, Italy, 2016, vol. 55.","ista":"Chonev VK, Ouaknine J, Worrell J. 2016. On the skolem problem for continuous linear dynamical systems. ICALP: Automata, Languages and Programming, LIPIcs, vol. 55, 100.","chicago":"Chonev, Ventsislav K, Joël Ouaknine, and James Worrell. “On the Skolem Problem for Continuous Linear Dynamical Systems,” Vol. 55. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik, 2016. <a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2016.100\">https://doi.org/10.4230/LIPIcs.ICALP.2016.100</a>.","short":"V.K. Chonev, J. Ouaknine, J. Worrell, in:, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik, 2016."},"year":"2016","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"publist_id":"6314","intvolume":"        55","article_number":"100","status":"public","date_created":"2018-12-11T11:49:59Z","month":"08","conference":{"start_date":"2016-07-12","location":"Rome, Italy","end_date":"2016-07-15","name":"ICALP: Automata, Languages and Programming"},"volume":55,"pubrep_id":"778","publisher":"Schloss Dagstuhl- Leibniz-Zentrum fur Informatik","file_date_updated":"2018-12-12T10:16:26Z"},{"date_created":"2018-12-11T11:49:59Z","month":"01","conference":{"end_date":"2016-07-15","name":"ICALP: Automata, Languages and Programming","start_date":"2016-07-12","location":"Rome, Italy"},"article_number":"98","status":"public","intvolume":"        55","publist_id":"6313","file_date_updated":"2018-12-12T10:08:52Z","publisher":"Schloss Dagstuhl- Leibniz-Zentrum fur Informatik","volume":55,"pubrep_id":"812","project":[{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003","name":"Efficient Algorithms for Computer Aided Verification"}],"publication_status":"published","abstract":[{"text":"We present a logic that extends CTL (Computation Tree Logic) with operators that express synchronization properties. A property is synchronized in a system if it holds in all paths of a certain length. The new logic is obtained by using the same path quantifiers and temporal operators as in CTL, but allowing a different order of the quantifiers. This small syntactic variation induces a logic that can express non-regular properties for which known extensions of MSO with equality of path length are undecidable. We show that our variant of CTL is decidable and that the model-checking problem is in Delta_3^P = P^{NP^NP}, and is DP-hard. We analogously consider quantifier exchange in extensions of CTL, and we present operators defined using basic operators of CTL* that express the occurrence of infinitely many synchronization points. We show that the model-checking problem remains in Delta_3^P. The distinguishing power of CTL and of our new logic coincide if the Next operator is allowed in the logics, thus the classical bisimulation quotient can be used for state-space reduction before model checking. ","lang":"eng"}],"title":"Computation tree logic for synchronization properties","ddc":["005"],"oa":1,"_id":"1070","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"year":"2016","citation":{"apa":"Chatterjee, K., &#38; Doyen, L. (2016). Computation tree logic for synchronization properties (Vol. 55). Presented at the ICALP: Automata, Languages and Programming, Rome, Italy: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2016.98\">https://doi.org/10.4230/LIPIcs.ICALP.2016.98</a>","mla":"Chatterjee, Krishnendu, and Laurent Doyen. <i>Computation Tree Logic for Synchronization Properties</i>. Vol. 55, 98, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik, 2016, doi:<a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2016.98\">10.4230/LIPIcs.ICALP.2016.98</a>.","ieee":"K. Chatterjee and L. Doyen, “Computation tree logic for synchronization properties,” presented at the ICALP: Automata, Languages and Programming, Rome, Italy, 2016, vol. 55.","ama":"Chatterjee K, Doyen L. Computation tree logic for synchronization properties. In: Vol 55. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik; 2016. doi:<a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2016.98\">10.4230/LIPIcs.ICALP.2016.98</a>","ista":"Chatterjee K, Doyen L. 2016. Computation tree logic for synchronization properties. ICALP: Automata, Languages and Programming, LIPIcs, vol. 55, 98.","chicago":"Chatterjee, Krishnendu, and Laurent Doyen. “Computation Tree Logic for Synchronization Properties,” Vol. 55. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik, 2016. <a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2016.98\">https://doi.org/10.4230/LIPIcs.ICALP.2016.98</a>.","short":"K. Chatterjee, L. Doyen, in:, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik, 2016."},"quality_controlled":"1","author":[{"first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"last_name":"Doyen","first_name":"Laurent","full_name":"Doyen, Laurent"}],"alternative_title":["LIPIcs"],"scopus_import":1,"date_published":"2016-01-01T00:00:00Z","file":[{"access_level":"open_access","file_name":"IST-2017-812-v1+1_LIPIcs-ICALP-2016-98.pdf","date_updated":"2018-12-12T10:08:52Z","file_id":"4714","creator":"system","content_type":"application/pdf","file_size":546133,"date_created":"2018-12-12T10:08:52Z","relation":"main_file"}],"acknowledgement":"This research was partially supported by Austrian Science Fund (FWF) NFN Grant No S11407-N23 (RiSE/SHiNE), ERC Start grant (279307: Graph Games), Vienna Science and Technology Fund (WWTF) through project ICT15-003, and European project Cassting (FP7-601148).\r\n\r\nWe thank Stefan Göller and anonymous reviewers for their insightful\r\ncomments and suggestions.\r\n","ec_funded":1,"doi":"10.4230/LIPIcs.ICALP.2016.98","language":[{"iso":"eng"}],"department":[{"_id":"KrCh"}],"has_accepted_license":"1","date_updated":"2021-01-12T06:48:03Z","type":"conference","oa_version":"Published Version","day":"01","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87"},{"file_date_updated":"2018-12-12T10:14:31Z","publisher":"Schloss Dagstuhl- Leibniz-Zentrum fur Informatik","pubrep_id":"777","volume":57,"conference":{"end_date":"2016-08-24","name":"ESA: European Symposium on Algorithms","start_date":"2016-08-22","location":"Aarhus, Denmark"},"month":"08","date_created":"2018-12-11T11:49:59Z","status":"public","article_number":"28","intvolume":"        57","publist_id":"6312","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"year":"2016","citation":{"mla":"Chatterjee, Krishnendu, et al. <i>Optimal Reachability and a Space Time Tradeoff for Distance Queries in Constant Treewidth Graphs</i>. Vol. 57, 28, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik, 2016, doi:<a href=\"https://doi.org/10.4230/LIPIcs.ESA.2016.28\">10.4230/LIPIcs.ESA.2016.28</a>.","apa":"Chatterjee, K., Ibsen-Jensen, R., &#38; Pavlogiannis, A. (2016). Optimal reachability and a space time tradeoff for distance queries in constant treewidth graphs (Vol. 57). Presented at the ESA: European Symposium on Algorithms, Aarhus, Denmark: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.ESA.2016.28\">https://doi.org/10.4230/LIPIcs.ESA.2016.28</a>","ista":"Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. 2016. Optimal reachability and a space time tradeoff for distance queries in constant treewidth graphs. ESA: European Symposium on Algorithms, LIPIcs, vol. 57, 28.","short":"K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, in:, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik, 2016.","chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. “Optimal Reachability and a Space Time Tradeoff for Distance Queries in Constant Treewidth Graphs,” Vol. 57. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik, 2016. <a href=\"https://doi.org/10.4230/LIPIcs.ESA.2016.28\">https://doi.org/10.4230/LIPIcs.ESA.2016.28</a>.","ieee":"K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, “Optimal reachability and a space time tradeoff for distance queries in constant treewidth graphs,” presented at the ESA: European Symposium on Algorithms, Aarhus, Denmark, 2016, vol. 57.","ama":"Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. Optimal reachability and a space time tradeoff for distance queries in constant treewidth graphs. In: Vol 57. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik; 2016. doi:<a href=\"https://doi.org/10.4230/LIPIcs.ESA.2016.28\">10.4230/LIPIcs.ESA.2016.28</a>"},"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee"},{"orcid":"0000-0003-4783-0389","full_name":"Ibsen-Jensen, Rasmus","id":"3B699956-F248-11E8-B48F-1D18A9856A87","last_name":"Ibsen-Jensen","first_name":"Rasmus"},{"last_name":"Pavlogiannis","first_name":"Andreas","orcid":"0000-0002-8943-0722","full_name":"Pavlogiannis, Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87"}],"quality_controlled":"1","project":[{"grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"},{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425"}],"abstract":[{"text":"We consider data-structures for answering reachability and distance queries on constant-treewidth graphs with n nodes, on the standard RAM computational model with wordsize W=Theta(log n). Our first contribution is a data-structure that after O(n) preprocessing time, allows (1) pair reachability queries in O(1) time; and (2) single-source reachability queries in O(n/log n) time. This is (asymptotically) optimal and is faster than DFS/BFS when answering more than a constant number of single-source queries. The data-structure uses at all times O(n) space. Our second contribution is a space-time tradeoff data-structure for distance queries. For any epsilon in [1/2,1], we provide a data-structure with polynomial preprocessing time that allows pair queries in O(n^{1-\\epsilon} alpha(n)) time, where alpha is the inverse of the Ackermann function, and at all times uses O(n^epsilon) space. The input graph G is not considered in the space complexity. ","lang":"eng"}],"publication_status":"published","title":"Optimal reachability and a space time tradeoff for distance queries in constant treewidth graphs","_id":"1071","ddc":["004","006"],"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"821"}]},"oa":1,"file":[{"date_updated":"2018-12-12T10:14:31Z","file_id":"5084","file_name":"IST-2017-777-v1+1_LIPIcs-ESA-2016-28.pdf","access_level":"open_access","relation":"main_file","date_created":"2018-12-12T10:14:31Z","content_type":"application/pdf","creator":"system","file_size":579225}],"date_published":"2016-08-01T00:00:00Z","alternative_title":["LIPIcs"],"scopus_import":1,"oa_version":"Published Version","type":"conference","date_updated":"2023-09-07T12:01:58Z","day":"01","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","acknowledgement":"The research was partly supported by Austrian Science Fund (FWF) Grant No P23499-N23, FWF NFN Grant No S11407-N23 (RiSE/SHiNE) and ERC Start grant (279307: Graph Games).","ec_funded":1,"has_accepted_license":"1","department":[{"_id":"KrCh"}],"language":[{"iso":"eng"}],"doi":"10.4230/LIPIcs.ESA.2016.28"},{"publist_id":"6299","intvolume":"         2","status":"public","article_number":"16018","month":"07","date_created":"2018-12-11T11:50:02Z","pubrep_id":"757","volume":2,"publisher":"Nature Publishing Group","file_date_updated":"2018-12-12T10:13:33Z","_id":"1081","ddc":["580"],"oa":1,"publication":"Cell Discovery","title":"Cellular mechanisms for cargo delivery and polarity maintenance at different polar domains in plant cells","abstract":[{"lang":"eng","text":"The asymmetric localization of proteins in the plasma membrane domains of eukaryotic cells is a fundamental manifestation of cell polarity that is central to multicellular organization and developmental patterning. In plants, the mechanisms underlying the polar localization of cargo proteins are still largely unknown and appear to be fundamentally distinct from those operating in mammals. Here, we present a systematic, quantitative comparative analysis of the polar delivery and subcellular localization of proteins that characterize distinct polar plasma membrane domains in plant cells. The combination of microscopic analyses and computational modeling revealed a mechanistic framework common to diverse polar cargos and underlying the establishment and maintenance of apical, basal, and lateral polar domains in plant cells. This mechanism depends on the polar secretion, constitutive endocytic recycling, and restricted lateral diffusion of cargos within the plasma membrane. Moreover, our observations suggest that polar cargo distribution involves the individual protein potential to form clusters within the plasma membrane and interact with the extracellular matrix. Our observations provide insights into the shared cellular mechanisms of polar cargo delivery and polarity maintenance in plant cells."}],"publication_status":"published","project":[{"call_identifier":"FP7","_id":"25716A02-B435-11E9-9278-68D0E5697425","grant_number":"282300","name":"Polarity and subcellular dynamics in plants"}],"quality_controlled":"1","author":[{"first_name":"Łukasz","last_name":"Łangowski","full_name":"Łangowski, Łukasz"},{"id":"4DE369A4-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-7263-0560","full_name":"Wabnik, Krzysztof T","last_name":"Wabnik","first_name":"Krzysztof T"},{"orcid":"0000-0001-5039-9660","full_name":"Li, Hongjiang","id":"33CA54A6-F248-11E8-B48F-1D18A9856A87","first_name":"Hongjiang","last_name":"Li"},{"full_name":"Vanneste, Steffen","first_name":"Steffen","last_name":"Vanneste"},{"full_name":"Naramoto, Satoshi","first_name":"Satoshi","last_name":"Naramoto"},{"full_name":"Tanaka, Hirokazu","last_name":"Tanaka","first_name":"Hirokazu"},{"first_name":"Jirí","last_name":"Friml","id":"4159519E-F248-11E8-B48F-1D18A9856A87","full_name":"Friml, Jirí","orcid":"0000-0002-8302-7596"}],"citation":{"chicago":"Łangowski, Łukasz, Krzysztof T Wabnik, Hongjiang Li, Steffen Vanneste, Satoshi Naramoto, Hirokazu Tanaka, and Jiří Friml. “Cellular Mechanisms for Cargo Delivery and Polarity Maintenance at Different Polar Domains in Plant Cells.” <i>Cell Discovery</i>. Nature Publishing Group, 2016. <a href=\"https://doi.org/10.1038/celldisc.2016.18\">https://doi.org/10.1038/celldisc.2016.18</a>.","short":"Ł. Łangowski, K.T. Wabnik, H. Li, S. Vanneste, S. Naramoto, H. Tanaka, J. Friml, Cell Discovery 2 (2016).","ista":"Łangowski Ł, Wabnik KT, Li H, Vanneste S, Naramoto S, Tanaka H, Friml J. 2016. Cellular mechanisms for cargo delivery and polarity maintenance at different polar domains in plant cells. Cell Discovery. 2, 16018.","ama":"Łangowski Ł, Wabnik KT, Li H, et al. Cellular mechanisms for cargo delivery and polarity maintenance at different polar domains in plant cells. <i>Cell Discovery</i>. 2016;2. doi:<a href=\"https://doi.org/10.1038/celldisc.2016.18\">10.1038/celldisc.2016.18</a>","ieee":"Ł. Łangowski <i>et al.</i>, “Cellular mechanisms for cargo delivery and polarity maintenance at different polar domains in plant cells,” <i>Cell Discovery</i>, vol. 2. Nature Publishing Group, 2016.","mla":"Łangowski, Łukasz, et al. “Cellular Mechanisms for Cargo Delivery and Polarity Maintenance at Different Polar Domains in Plant Cells.” <i>Cell Discovery</i>, vol. 2, 16018, Nature Publishing Group, 2016, doi:<a href=\"https://doi.org/10.1038/celldisc.2016.18\">10.1038/celldisc.2016.18</a>.","apa":"Łangowski, Ł., Wabnik, K. T., Li, H., Vanneste, S., Naramoto, S., Tanaka, H., &#38; Friml, J. (2016). Cellular mechanisms for cargo delivery and polarity maintenance at different polar domains in plant cells. <i>Cell Discovery</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/celldisc.2016.18\">https://doi.org/10.1038/celldisc.2016.18</a>"},"year":"2016","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"scopus_import":1,"file":[{"relation":"main_file","date_created":"2018-12-12T10:13:33Z","file_size":5261671,"creator":"system","content_type":"application/pdf","date_updated":"2018-12-12T10:13:33Z","file_id":"5017","file_name":"IST-2017-757-v1+1_celldisc201618.pdf","access_level":"open_access"}],"date_published":"2016-07-19T00:00:00Z","has_accepted_license":"1","department":[{"_id":"EvBe"},{"_id":"JiFr"}],"doi":"10.1038/celldisc.2016.18","language":[{"iso":"eng"}],"ec_funded":1,"acknowledgement":"We thank Bonnie Bartel, Jenny Russinova and Niko Geldner\r\nfor sharing published material, Martine de Cock and Annick\r\nBleys for help in preparing the manuscript. This work was\r\nsupported by the European Research Council (project\r\nERC-2011-StG-20101109-PSDP); Czech Science Foundation\r\nGAČR (GA13-40637S); project CEITEC—Central European\r\nInstitute of Technology (CZ.1.05/1.1.00/02.0068). SV is a\r\npostdoctoral fellow of the Research Foundation-Flanders.\r\nSN is a Project Assistant Professor supported by the Japanese\r\nSociety for the Promotion of Science (JSPS; 30612022 to SN),\r\nthe NC-CARP project of the Ministry of Education, Culture,\r\nSports, Science and Technology in Japan to SN.","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","day":"19","oa_version":"Published Version","date_updated":"2021-01-12T06:48:08Z","type":"journal_article"},{"publication_identifier":{"issn":["2325-887X"]},"scopus_import":"1","page":"309-312","date_published":"2016-03-01T00:00:00Z","doi":"10.22489/cinc.2016.090-500","language":[{"iso":"eng"}],"department":[{"_id":"CampIT"}],"acknowledgement":"The authors are thankful to Drs. Roger Abaecherli, Nikus Kjell, Paul Kligfield, Jay Mason, Patrice Nony, Vito Starc, Anders Thurin and the late Galen Wagner for their in depth review and constructive comments.","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"01","date_updated":"2022-03-04T07:34:45Z","type":"conference","oa_version":"Published Version","intvolume":"        43","status":"public","date_created":"2022-03-03T10:43:10Z","conference":{"location":"Vancouver, Canada","start_date":"2016-09-11","name":"CinC: Computing in Cardiology","end_date":"2016-09-14"},"month":"03","volume":43,"publisher":"Computing in Cardiology","oa":1,"_id":"10810","title":"SCP-ECG V3.0: An enhanced standard communication protocol for computer-assisted electrocardiography","publication":"2016 Computing in Cardiology Conference","publication_status":"published","abstract":[{"text":"The main goal of the SCP-ECG standard is to address ECG data and related metadata structuring, semantics and syntax, with the objective of facilitating interoperability and thus supporting and promoting the exchange of the relevant information for unary and serial ECG diagnosis. Starting with version V3.0, the standard now also provides support for the storage of continuous, long-term ECG recordings and affords a repository for selected ECG sequences and the related metadata to accommodate stress tests, drug trials and protocol-based ECG recordings. The global and per-lead measurements sections have been extended and three new sections have been introduced for storing beat-by-beat and/or spike-by-spike measurements\r\nand annotations. The used terminology and the provided measurements and annotations have been harmonized with the ISO/IEEE 11073-10102 Annotated ECG standard. Emphasis has also been put on harmonizing the Universal Statement Codes with the CDISC and the categorized AHA statement codes and similarly the drug and implanted devices codes with the ATC and NASPE/BPEG codes. ","lang":"eng"}],"author":[{"full_name":"Rubel, Paul","last_name":"Rubel","first_name":"Paul"},{"last_name":"Pani","first_name":"Danilo","full_name":"Pani, Danilo"},{"first_name":"Alois","last_name":"Schlögl","orcid":"0000-0002-5621-8100","full_name":"Schlögl, Alois","id":"45BF87EE-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Fayn, Jocelyne","first_name":"Jocelyne","last_name":"Fayn"},{"full_name":"Badilini, Fabio","last_name":"Badilini","first_name":"Fabio"},{"full_name":"Macfarlane, Peter","last_name":"Macfarlane","first_name":"Peter"},{"full_name":"Varri, Alpo","first_name":"Alpo","last_name":"Varri"}],"quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.22489/cinc.2016.090-500"}],"citation":{"ieee":"P. Rubel <i>et al.</i>, “SCP-ECG V3.0: An enhanced standard communication protocol for computer-assisted electrocardiography,” in <i>2016 Computing in Cardiology Conference</i>, Vancouver, Canada, 2016, vol. 43, pp. 309–312.","ama":"Rubel P, Pani D, Schlögl A, et al. SCP-ECG V3.0: An enhanced standard communication protocol for computer-assisted electrocardiography. In: <i>2016 Computing in Cardiology Conference</i>. Vol 43. Computing in Cardiology; 2016:309-312. doi:<a href=\"https://doi.org/10.22489/cinc.2016.090-500\">10.22489/cinc.2016.090-500</a>","ista":"Rubel P, Pani D, Schlögl A, Fayn J, Badilini F, Macfarlane P, Varri A. 2016. SCP-ECG V3.0: An enhanced standard communication protocol for computer-assisted electrocardiography. 2016 Computing in Cardiology Conference. CinC: Computing in Cardiology vol. 43, 309–312.","short":"P. Rubel, D. Pani, A. Schlögl, J. Fayn, F. Badilini, P. Macfarlane, A. Varri, in:, 2016 Computing in Cardiology Conference, Computing in Cardiology, 2016, pp. 309–312.","chicago":"Rubel, Paul, Danilo Pani, Alois Schlögl, Jocelyne Fayn, Fabio Badilini, Peter Macfarlane, and Alpo Varri. “SCP-ECG V3.0: An Enhanced Standard Communication Protocol for Computer-Assisted Electrocardiography.” In <i>2016 Computing in Cardiology Conference</i>, 43:309–12. Computing in Cardiology, 2016. <a href=\"https://doi.org/10.22489/cinc.2016.090-500\">https://doi.org/10.22489/cinc.2016.090-500</a>.","apa":"Rubel, P., Pani, D., Schlögl, A., Fayn, J., Badilini, F., Macfarlane, P., &#38; Varri, A. (2016). SCP-ECG V3.0: An enhanced standard communication protocol for computer-assisted electrocardiography. In <i>2016 Computing in Cardiology Conference</i> (Vol. 43, pp. 309–312). Vancouver, Canada: Computing in Cardiology. <a href=\"https://doi.org/10.22489/cinc.2016.090-500\">https://doi.org/10.22489/cinc.2016.090-500</a>","mla":"Rubel, Paul, et al. “SCP-ECG V3.0: An Enhanced Standard Communication Protocol for Computer-Assisted Electrocardiography.” <i>2016 Computing in Cardiology Conference</i>, vol. 43, Computing in Cardiology, 2016, pp. 309–12, doi:<a href=\"https://doi.org/10.22489/cinc.2016.090-500\">10.22489/cinc.2016.090-500</a>."},"year":"2016"},{"publisher":"Springer Nature ","article_type":"letter_note","issue":"7626","volume":538,"date_created":"2021-06-04T11:34:55Z","month":"10","status":"public","intvolume":"       538","year":"2016","main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5684705/","open_access":"1"}],"citation":{"apa":"Huff, J. T., Zilberman, D., &#38; Roy, S. W. (2016). Mechanism for DNA transposons to generate introns on genomic scales. <i>Nature</i>. Springer Nature . <a href=\"https://doi.org/10.1038/nature20110\">https://doi.org/10.1038/nature20110</a>","mla":"Huff, Jason T., et al. “Mechanism for DNA Transposons to Generate Introns on Genomic Scales.” <i>Nature</i>, vol. 538, no. 7626, Springer Nature , 2016, pp. 533–36, doi:<a href=\"https://doi.org/10.1038/nature20110\">10.1038/nature20110</a>.","ista":"Huff JT, Zilberman D, Roy SW. 2016. Mechanism for DNA transposons to generate introns on genomic scales. Nature. 538(7626), 533–536.","chicago":"Huff, Jason T., Daniel Zilberman, and Scott W. Roy. “Mechanism for DNA Transposons to Generate Introns on Genomic Scales.” <i>Nature</i>. Springer Nature , 2016. <a href=\"https://doi.org/10.1038/nature20110\">https://doi.org/10.1038/nature20110</a>.","short":"J.T. Huff, D. Zilberman, S.W. Roy, Nature 538 (2016) 533–536.","ieee":"J. T. Huff, D. Zilberman, and S. W. Roy, “Mechanism for DNA transposons to generate introns on genomic scales,” <i>Nature</i>, vol. 538, no. 7626. Springer Nature , pp. 533–536, 2016.","ama":"Huff JT, Zilberman D, Roy SW. Mechanism for DNA transposons to generate introns on genomic scales. <i>Nature</i>. 2016;538(7626):533-536. doi:<a href=\"https://doi.org/10.1038/nature20110\">10.1038/nature20110</a>"},"author":[{"full_name":"Huff, Jason T.","last_name":"Huff","first_name":"Jason T."},{"last_name":"Zilberman","first_name":"Daniel","id":"6973db13-dd5f-11ea-814e-b3e5455e9ed1","orcid":"0000-0002-0123-8649","full_name":"Zilberman, Daniel"},{"full_name":"Roy, Scott W.","first_name":"Scott W.","last_name":"Roy"}],"quality_controlled":"1","extern":"1","publication_status":"published","abstract":[{"lang":"eng","text":"The discovery of introns four decades ago was one of the most unexpected findings in molecular biology. Introns are sequences interrupting genes that must be removed as part of messenger RNA production. Genome sequencing projects have shown that most eukaryotic genes contain at least one intron, and frequently many. Comparison of these genomes reveals a history of long evolutionary periods during which few introns were gained, punctuated by episodes of rapid, extensive gain. However, although several detailed mechanisms for such episodic intron generation have been proposed, none has been empirically supported on a genomic scale. Here we show how short, non-autonomous DNA transposons independently generated hundreds to thousands of introns in the prasinophyte Micromonas pusilla and the pelagophyte Aureococcus anophagefferens. Each transposon carries one splice site. The other splice site is co-opted from the gene sequence that is duplicated upon transposon insertion, allowing perfect splicing out of the RNA. The distributions of sequences that can be co-opted are biased with respect to codons, and phasing of transposon-generated introns is similarly biased. These transposons insert between pre-existing nucleosomes, so that multiple nearby insertions generate nucleosome-sized intervening segments. Thus, transposon insertion and sequence co-option may explain the intron phase biases and prevalence of nucleosome-sized exons observed in eukaryotes. Overall, the two independent examples of proliferating elements illustrate a general DNA transposon mechanism that can plausibly account for episodes of rapid, extensive intron gain during eukaryotic evolution."}],"title":"Mechanism for DNA transposons to generate introns on genomic scales","publication":"Nature","pmid":1,"oa":1,"_id":"9456","date_published":"2016-10-27T00:00:00Z","external_id":{"pmid":["27760113"]},"page":"533-536","publication_identifier":{"eissn":["1476-4687"],"issn":["0028-0836"]},"scopus_import":"1","type":"journal_article","date_updated":"2021-12-14T07:55:30Z","oa_version":"Submitted Version","day":"27","article_processing_charge":"No","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","doi":"10.1038/nature20110","language":[{"iso":"eng"}],"department":[{"_id":"DaZi"}]},{"intvolume":"       113","month":"12","date_created":"2021-06-07T06:21:39Z","status":"public","issue":"52","volume":113,"publisher":"National Academy of Sciences","article_type":"original","pmid":1,"title":"Arabidopsis male sexual lineage exhibits more robust maintenance of CG methylation than somatic tissues","publication":"Proceedings of the National Academy of Sciences","_id":"9473","oa":1,"abstract":[{"text":"Cytosine DNA methylation regulates the expression of eukaryotic genes and transposons. Methylation is copied by methyltransferases after DNA replication, which results in faithful transmission of methylation patterns during cell division and, at least in flowering plants, across generations. Transgenerational inheritance is mediated by a small group of cells that includes gametes and their progenitors. However, methylation is usually analyzed in somatic tissues that do not contribute to the next generation, and the mechanisms of transgenerational inheritance are inferred from such studies. To gain a better understanding of how DNA methylation is inherited, we analyzed purified Arabidopsis thaliana sperm and vegetative cells-the cell types that comprise pollen-with mutations in the DRM, CMT2, and CMT3 methyltransferases. We find that DNA methylation dependency on these enzymes is similar in sperm, vegetative cells, and somatic tissues, although DRM activity extends into heterochromatin in vegetative cells, likely reflecting transcription of heterochromatic transposons in this cell type. We also show that lack of histone H1, which elevates heterochromatic DNA methylation in somatic tissues, does not have this effect in pollen. Instead, levels of CG methylation in wild-type sperm and vegetative cells, as well as in wild-type microspores from which both pollen cell types originate, are substantially higher than in wild-type somatic tissues and similar to those of H1-depleted roots. Our results demonstrate that the mechanisms of methylation maintenance are similar between pollen and somatic cells, but the efficiency of CG methylation is higher in pollen, allowing methylation patterns to be accurately inherited across generations.","lang":"eng"}],"publication_status":"published","citation":{"apa":"Hsieh, P.-H., He, S., Buttress, T., Gao, H., Couchman, M., Fischer, R. L., … Feng, X. (2016). Arabidopsis male sexual lineage exhibits more robust maintenance of CG methylation than somatic tissues. <i>Proceedings of the National Academy of Sciences</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.1619074114\">https://doi.org/10.1073/pnas.1619074114</a>","mla":"Hsieh, Ping-Hung, et al. “Arabidopsis Male Sexual Lineage Exhibits More Robust Maintenance of CG Methylation than Somatic Tissues.” <i>Proceedings of the National Academy of Sciences</i>, vol. 113, no. 52, National Academy of Sciences, 2016, pp. 15132–37, doi:<a href=\"https://doi.org/10.1073/pnas.1619074114\">10.1073/pnas.1619074114</a>.","ama":"Hsieh P-H, He S, Buttress T, et al. Arabidopsis male sexual lineage exhibits more robust maintenance of CG methylation than somatic tissues. <i>Proceedings of the National Academy of Sciences</i>. 2016;113(52):15132-15137. doi:<a href=\"https://doi.org/10.1073/pnas.1619074114\">10.1073/pnas.1619074114</a>","ieee":"P.-H. Hsieh <i>et al.</i>, “Arabidopsis male sexual lineage exhibits more robust maintenance of CG methylation than somatic tissues,” <i>Proceedings of the National Academy of Sciences</i>, vol. 113, no. 52. National Academy of Sciences, pp. 15132–15137, 2016.","ista":"Hsieh P-H, He S, Buttress T, Gao H, Couchman M, Fischer RL, Zilberman D, Feng X. 2016. Arabidopsis male sexual lineage exhibits more robust maintenance of CG methylation than somatic tissues. Proceedings of the National Academy of Sciences. 113(52), 15132–15137.","chicago":"Hsieh, Ping-Hung, Shengbo He, Toby Buttress, Hongbo Gao, Matthew Couchman, Robert L. Fischer, Daniel Zilberman, and Xiaoqi Feng. “Arabidopsis Male Sexual Lineage Exhibits More Robust Maintenance of CG Methylation than Somatic Tissues.” <i>Proceedings of the National Academy of Sciences</i>. National Academy of Sciences, 2016. <a href=\"https://doi.org/10.1073/pnas.1619074114\">https://doi.org/10.1073/pnas.1619074114</a>.","short":"P.-H. Hsieh, S. He, T. Buttress, H. Gao, M. Couchman, R.L. Fischer, D. Zilberman, X. Feng, Proceedings of the National Academy of Sciences 113 (2016) 15132–15137."},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1073/pnas.1619074114"}],"quality_controlled":"1","author":[{"last_name":"Hsieh","first_name":"Ping-Hung","full_name":"Hsieh, Ping-Hung"},{"full_name":"He, Shengbo","last_name":"He","first_name":"Shengbo"},{"full_name":"Buttress, Toby","last_name":"Buttress","first_name":"Toby"},{"first_name":"Hongbo","last_name":"Gao","full_name":"Gao, Hongbo"},{"full_name":"Couchman, Matthew","first_name":"Matthew","last_name":"Couchman"},{"full_name":"Fischer, Robert L.","last_name":"Fischer","first_name":"Robert L."},{"last_name":"Zilberman","first_name":"Daniel","orcid":"0000-0002-0123-8649","full_name":"Zilberman, Daniel","id":"6973db13-dd5f-11ea-814e-b3e5455e9ed1"},{"last_name":"Feng","first_name":"Xiaoqi","id":"e0164712-22ee-11ed-b12a-d80fcdf35958","orcid":"0000-0002-4008-1234","full_name":"Feng, Xiaoqi"}],"extern":"1","year":"2016","scopus_import":"1","publication_identifier":{"issn":["0027-8424"],"eissn":["1091-6490"]},"external_id":{"pmid":["27956643"]},"date_published":"2016-12-27T00:00:00Z","page":"15132-15137","department":[{"_id":"DaZi"},{"_id":"XiFe"}],"language":[{"iso":"eng"}],"doi":"10.1073/pnas.1619074114","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","oa_version":"Published Version","date_updated":"2023-05-08T11:00:40Z","type":"journal_article","day":"27"}]