[{"citation":{"short":"K. Lohse, N.H. Barton, G. Stone, G. Melika, (2012).","chicago":"Lohse, Konrad, Nicholas H Barton, Graham Stone, and George Melika. “Data from: A Likelihood-Based Comparison of Population Histories in a Parasitoid Guild.” Dryad, 2012. <a href=\"https://doi.org/10.5061/DRYAD.0G0FS\">https://doi.org/10.5061/DRYAD.0G0FS</a>.","ama":"Lohse K, Barton NH, Stone G, Melika G. Data from: A likelihood-based comparison of population histories in a parasitoid guild. 2012. doi:<a href=\"https://doi.org/10.5061/DRYAD.0G0FS\">10.5061/DRYAD.0G0FS</a>","ieee":"K. Lohse, N. H. Barton, G. Stone, and G. Melika, “Data from: A likelihood-based comparison of population histories in a parasitoid guild.” Dryad, 2012.","ista":"Lohse K, Barton NH, Stone G, Melika G. 2012. Data from: A likelihood-based comparison of population histories in a parasitoid guild, Dryad, <a href=\"https://doi.org/10.5061/DRYAD.0G0FS\">10.5061/DRYAD.0G0FS</a>.","mla":"Lohse, Konrad, et al. <i>Data from: A Likelihood-Based Comparison of Population Histories in a Parasitoid Guild</i>. Dryad, 2012, doi:<a href=\"https://doi.org/10.5061/DRYAD.0G0FS\">10.5061/DRYAD.0G0FS</a>.","apa":"Lohse, K., Barton, N. H., Stone, G., &#38; Melika, G. (2012). Data from: A likelihood-based comparison of population histories in a parasitoid guild. Dryad. <a href=\"https://doi.org/10.5061/DRYAD.0G0FS\">https://doi.org/10.5061/DRYAD.0G0FS</a>"},"doi":"10.5061/DRYAD.0G0FS","abstract":[{"text":"Little is known about the stability of trophic relationships in complex natural communities over evolutionary timescales. Here, we use sequence data from 18 nuclear loci to reconstruct and compare the intraspecific histories of major Pleistocene refugial populations in the Middle East, the Balkans and Iberia in a guild of four Chalcid parasitoids (Cecidostiba fungosa, C. semifascia, Hobbya stenonota and Mesopolobus amaenus) all attacking Cynipid oak galls. We develop a likelihood method to numerically estimate models of divergence between three populations from multilocus data. We investigate the power of this framework on simulated data, and - using triplet alignments of intronic loci - quantify the support for all possible divergence relationships between refugial populations in the four parasitoids. Although an East to West order of population divergence has highest support in all but one species, we cannot rule out alternative population tree topologies. Comparing the estimated times of population splits between species, we find that one species, M. amaenus, has a significantly older history than the rest of the guild and must have arrived in central Europe at least one glacial cycle prior to other guild members. This suggests that although all four species may share a common origin in the East, they expanded westwards into Europe at different times.","lang":"eng"}],"tmp":{"name":"Creative Commons Public Domain Dedication (CC0 1.0)","legal_code_url":"https://creativecommons.org/publicdomain/zero/1.0/legalcode","image":"/images/cc_0.png","short":"CC0 (1.0)"},"fulldoi":"https://doi.org/10.5061/DRYAD.0G0FS","article_processing_charge":"No","department":[{"_id":"NiBa"}],"type":"research_data_reference","_id":"13075","related_material":{"record":[{"relation":"used_in_publication","status":"public","id":"2968"}]},"publisher":"Dryad","year":"2012","ddc":["570"],"status":"public","date_updated":"2025-09-30T08:04:02Z","oa":1,"title":"Data from: A likelihood-based comparison of population histories in a parasitoid guild","date_published":"2012-06-08T00:00:00Z","date_created":"2023-05-23T17:01:02Z","license":"https://creativecommons.org/publicdomain/zero/1.0/","oa_version":"Published Version","main_file_link":[{"open_access":"1","url":"https://doi.org/10.5061/dryad.0g0fs"}],"day":"08","author":[{"full_name":"Lohse, Konrad","first_name":"Konrad","last_name":"Lohse"},{"last_name":"Barton","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8548-5240","full_name":"Barton, Nicholas H","first_name":"Nicholas H"},{"last_name":"Stone","full_name":"Stone, Graham","first_name":"Graham"},{"last_name":"Melika","full_name":"Melika, George","first_name":"George"}],"month":"06","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"quality_controlled":"1","author":[{"full_name":"Beyer, Dirk","first_name":"Dirk","last_name":"Beyer"},{"last_name":"Henzinger","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","first_name":"Thomas A"},{"last_name":"Keremoglu","full_name":"Keremoglu, Mehmet","first_name":"Mehmet"},{"last_name":"Wendler","first_name":"Philipp","full_name":"Wendler, Philipp"}],"day":"01","ec_funded":1,"date_created":"2018-12-11T11:51:42Z","date_published":"2012-11-01T00:00:00Z","oa":1,"year":"2012","status":"public","type":"conference","publist_id":"5826","conference":{"name":"FSE: Foundations of Software Engineering","end_date":"2012-11-16","start_date":"2012-11-11","location":"Cary, NC, USA"},"fulldoi":"https://doi.org/10.1145/2393596.2393664","publication_status":"published","arxiv":1,"publication":"Proceedings of the ACM SIGSOFT 20th International Symposium on the Foundations of Software Engineering","article_number":"57","project":[{"call_identifier":"FP7","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF","grant_number":"S 11407_N23"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"11","language":[{"iso":"eng"}],"scopus_import":"1","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1109.6926"}],"oa_version":"Preprint","title":"Conditional model checking: A technique to pass information between verifiers","date_updated":"2025-06-11T08:07:37Z","publisher":"ACM","_id":"1384","external_id":{"arxiv":["1109.6926"]},"acknowledgement":"This  research  was  supported  by  the  Canadian  NSERC grant   RGPIN   341819-07,    the   ERC   Advanced   Grant QUAREM, and the Austrian Science Fund NFN RiSE.","department":[{"_id":"ToHe"}],"article_processing_charge":"No","abstract":[{"text":"Software model checking, as an undecidable problem, has three possible outcomes: (1) the program satisfies the specification, (2) the program does not satisfy the specification, and (3) the model checker fails. The third outcome usually manifests itself in a space-out, time-out, or one component of the verification tool giving up; in all of these failing cases, significant computation is performed by the verification tool before the failure, but no result is reported. We propose to reformulate the model-checking problem as follows, in order to have the verification tool report a summary of the performed work even in case of failure: given a program and a specification, the model checker returns a condition Ψ - usually a state predicate - such that the program satisfies the specification under the condition Ψ - that is, as long as the program does not leave the states in which Ψ is satisfied. In our experiments, we investigated as one major application of conditional model checking the sequential combination of model checkers with information passing. We give the condition that one model checker produces, as input to a second conditional model checker, such that the verification problem for the second is restricted to the part of the state space that is not covered by the condition, i.e., the second model checker works on the problems that the first model checker could not solve. Our experiments demonstrate that repeated application of conditional model checkers, passing information from one model checker to the next, can significantly improve the verification results and performance, i.e., we can now verify programs that we could not verify before.","lang":"eng"}],"citation":{"apa":"Beyer, D., Henzinger, T. A., Keremoglu, M., &#38; Wendler, P. (2012). Conditional model checking: A technique to pass information between verifiers. In <i>Proceedings of the ACM SIGSOFT 20th International Symposium on the Foundations of Software Engineering</i>. Cary, NC, USA: ACM. <a href=\"https://doi.org/10.1145/2393596.2393664\">https://doi.org/10.1145/2393596.2393664</a>","mla":"Beyer, Dirk, et al. “Conditional Model Checking: A Technique to Pass Information between Verifiers.” <i>Proceedings of the ACM SIGSOFT 20th International Symposium on the Foundations of Software Engineering</i>, 57, ACM, 2012, doi:<a href=\"https://doi.org/10.1145/2393596.2393664\">10.1145/2393596.2393664</a>.","ama":"Beyer D, Henzinger TA, Keremoglu M, Wendler P. Conditional model checking: A technique to pass information between verifiers. In: <i>Proceedings of the ACM SIGSOFT 20th International Symposium on the Foundations of Software Engineering</i>. ACM; 2012. doi:<a href=\"https://doi.org/10.1145/2393596.2393664\">10.1145/2393596.2393664</a>","chicago":"Beyer, Dirk, Thomas A Henzinger, Mehmet Keremoglu, and Philipp Wendler. “Conditional Model Checking: A Technique to Pass Information between Verifiers.” In <i>Proceedings of the ACM SIGSOFT 20th International Symposium on the Foundations of Software Engineering</i>. ACM, 2012. <a href=\"https://doi.org/10.1145/2393596.2393664\">https://doi.org/10.1145/2393596.2393664</a>.","short":"D. Beyer, T.A. Henzinger, M. Keremoglu, P. Wendler, in:, Proceedings of the ACM SIGSOFT 20th International Symposium on the Foundations of Software Engineering, ACM, 2012.","ista":"Beyer D, Henzinger TA, Keremoglu M, Wendler P. 2012. Conditional model checking: A technique to pass information between verifiers. Proceedings of the ACM SIGSOFT 20th International Symposium on the Foundations of Software Engineering. FSE: Foundations of Software Engineering, 57.","ieee":"D. Beyer, T. A. Henzinger, M. Keremoglu, and P. Wendler, “Conditional model checking: A technique to pass information between verifiers,” in <i>Proceedings of the ACM SIGSOFT 20th International Symposium on the Foundations of Software Engineering</i>, Cary, NC, USA, 2012."},"doi":"10.1145/2393596.2393664"},{"article_processing_charge":"No","abstract":[{"text":"The BCI competition IV stands in the tradition of prior BCI competitions that aim to provide high quality neuroscientific data for open access to the scientific community. As experienced already in prior competitions not only scientists from the narrow field of BCI compete, but scholars with a broad variety of backgrounds and nationalities. They include high specialists as well as students.The goals of all BCI competitions have always been to challenge with respect to novel paradigms and complex data. We report on the following challenges: (1) asynchronous data, (2) synthetic, (3) multi-class continuous data, (4) sessionto-session transfer, (5) directionally modulated MEG, (6) finger movements recorded by ECoG. As after past competitions, our hope is that winning entries may enhance the analysis methods of future BCIs.","lang":"eng"}],"citation":{"short":"M. Tangermann, K. Müller, A. Aertsen, N. Birbaumer, C. Braun, C. Brunner, R. Leeb, C. Mehring, K. Miller, G. Müller Putz, G. Nolte, G. Pfurtscheller, H. Preissl, G. Schalk, A. Schlögl, C. Vidaurre, S. Waldert, B. Blankertz, Frontiers in Neuroscience 6 (2012).","chicago":"Tangermann, Michael, Klaus Müller, Ad Aertsen, Niels Birbaumer, Christoph Braun, Clemens Brunner, Robert Leeb, et al. “Review of the BCI Competition IV.” <i>Frontiers in Neuroscience</i>. Frontiers Research Foundation, 2012. <a href=\"https://doi.org/10.3389/fnins.2012.00055\">https://doi.org/10.3389/fnins.2012.00055</a>.","ama":"Tangermann M, Müller K, Aertsen A, et al. Review of the BCI competition IV. <i>Frontiers in Neuroscience</i>. 2012;6. doi:<a href=\"https://doi.org/10.3389/fnins.2012.00055\">10.3389/fnins.2012.00055</a>","ieee":"M. Tangermann <i>et al.</i>, “Review of the BCI competition IV,” <i>Frontiers in Neuroscience</i>, vol. 6. Frontiers Research Foundation, 2012.","ista":"Tangermann M, Müller K, Aertsen A, Birbaumer N, Braun C, Brunner C, Leeb R, Mehring C, Miller K, Müller Putz G, Nolte G, Pfurtscheller G, Preissl H, Schalk G, Schlögl A, Vidaurre C, Waldert S, Blankertz B. 2012. Review of the BCI competition IV. Frontiers in Neuroscience. 6, 55.","mla":"Tangermann, Michael, et al. “Review of the BCI Competition IV.” <i>Frontiers in Neuroscience</i>, vol. 6, 55, Frontiers Research Foundation, 2012, doi:<a href=\"https://doi.org/10.3389/fnins.2012.00055\">10.3389/fnins.2012.00055</a>.","apa":"Tangermann, M., Müller, K., Aertsen, A., Birbaumer, N., Braun, C., Brunner, C., … Blankertz, B. (2012). Review of the BCI competition IV. <i>Frontiers in Neuroscience</i>. Frontiers Research Foundation. <a href=\"https://doi.org/10.3389/fnins.2012.00055\">https://doi.org/10.3389/fnins.2012.00055</a>"},"file_date_updated":"2020-07-14T12:46:35Z","doi":"10.3389/fnins.2012.00055","department":[{"_id":"ScienComp"},{"_id":"PeJo"}],"has_accepted_license":"1","date_updated":"2025-09-30T08:35:59Z","ddc":["004"],"_id":"493","publisher":"Frontiers Research Foundation","external_id":{"isi":["000209165300066"]},"acknowledgement":"The studies were in part or completely supported by the Bundesministerium für Bildung und Forschung (BMBF), Fkz 01IB001A, 01GQ0850, by the German Science Foundation (DFG, contract MU 987/3-2), by the European ICT Programme Projects FP7-224631 and 216886, the World Class University Program through the National Research Foundation of Korea funded by the Ministry of Education, Science, and Technology (Grant R31-10008), the US Army Research Office [W911NF-08-1-0216 (Gerwin Schalk) and W911NF-07-1-0415 (Gerwin Schalk)] and the NIH [EB006356 (Gerwin Schalk) and EB000856 (Gerwin Schalk), the WIN-Kolleg of the Heidelberg Academy of Sciences and Humanities, German Federal Ministry of Education and Research grants 01GQ0420, 01GQ0761, 01GQ0762, and 01GQ0830, German Research Foundation grants 550/B5 and C6, and by a scholarship from the German National Academic Foundation. This paper only reflects the authors’ views and funding agencies are not liable for any use that may be made of the information contained herein.\r\n","title":"Review of the BCI competition IV","oa_version":"Published Version","month":"07","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","language":[{"iso":"eng"}],"scopus_import":"1","article_number":"55","fulldoi":"https://doi.org/10.3389/fnins.2012.00055","publication_status":"published","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"publication":"Frontiers in Neuroscience","publist_id":"7327","status":"public","year":"2012","intvolume":"         6","type":"journal_article","date_created":"2018-12-11T11:46:46Z","date_published":"2012-07-13T00:00:00Z","oa":1,"license":"https://creativecommons.org/licenses/by/4.0/","isi":1,"author":[{"last_name":"Tangermann","full_name":"Tangermann, Michael","first_name":"Michael"},{"last_name":"Müller","full_name":"Müller, Klaus","first_name":"Klaus"},{"last_name":"Aertsen","first_name":"Ad","full_name":"Aertsen, Ad"},{"last_name":"Birbaumer","full_name":"Birbaumer, Niels","first_name":"Niels"},{"last_name":"Braun","first_name":"Christoph","full_name":"Braun, Christoph"},{"last_name":"Brunner","first_name":"Clemens","full_name":"Brunner, Clemens"},{"first_name":"Robert","full_name":"Leeb, Robert","last_name":"Leeb"},{"first_name":"Carsten","full_name":"Mehring, Carsten","last_name":"Mehring"},{"last_name":"Miller","full_name":"Miller, Kai","first_name":"Kai"},{"last_name":"Müller Putz","full_name":"Müller Putz, Gernot","first_name":"Gernot"},{"full_name":"Nolte, Guido","first_name":"Guido","last_name":"Nolte"},{"last_name":"Pfurtscheller","full_name":"Pfurtscheller, Gert","first_name":"Gert"},{"full_name":"Preissl, Hubert","first_name":"Hubert","last_name":"Preissl"},{"first_name":"Gerwin","full_name":"Schalk, Gerwin","last_name":"Schalk"},{"id":"45BF87EE-F248-11E8-B48F-1D18A9856A87","last_name":"Schlögl","orcid":"0000-0002-5621-8100","first_name":"Alois","full_name":"Schlögl, Alois"},{"last_name":"Vidaurre","full_name":"Vidaurre, Carmen","first_name":"Carmen"},{"last_name":"Waldert","full_name":"Waldert, Stephan","first_name":"Stephan"},{"first_name":"Benjamin","full_name":"Blankertz, Benjamin","last_name":"Blankertz"}],"day":"13","pubrep_id":"945","file":[{"access_level":"open_access","date_created":"2018-12-12T10:18:34Z","file_name":"IST-2018-945-v1+1_2012_Schloegl_Review_of.pdf","checksum":"195238221c4b0b0f4035f6f6c16ea17c","date_updated":"2020-07-14T12:46:35Z","relation":"main_file","file_id":"5356","content_type":"application/pdf","file_size":2693701,"creator":"system"}],"quality_controlled":"1","volume":6},{"publication_status":"published","fulldoi":"https://doi.org/10.4204/EPTCS.96.18","publication":"Proceedings GandALF 2012","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"conference":{"location":"Napoli, Italy","name":"GandALF: Games, Automata, Logics and Formal Verification","end_date":"2012-09-08","start_date":"2012-09-06"},"publist_id":"7325","intvolume":"        96","status":"public","year":"2012","type":"conference","date_created":"2018-12-11T11:46:47Z","oa":1,"date_published":"2012-10-07T00:00:00Z","ec_funded":1,"page":"238 - 246","author":[{"first_name":"Alex","full_name":"Kruckman, Alex","last_name":"Kruckman"},{"full_name":"Rubin, Sasha","first_name":"Sasha","last_name":"Rubin","id":"2EC51194-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Sheridan, John","first_name":"John","last_name":"Sheridan"},{"full_name":"Zax, Ben","first_name":"Ben","last_name":"Zax"}],"pubrep_id":"944","day":"07","quality_controlled":"1","file":[{"file_name":"IST-2018-944-v1+1_2012_Rubin_A_Myhill.pdf","access_level":"open_access","date_created":"2018-12-12T10:15:31Z","checksum":"56277f95edc9d531fa3bdc5f9579fda8","relation":"main_file","date_updated":"2020-07-14T12:46:35Z","content_type":"application/pdf","file_id":"5152","creator":"system","file_size":97736}],"volume":96,"citation":{"ama":"Kruckman A, Rubin S, Sheridan J, Zax B. A Myhill Nerode theorem for automata with advice. In: <i>Proceedings GandALF 2012</i>. Vol 96. Open Publishing Association; 2012:238-246. doi:<a href=\"https://doi.org/10.4204/EPTCS.96.18\">10.4204/EPTCS.96.18</a>","short":"A. Kruckman, S. Rubin, J. Sheridan, B. Zax, in:, Proceedings GandALF 2012, Open Publishing Association, 2012, pp. 238–246.","chicago":"Kruckman, Alex, Sasha Rubin, John Sheridan, and Ben Zax. “A Myhill Nerode Theorem for Automata with Advice.” In <i>Proceedings GandALF 2012</i>, 96:238–46. Open Publishing Association, 2012. <a href=\"https://doi.org/10.4204/EPTCS.96.18\">https://doi.org/10.4204/EPTCS.96.18</a>.","ista":"Kruckman A, Rubin S, Sheridan J, Zax B. 2012. A Myhill Nerode theorem for automata with advice. Proceedings GandALF 2012. GandALF: Games, Automata, Logics and Formal Verification, EPTCS, vol. 96, 238–246.","ieee":"A. Kruckman, S. Rubin, J. Sheridan, and B. Zax, “A Myhill Nerode theorem for automata with advice,” in <i>Proceedings GandALF 2012</i>, Napoli, Italy, 2012, vol. 96, pp. 238–246.","apa":"Kruckman, A., Rubin, S., Sheridan, J., &#38; Zax, B. (2012). A Myhill Nerode theorem for automata with advice. In <i>Proceedings GandALF 2012</i> (Vol. 96, pp. 238–246). Napoli, Italy: Open Publishing Association. <a href=\"https://doi.org/10.4204/EPTCS.96.18\">https://doi.org/10.4204/EPTCS.96.18</a>","mla":"Kruckman, Alex, et al. “A Myhill Nerode Theorem for Automata with Advice.” <i>Proceedings GandALF 2012</i>, vol. 96, Open Publishing Association, 2012, pp. 238–46, doi:<a href=\"https://doi.org/10.4204/EPTCS.96.18\">10.4204/EPTCS.96.18</a>."},"file_date_updated":"2020-07-14T12:46:35Z","doi":"10.4204/EPTCS.96.18","abstract":[{"text":"An automaton with advice is a finite state automaton which has access to an additional fixed infinite string called an advice tape. We refine the Myhill-Nerode theorem to characterize the languages of finite strings that are accepted by automata with advice. We do the same for tree automata with advice.","lang":"eng"}],"corr_author":"1","alternative_title":["EPTCS"],"has_accepted_license":"1","department":[{"_id":"KrCh"}],"_id":"495","publisher":"Open Publishing Association","date_updated":"2024-10-09T20:55:00Z","ddc":["004"],"title":"A Myhill Nerode theorem for automata with advice","oa_version":"Published Version","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","month":"10","language":[{"iso":"eng"}],"scopus_import":1,"project":[{"name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"S 11407_N23"},{"call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"}]},{"quality_controlled":"1","day":"01","author":[{"last_name":"Rabinovich","first_name":"Alexander","full_name":"Rabinovich, Alexander"},{"full_name":"Rubin, Sasha","first_name":"Sasha","last_name":"Rubin","id":"2EC51194-F248-11E8-B48F-1D18A9856A87"}],"isi":1,"ec_funded":1,"oa":1,"date_published":"2012-01-01T00:00:00Z","date_created":"2018-12-11T11:46:47Z","type":"conference","year":"2012","status":"public","publist_id":"7324","conference":{"end_date":"2012-06-28","name":"LICS: Logic in Computer Science","start_date":"2012-06-25","location":"Dubrovnik, Croatia"},"publication_status":"published","fulldoi":"https://doi.org/10.1109/LICS.2012.65","article_number":"6280474","project":[{"grant_number":"279307","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"grant_number":"S 11407_N23","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering"}],"scopus_import":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","language":[{"iso":"eng"}],"month":"01","oa_version":"Preprint","main_file_link":[{"open_access":"1","url":"https://arise.or.at/pubpdf/Interpretations_in_Trees_with_Countably_Many_Branches.pdf"}],"title":"Interpretations in trees with countably many branches","external_id":{"isi":["000309059900061"]},"_id":"496","publisher":"IEEE","date_updated":"2025-09-30T08:34:47Z","department":[{"_id":"KrCh"}],"alternative_title":["LICS"],"citation":{"mla":"Rabinovich, Alexander, and Sasha Rubin. <i>Interpretations in Trees with Countably Many Branches</i>. 6280474, IEEE, 2012, doi:<a href=\"https://doi.org/10.1109/LICS.2012.65\">10.1109/LICS.2012.65</a>.","apa":"Rabinovich, A., &#38; Rubin, S. (2012). Interpretations in trees with countably many branches. Presented at the LICS: Logic in Computer Science, Dubrovnik, Croatia: IEEE. <a href=\"https://doi.org/10.1109/LICS.2012.65\">https://doi.org/10.1109/LICS.2012.65</a>","chicago":"Rabinovich, Alexander, and Sasha Rubin. “Interpretations in Trees with Countably Many Branches.” IEEE, 2012. <a href=\"https://doi.org/10.1109/LICS.2012.65\">https://doi.org/10.1109/LICS.2012.65</a>.","short":"A. Rabinovich, S. Rubin, in:, IEEE, 2012.","ama":"Rabinovich A, Rubin S. Interpretations in trees with countably many branches. In: IEEE; 2012. doi:<a href=\"https://doi.org/10.1109/LICS.2012.65\">10.1109/LICS.2012.65</a>","ieee":"A. Rabinovich and S. Rubin, “Interpretations in trees with countably many branches,” presented at the LICS: Logic in Computer Science, Dubrovnik, Croatia, 2012.","ista":"Rabinovich A, Rubin S. 2012. Interpretations in trees with countably many branches. LICS: Logic in Computer Science, LICS, , 6280474."},"doi":"10.1109/LICS.2012.65","abstract":[{"lang":"eng","text":"We study the expressive power of logical interpretations on the class of scattered trees, namely those with countably many infinite branches. Scattered trees can be thought of as the tree analogue of scattered linear orders. Every scattered tree has an ordinal rank that reflects the structure of its infinite branches. We prove, roughly, that trees and orders of large rank cannot be interpreted in scattered trees of small rank. We consider a quite general notion of interpretation: each element of the interpreted structure is represented by a set of tuples of subsets of the interpreting tree. Our trees are countable, not necessarily finitely branching, and may have finitely many unary predicates as labellings. We also show how to replace injective set-interpretations in (not necessarily scattered) trees by 'finitary' set-interpretations."}],"article_processing_charge":"No"},{"_id":"497","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","ddc":["004"],"date_updated":"2025-01-14T12:24:50Z","title":"Faster algorithms for alternating refinement relations","doi":"10.4230/LIPIcs.CSL.2012.167","citation":{"short":"K. Chatterjee, S. Chaubal, P. Kamath, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012, pp. 167–182.","chicago":"Chatterjee, Krishnendu, Siddhesh Chaubal, and Pritish Kamath. “Faster Algorithms for Alternating Refinement Relations,” 16:167–82. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012. <a href=\"https://doi.org/10.4230/LIPIcs.CSL.2012.167\">https://doi.org/10.4230/LIPIcs.CSL.2012.167</a>.","ama":"Chatterjee K, Chaubal S, Kamath P. Faster algorithms for alternating refinement relations. In: Vol 16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2012:167-182. doi:<a href=\"https://doi.org/10.4230/LIPIcs.CSL.2012.167\">10.4230/LIPIcs.CSL.2012.167</a>","ieee":"K. Chatterjee, S. Chaubal, and P. Kamath, “Faster algorithms for alternating refinement relations,” presented at the EACSL: European Association for Computer Science Logic, Fontainebleau, France, 2012, vol. 16, pp. 167–182.","ista":"Chatterjee K, Chaubal S, Kamath P. 2012. Faster algorithms for alternating refinement relations. EACSL: European Association for Computer Science Logic, LIPIcs, vol. 16, 167–182.","mla":"Chatterjee, Krishnendu, et al. <i>Faster Algorithms for Alternating Refinement Relations</i>. Vol. 16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012, pp. 167–82, doi:<a href=\"https://doi.org/10.4230/LIPIcs.CSL.2012.167\">10.4230/LIPIcs.CSL.2012.167</a>.","apa":"Chatterjee, K., Chaubal, S., &#38; Kamath, P. (2012). Faster algorithms for alternating refinement relations (Vol. 16, pp. 167–182). Presented at the EACSL: European Association for Computer Science Logic, Fontainebleau, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.CSL.2012.167\">https://doi.org/10.4230/LIPIcs.CSL.2012.167</a>"},"file_date_updated":"2020-07-14T12:46:35Z","abstract":[{"lang":"eng","text":"One central issue in the formal design and analysis of reactive systems is the notion of refinement that asks whether all behaviors of the implementation is allowed by the specification. The local interpretation of behavior leads to the notion of simulation. Alternating transition systems (ATSs) provide a general model for composite reactive systems, and the simulation relation for ATSs is known as alternating simulation. The simulation relation for fair transition systems is called fair simulation. In this work our main contributions are as follows: (1) We present an improved algorithm for fair simulation with Büchi fairness constraints; our algorithm requires O(n 3·m) time as compared to the previous known O(n 6)-time algorithm, where n is the number of states and m is the number of transitions. (2) We present a game based algorithm for alternating simulation that requires O(m2)-time as compared to the previous known O((n·m)2)-time algorithm, where n is the number of states and m is the size of transition relation. (3) We present an iterative algorithm for alternating simulation that matches the time complexity of the game based algorithm, but is more space efficient than the game based algorithm. © Krishnendu Chatterjee, Siddhesh Chaubal, and Pritish Kamath."}],"has_accepted_license":"1","department":[{"_id":"KrCh"}],"alternative_title":["LIPIcs"],"project":[{"grant_number":"P 23499-N23","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"grant_number":"279307","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"oa_version":"Published Version","scopus_import":1,"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","month":"09","language":[{"iso":"eng"}],"type":"conference","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"5378"}]},"intvolume":"        16","year":"2012","status":"public","oa":1,"date_published":"2012-09-01T00:00:00Z","date_created":"2018-12-11T11:46:48Z","tmp":{"image":"/images/cc_by_nc_nd.png","short":"CC BY-NC-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)"},"publication_status":"published","fulldoi":"https://doi.org/10.4230/LIPIcs.CSL.2012.167","publist_id":"7323","conference":{"location":"Fontainebleau, France","name":"EACSL: European Association for Computer Science Logic","end_date":"2012-09-06","start_date":"2012-09-03"},"quality_controlled":"1","file":[{"file_size":471236,"creator":"system","file_id":"4712","content_type":"application/pdf","relation":"main_file","date_updated":"2020-07-14T12:46:35Z","checksum":"f1b0dd99240800db2d7dbf9b5131fe5e","date_created":"2018-12-12T10:08:50Z","access_level":"open_access","file_name":"IST-2018-943-v1+1_2012_Chatterjee_Faster_Algorithms.pdf"}],"volume":16,"license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","page":"167 - 182","ec_funded":1,"pubrep_id":"943","day":"01","author":[{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"last_name":"Chaubal","first_name":"Siddhesh","full_name":"Chaubal, Siddhesh"},{"last_name":"Kamath","first_name":"Pritish","full_name":"Kamath, Pritish"}]},{"volume":5,"quality_controlled":"1","file":[{"checksum":"233007138606aca5a2f75f7ae1742f43","date_updated":"2020-07-14T12:46:35Z","relation":"main_file","file_name":"IST-2018-942-v1+1_Pickup_et_al-2012-Evolutionary_Applications.pdf","access_level":"open_access","date_created":"2018-12-12T10:10:33Z","creator":"system","file_size":396136,"content_type":"application/pdf","file_id":"4821"}],"author":[{"last_name":"Pickup","orcid":"0000-0001-6118-0541","id":"2C78037E-F248-11E8-B48F-1D18A9856A87","full_name":"Pickup, Melinda","first_name":"Melinda"},{"first_name":"David","full_name":"Field, David","id":"419049E2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4014-8478","last_name":"Field"},{"last_name":"Rowell","full_name":"Rowell, David","first_name":"David"},{"first_name":"Andrew","full_name":"Young, Andrew","last_name":"Young"}],"isi":1,"pubrep_id":"942","day":"01","license":"https://creativecommons.org/licenses/by-nc/4.0/","page":"913 - 924","date_created":"2018-12-11T11:46:48Z","oa":1,"date_published":"2012-12-01T00:00:00Z","intvolume":"         5","year":"2012","status":"public","issue":"8","type":"journal_article","publist_id":"7322","publication_status":"published","fulldoi":"https://doi.org/10.1111/j.1752-4571.2012.00284.x","publication":"Evolutionary Applications","tmp":{"image":"/images/cc_by_nc.png","short":"CC BY-NC (4.0)","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode"},"month":"12","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","language":[{"iso":"eng"}],"oa_version":"Published Version","title":"Predicting local adaptation in fragmented plant populations: Implications for restoration genetics","publisher":"Wiley-Blackwell","_id":"498","ddc":["576"],"date_updated":"2025-09-30T08:33:55Z","acknowledgement":"We thank Graham Pickup, David Steer, Linda Broadhurst, Lan Li and Carole Elliott for technical assistance. The New\r\nSouth Wales Department of Environment and Climate Change, ACT Parks, Conservation and Lands and the\r\nDepartment of Sustainability and Environment in Victoria provided permits for seed and soil collection. We thank\r\nSpencer C. H. Barrett for comments that improved the quality of the manuscript.\r\n","external_id":{"isi":["000312808900013"]},"corr_author":"1","has_accepted_license":"1","department":[{"_id":"NiBa"}],"article_processing_charge":"No","file_date_updated":"2020-07-14T12:46:35Z","citation":{"apa":"Pickup, M., Field, D., Rowell, D., &#38; Young, A. (2012). Predicting local adaptation in fragmented plant populations: Implications for restoration genetics. <i>Evolutionary Applications</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1111/j.1752-4571.2012.00284.x\">https://doi.org/10.1111/j.1752-4571.2012.00284.x</a>","mla":"Pickup, Melinda, et al. “Predicting Local Adaptation in Fragmented Plant Populations: Implications for Restoration Genetics.” <i>Evolutionary Applications</i>, vol. 5, no. 8, Wiley-Blackwell, 2012, pp. 913–24, doi:<a href=\"https://doi.org/10.1111/j.1752-4571.2012.00284.x\">10.1111/j.1752-4571.2012.00284.x</a>.","ama":"Pickup M, Field D, Rowell D, Young A. Predicting local adaptation in fragmented plant populations: Implications for restoration genetics. <i>Evolutionary Applications</i>. 2012;5(8):913-924. doi:<a href=\"https://doi.org/10.1111/j.1752-4571.2012.00284.x\">10.1111/j.1752-4571.2012.00284.x</a>","chicago":"Pickup, Melinda, David Field, David Rowell, and Andrew Young. “Predicting Local Adaptation in Fragmented Plant Populations: Implications for Restoration Genetics.” <i>Evolutionary Applications</i>. Wiley-Blackwell, 2012. <a href=\"https://doi.org/10.1111/j.1752-4571.2012.00284.x\">https://doi.org/10.1111/j.1752-4571.2012.00284.x</a>.","short":"M. Pickup, D. Field, D. Rowell, A. Young, Evolutionary Applications 5 (2012) 913–924.","ista":"Pickup M, Field D, Rowell D, Young A. 2012. Predicting local adaptation in fragmented plant populations: Implications for restoration genetics. Evolutionary Applications. 5(8), 913–924.","ieee":"M. Pickup, D. Field, D. Rowell, and A. Young, “Predicting local adaptation in fragmented plant populations: Implications for restoration genetics,” <i>Evolutionary Applications</i>, vol. 5, no. 8. Wiley-Blackwell, pp. 913–924, 2012."},"doi":"10.1111/j.1752-4571.2012.00284.x","abstract":[{"text":"Understanding patterns and correlates of local adaptation in heterogeneous landscapes can provide important information in the selection of appropriate seed sources for restoration. We assessed the extent of local adaptation of fitness components in 12 population pairs of the perennial herb Rutidosis leptorrhynchoides (Asteraceae) and examined whether spatial scale (0.7-600 km), environmental distance, quantitative (QST) and neutral (FST) genetic differentiation, and size of the local and foreign populations could predict patterns of adaptive differentiation. Local adaptation varied among populations and fitness components. Including all population pairs, local adaptation was observed for seedling survival, but not for biomass, while foreign genotype advantage was observed for reproduction (number of inflorescences). Among population pairs, local adaptation increased with QST and local population size for biomass. QST was associated with environmental distance, suggesting ecological selection for phenotypic divergence. However, low FST and variation in population structure in small populations demonstrates the interaction of gene flow and drift in constraining local adaptation in R. leptorrhynchoides. Our study indicates that for species in heterogeneous landscapes, collecting seed from large populations from similar environments to candidate sites is likely to provide the most appropriate seed sources for restoration.","lang":"eng"}]},{"month":"07","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"oa_version":"Published Version","title":"Mean-payoff pushdown games","publisher":"IST Austria","_id":"5377","ddc":["000","005"],"date_updated":"2025-09-30T08:08:12Z","alternative_title":["IST Austria Technical Report"],"corr_author":"1","has_accepted_license":"1","department":[{"_id":"KrCh"}],"article_processing_charge":"No","file_date_updated":"2020-07-14T12:46:38Z","citation":{"mla":"Chatterjee, Krishnendu, and Yaron Velner. <i>Mean-Payoff Pushdown Games</i>. IST Austria, 2012, doi:<a href=\"https://doi.org/10.15479/AT:IST-2012-0002\">10.15479/AT:IST-2012-0002</a>.","apa":"Chatterjee, K., &#38; Velner, Y. (2012). <i>Mean-payoff pushdown games</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2012-0002\">https://doi.org/10.15479/AT:IST-2012-0002</a>","ieee":"K. Chatterjee and Y. Velner, <i>Mean-payoff pushdown games</i>. IST Austria, 2012.","ista":"Chatterjee K, Velner Y. 2012. Mean-payoff pushdown games, IST Austria, 33p.","chicago":"Chatterjee, Krishnendu, and Yaron Velner. <i>Mean-Payoff Pushdown Games</i>. IST Austria, 2012. <a href=\"https://doi.org/10.15479/AT:IST-2012-0002\">https://doi.org/10.15479/AT:IST-2012-0002</a>.","short":"K. Chatterjee, Y. Velner, Mean-Payoff Pushdown Games, IST Austria, 2012.","ama":"Chatterjee K, Velner Y. <i>Mean-Payoff Pushdown Games</i>. IST Austria; 2012. doi:<a href=\"https://doi.org/10.15479/AT:IST-2012-0002\">10.15479/AT:IST-2012-0002</a>"},"doi":"10.15479/AT:IST-2012-0002","abstract":[{"lang":"eng","text":"Two-player games on graphs are central in many problems in formal verification and program analysis such as synthesis and verification of open systems. In this work we consider solving recursive game graphs (or pushdown game graphs) that can model the control flow of sequential programs with recursion. While pushdown games have been studied before with qualitative objectives, such as reachability and ω-regular objectives, in this work we study for the first time such games with the most well-studied quantitative objective, namely, mean-payoff objectives. In pushdown games two types of strategies are relevant: (1) global strategies, that depend on the entire global history; and (2) modular strategies, that have only local memory and thus do not depend on the context of invocation, but only on the history of the current invocation of the module. Our main results are as follows: (1) One-player pushdown games with mean-payoff objectives under global strategies are decidable in polynomial time. (2) Two- player pushdown games with mean-payoff objectives under global strategies are undecidable. (3) One-player pushdown games with mean-payoff objectives under modular strategies are NP- hard. (4) Two-player pushdown games with mean-payoff objectives under modular strategies can be solved in NP (i.e., both one-player and two-player pushdown games with mean-payoff objectives under modular strategies are NP-complete). We also establish the optimal strategy complexity showing that global strategies for mean-payoff objectives require infinite memory even in one-player pushdown games; and memoryless modular strategies are sufficient in two- player pushdown games. Finally we also show that all the problems have the same complexity if the stack boundedness condition is added, where along with the mean-payoff objective the player must also ensure that the stack height is bounded."}],"publication_identifier":{"issn":["2664-1690"]},"file":[{"file_size":592098,"creator":"system","file_id":"5522","content_type":"application/pdf","date_updated":"2020-07-14T12:46:38Z","relation":"main_file","checksum":"a03c08c1589dbb0c96183a8bcf3ab240","date_created":"2018-12-12T11:54:00Z","access_level":"open_access","file_name":"IST-2012-002_IST-2012-0002.pdf"}],"author":[{"orcid":"0000-0002-4561-241X","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"full_name":"Velner, Yaron","first_name":"Yaron","last_name":"Velner"}],"pubrep_id":"10","day":"02","page":"33","date_created":"2018-12-12T11:38:59Z","oa":1,"date_published":"2012-07-02T00:00:00Z","related_material":{"record":[{"id":"2956","status":"public","relation":"later_version"}]},"year":"2012","status":"public","type":"technical_report","publication_status":"published","fulldoi":"https://doi.org/10.15479/AT:IST-2012-0002"},{"publication_status":"published","fulldoi":"https://doi.org/10.15479/AT:IST-2012-0001","oa":1,"date_published":"2012-07-04T00:00:00Z","date_created":"2018-12-12T11:38:59Z","type":"technical_report","related_material":{"record":[{"id":"497","relation":"later_version","status":"public"}]},"year":"2012","status":"public","pubrep_id":"14","day":"04","author":[{"first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","last_name":"Chatterjee"},{"first_name":"Siddhesh","full_name":"Chaubal, Siddhesh","last_name":"Chaubal"},{"last_name":"Kamath","full_name":"Kamath, Pritish","first_name":"Pritish"}],"page":"21","file":[{"date_updated":"2020-07-14T12:46:39Z","relation":"main_file","checksum":"ec8d1857cc7095d3de5107a0162ced37","date_created":"2018-12-12T11:53:28Z","access_level":"open_access","file_name":"IST-2012-0001_IST-2012-0001.pdf","file_size":394256,"creator":"system","content_type":"application/pdf","file_id":"5489"}],"has_accepted_license":"1","department":[{"_id":"KrCh"}],"alternative_title":["IST Austria Technical Report"],"corr_author":"1","citation":{"ama":"Chatterjee K, Chaubal S, Kamath P. <i>Faster Algorithms for Alternating Refinement Relations</i>. IST Austria; 2012. doi:<a href=\"https://doi.org/10.15479/AT:IST-2012-0001\">10.15479/AT:IST-2012-0001</a>","chicago":"Chatterjee, Krishnendu, Siddhesh Chaubal, and Pritish Kamath. <i>Faster Algorithms for Alternating Refinement Relations</i>. IST Austria, 2012. <a href=\"https://doi.org/10.15479/AT:IST-2012-0001\">https://doi.org/10.15479/AT:IST-2012-0001</a>.","short":"K. Chatterjee, S. Chaubal, P. Kamath, Faster Algorithms for Alternating Refinement Relations, IST Austria, 2012.","ista":"Chatterjee K, Chaubal S, Kamath P. 2012. Faster algorithms for alternating refinement relations, IST Austria, 21p.","ieee":"K. Chatterjee, S. Chaubal, and P. Kamath, <i>Faster algorithms for alternating refinement relations</i>. IST Austria, 2012.","apa":"Chatterjee, K., Chaubal, S., &#38; Kamath, P. (2012). <i>Faster algorithms for alternating refinement relations</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2012-0001\">https://doi.org/10.15479/AT:IST-2012-0001</a>","mla":"Chatterjee, Krishnendu, et al. <i>Faster Algorithms for Alternating Refinement Relations</i>. IST Austria, 2012, doi:<a href=\"https://doi.org/10.15479/AT:IST-2012-0001\">10.15479/AT:IST-2012-0001</a>."},"file_date_updated":"2020-07-14T12:46:39Z","doi":"10.15479/AT:IST-2012-0001","publication_identifier":{"issn":["2664-1690"]},"abstract":[{"text":"One central issue in the formal design and analysis of reactive systems is the notion of refinement that asks whether all behaviors of the implementation is allowed by the specification. The local interpretation of behavior leads to the notion of simulation. Alternating transition systems (ATSs) provide a general model for composite reactive systems, and the simulation relation for ATSs is known as alternating simulation. The simulation relation for fair transition systems is called fair simulation. In this work our main contributions are as follows: (1) We present an improved algorithm for fair simulation with Büchi fairness constraints; our algorithm requires O(n3 · m) time as compared to the previous known O(n6)-time algorithm, where n is the number of states and m is the number of transitions. (2) We present a game based algorithm for alternating simulation that requires O(m2)-time as compared to the previous known O((n · m)2)-time algorithm, where n is the number of states and m is the size of transition relation. (3) We present an iterative algorithm for alternating simulation that matches the time complexity of the game based algorithm, but is more space efficient than the game based algorithm.","lang":"eng"}],"article_processing_charge":"No","title":"Faster algorithms for alternating refinement relations","_id":"5378","publisher":"IST Austria","ddc":["000","005"],"date_updated":"2025-04-15T08:12:24Z","month":"07","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"oa_version":"Published Version"},{"file":[{"access_level":"open_access","date_created":"2018-12-12T11:53:29Z","file_name":"IST-2012-0003_IST-2012-0003.pdf","checksum":"7e0ba85ad123b13223aaf6cdde2d288c","relation":"main_file","date_updated":"2020-07-14T12:46:44Z","content_type":"application/pdf","file_id":"5490","file_size":618744,"creator":"system"}],"page":"13","pubrep_id":"36","day":"23","author":[{"full_name":"Korc, Filip","first_name":"Filip","id":"476A2FD6-F248-11E8-B48F-1D18A9856A87","last_name":"Korc"},{"last_name":"Kolmogorov","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","first_name":"Vladimir","full_name":"Kolmogorov, Vladimir"},{"full_name":"Lampert, Christoph","first_name":"Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887","last_name":"Lampert"}],"type":"technical_report","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"3124"}]},"year":"2012","status":"public","oa":1,"date_published":"2012-07-23T00:00:00Z","date_created":"2018-12-12T11:39:06Z","publication_status":"published","fulldoi":"https://doi.org/10.15479/AT:IST-2012-0003","oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"07","language":[{"iso":"eng"}],"_id":"5396","publisher":"IST Austria","ddc":["000"],"date_updated":"2024-10-09T20:54:48Z","title":"Approximating marginals using discrete energy minimization","doi":"10.15479/AT:IST-2012-0003","citation":{"ama":"Korc F, Kolmogorov V, Lampert C. <i>Approximating Marginals Using Discrete Energy Minimization</i>. IST Austria; 2012. doi:<a href=\"https://doi.org/10.15479/AT:IST-2012-0003\">10.15479/AT:IST-2012-0003</a>","short":"F. Korc, V. Kolmogorov, C. Lampert, Approximating Marginals Using Discrete Energy Minimization, IST Austria, 2012.","chicago":"Korc, Filip, Vladimir Kolmogorov, and Christoph Lampert. <i>Approximating Marginals Using Discrete Energy Minimization</i>. IST Austria, 2012. <a href=\"https://doi.org/10.15479/AT:IST-2012-0003\">https://doi.org/10.15479/AT:IST-2012-0003</a>.","ista":"Korc F, Kolmogorov V, Lampert C. 2012. Approximating marginals using discrete energy minimization, IST Austria, 13p.","ieee":"F. Korc, V. Kolmogorov, and C. Lampert, <i>Approximating marginals using discrete energy minimization</i>. IST Austria, 2012.","apa":"Korc, F., Kolmogorov, V., &#38; Lampert, C. (2012). <i>Approximating marginals using discrete energy minimization</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2012-0003\">https://doi.org/10.15479/AT:IST-2012-0003</a>","mla":"Korc, Filip, et al. <i>Approximating Marginals Using Discrete Energy Minimization</i>. IST Austria, 2012, doi:<a href=\"https://doi.org/10.15479/AT:IST-2012-0003\">10.15479/AT:IST-2012-0003</a>."},"file_date_updated":"2020-07-14T12:46:44Z","abstract":[{"lang":"eng","text":"We consider the problem of inference in agraphical model with binary variables. While in theory it is arguably preferable to compute marginal probabilities, in practice researchers often use MAP inference due to the availability of efficient discrete optimization algorithms. We bridge the gap between the two approaches by introducing the Discrete  Marginals technique in which approximate marginals are obtained by minimizing an objective function with unary and pair-wise terms over a discretized domain. This allows the use of techniques originally devel-oped for MAP-MRF inference and learning. We explore two ways to set up the objective function - by discretizing the Bethe free energy and by learning it  from training data. Experimental results show that for certain types of graphs a learned function can out-perform the  Bethe approximation. We also establish a link between the Bethe free energy and submodular functions."}],"publication_identifier":{"issn":["2664-1690"]},"has_accepted_license":"1","department":[{"_id":"VlKo"},{"_id":"ChLa"}],"alternative_title":["IST Austria Technical Report"]},{"status":"public","year":"2012","date_updated":"2020-07-14T23:04:49Z","ddc":["020"],"_id":"5398","publisher":"IST Austria","type":"report","date_created":"2018-12-12T11:39:06Z","date_published":"2012-11-12T00:00:00Z","title":"Actual state of research data @ ISTAustria","oa":1,"publication_status":"published","abstract":[{"text":"This document is created as a part of the project “Repository for Research Data on IST Austria”. It summarises the actual state of research data at IST Austria, based on survey results. It supports the choice of appropriate software, which would best fit the requirements of their users, the researchers.","lang":"eng"}],"file_date_updated":"2020-07-14T12:46:44Z","citation":{"apa":"Porsche, J. (2012). <i>Actual state of research data @ ISTAustria</i>. IST Austria.","mla":"Porsche, Jana. <i>Actual State of Research Data @ ISTAustria</i>. IST Austria, 2012.","ama":"Porsche J. <i>Actual State of Research Data @ ISTAustria</i>. IST Austria; 2012.","chicago":"Porsche, Jana. <i>Actual State of Research Data @ ISTAustria</i>. IST Austria, 2012.","short":"J. Porsche, Actual State of Research Data @ ISTAustria, IST Austria, 2012.","ista":"Porsche J. 2012. Actual state of research data @ ISTAustria, IST Austria,p.","ieee":"J. Porsche, <i>Actual state of research data @ ISTAustria</i>. IST Austria, 2012."},"department":[{"_id":"E-Lib"}],"has_accepted_license":"1","file":[{"creator":"system","file_size":238544,"file_id":"5472","content_type":"application/pdf","date_updated":"2020-07-14T12:46:44Z","relation":"main_file","checksum":"e0a7c041eea1ca4b70ab6f9ec5177f4e","file_name":"IST-2012-103-v1+1_Actual_state_of_research_data_@_IST_Austria.pdf","date_created":"2018-12-12T11:53:11Z","access_level":"open_access"}],"oa_version":"Published Version","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"11","author":[{"id":"3252EDC2-F248-11E8-B48F-1D18A9856A87","last_name":"Porsche","first_name":"Jana","full_name":"Porsche, Jana"}],"day":"12","pubrep_id":"103"},{"pubrep_id":"180","day":"28","author":[{"first_name":"Ashutosh","full_name":"Gupta, Ashutosh","id":"335E5684-F248-11E8-B48F-1D18A9856A87","last_name":"Gupta"}],"page":"107-121","ec_funded":1,"OA_place":"repository","volume":7561,"quality_controlled":"1","file":[{"access_level":"open_access","date_created":"2018-12-18T13:07:35Z","file_name":"2012_ATVA_Gupta.pdf","checksum":"68415837a315de3cc4d120f6019d752c","date_updated":"2020-07-14T12:47:10Z","relation":"main_file","content_type":"application/pdf","file_id":"5746","file_size":465502,"creator":"dernst"}],"conference":{"location":"Thiruvananthapuram, Kerala, India","start_date":"2012-10-03","name":"ATVA: Automated Technology for Verification and Analysis","end_date":"2012-10-06"},"publication":"10th International Symposium on Automated Technology for Verification and Analysis","publication_status":"published","fulldoi":"https://doi.org/10.1007/978-3-642-33386-6_10","oa":1,"date_published":"2012-09-28T00:00:00Z","date_created":"2018-12-18T13:01:46Z","type":"conference","intvolume":"      7561","status":"public","year":"2012","scopus_import":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"month":"09","oa_version":"Submitted Version","project":[{"name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"267989"}],"has_accepted_license":"1","department":[{"_id":"ToHe"}],"alternative_title":["LNCS"],"corr_author":"1","doi":"10.1007/978-3-642-33386-6_10","file_date_updated":"2020-07-14T12:47:10Z","citation":{"mla":"Gupta, Ashutosh. “Improved Single Pass Algorithms for Resolution Proof Reduction.” <i>10th International Symposium on Automated Technology for Verification and Analysis</i>, vol. 7561, Springer Nature, 2012, pp. 107–21, doi:<a href=\"https://doi.org/10.1007/978-3-642-33386-6_10\">10.1007/978-3-642-33386-6_10</a>.","apa":"Gupta, A. (2012). Improved single pass algorithms for resolution proof reduction. In <i>10th International Symposium on Automated Technology for Verification and Analysis</i> (Vol. 7561, pp. 107–121). Thiruvananthapuram, Kerala, India: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-642-33386-6_10\">https://doi.org/10.1007/978-3-642-33386-6_10</a>","ieee":"A. Gupta, “Improved single pass algorithms for resolution proof reduction,” in <i>10th International Symposium on Automated Technology for Verification and Analysis</i>, Thiruvananthapuram, Kerala, India, 2012, vol. 7561, pp. 107–121.","ista":"Gupta A. 2012. Improved single pass algorithms for resolution proof reduction. 10th International Symposium on Automated Technology for Verification and Analysis. ATVA: Automated Technology for Verification and Analysis, LNCS, vol. 7561, 107–121.","short":"A. Gupta, in:, 10th International Symposium on Automated Technology for Verification and Analysis, Springer Nature, 2012, pp. 107–121.","chicago":"Gupta, Ashutosh. “Improved Single Pass Algorithms for Resolution Proof Reduction.” In <i>10th International Symposium on Automated Technology for Verification and Analysis</i>, 7561:107–21. Springer Nature, 2012. <a href=\"https://doi.org/10.1007/978-3-642-33386-6_10\">https://doi.org/10.1007/978-3-642-33386-6_10</a>.","ama":"Gupta A. Improved single pass algorithms for resolution proof reduction. In: <i>10th International Symposium on Automated Technology for Verification and Analysis</i>. Vol 7561. Springer Nature; 2012:107-121. doi:<a href=\"https://doi.org/10.1007/978-3-642-33386-6_10\">10.1007/978-3-642-33386-6_10</a>"},"abstract":[{"lang":"eng","text":"Unsatisfiability proofs find many applications in verification. Today, many SAT solvers are capable of producing resolution proofs of unsatisfiability. For efficiency smaller proofs are preferred over bigger ones. The solvers apply proof reduction methods to remove redundant parts of the proofs while and after generating the proofs. One method of reducing resolution proofs is redundant resolution reduction, i.e., removing repeated pivots in the paths of resolution proofs (aka Pivot recycle). The known single pass algorithm only tries to remove redundancies in the parts of the proof that are trees. In this paper, we present three modifications to improve the algorithm such that the redundancies can be found in the parts of the proofs that are DAGs. The first modified algorithm covers greater number of redundancies as compared to the known algorithm without incurring any additional cost. The second modified algorithm covers even greater number of the redundancies but it may have longer run times. Our third modified algorithm is parametrized and can trade off between run times and the coverage of the redundancies. We have implemented our algorithms in OpenSMT and applied them on unsatisfiability proofs of 198 examples from plain MUS track of SAT11 competition. The first and second algorithm additionally remove 0.89% and 10.57% of clauses respectively as compared to the original algorithm. For certain value of the parameter, the third algorithm removes almost as many clauses as the second algorithm but is significantly faster."}],"publication_identifier":{"issn":["0302-9743"],"eisbn":["9783642333866"],"isbn":["9783642333859"],"eissn":["1611-3349"]},"article_processing_charge":"No","title":"Improved single pass algorithms for resolution proof reduction","acknowledgement":"This work was supported by the ERC Advanced Investigator grant on Quantitative\r\nReactive Modeling (QUAREM).","_id":"5745","publisher":"Springer Nature","date_updated":"2025-04-15T07:56:27Z","ddc":["005"]},{"publication_identifier":{"issn":["0036-8075"],"eissn":["1095-9203"]},"abstract":[{"text":"The Arabidopsis thaliana central cell, the companion cell of the egg, undergoes DNA demethylation before fertilization, but the targeting preferences, mechanism, and biological significance of this process remain unclear. Here, we show that active DNA demethylation mediated by the DEMETER DNA glycosylase accounts for all of the demethylation in the central cell and preferentially targets small, AT-rich, and nucleosome-depleted euchromatic transposable elements. The vegetative cell, the companion cell of sperm, also undergoes DEMETER-dependent demethylation of similar sequences, and lack of DEMETER in vegetative cells causes reduced small RNA–directed DNA methylation of transposons in sperm. Our results demonstrate that demethylation in companion cells reinforces transposon methylation in plant gametes and likely contributes to stable silencing of transposable elements across generations.","lang":"eng"}],"doi":"10.1126/science.1224839","citation":{"ieee":"C. A. Ibarra <i>et al.</i>, “Active DNA demethylation in plant companion cells reinforces transposon methylation in gametes,” <i>Science</i>, vol. 337, no. 6100. American Association for the Advancement of Science, pp. 1360–1364, 2012.","ista":"Ibarra CA, Feng X, Schoft VK, Hsieh T-F, Uzawa R, Rodrigues JA, Zemach A, Chumak N, Machlicova A, Nishimura T, Rojas D, Fischer RL, Tamaru H, Zilberman D. 2012. Active DNA demethylation in plant companion cells reinforces transposon methylation in gametes. Science. 337(6100), 1360–1364.","short":"C.A. Ibarra, X. Feng, V.K. Schoft, T.-F. Hsieh, R. Uzawa, J.A. Rodrigues, A. Zemach, N. Chumak, A. Machlicova, T. Nishimura, D. Rojas, R.L. Fischer, H. Tamaru, D. Zilberman, Science 337 (2012) 1360–1364.","chicago":"Ibarra, Christian A., Xiaoqi Feng, Vera K. Schoft, Tzung-Fu Hsieh, Rie Uzawa, Jessica A. Rodrigues, Assaf Zemach, et al. “Active DNA Demethylation in Plant Companion Cells Reinforces Transposon Methylation in Gametes.” <i>Science</i>. American Association for the Advancement of Science, 2012. <a href=\"https://doi.org/10.1126/science.1224839\">https://doi.org/10.1126/science.1224839</a>.","ama":"Ibarra CA, Feng X, Schoft VK, et al. Active DNA demethylation in plant companion cells reinforces transposon methylation in gametes. <i>Science</i>. 2012;337(6100):1360-1364. doi:<a href=\"https://doi.org/10.1126/science.1224839\">10.1126/science.1224839</a>","mla":"Ibarra, Christian A., et al. “Active DNA Demethylation in Plant Companion Cells Reinforces Transposon Methylation in Gametes.” <i>Science</i>, vol. 337, no. 6100, American Association for the Advancement of Science, 2012, pp. 1360–64, doi:<a href=\"https://doi.org/10.1126/science.1224839\">10.1126/science.1224839</a>.","apa":"Ibarra, C. A., Feng, X., Schoft, V. K., Hsieh, T.-F., Uzawa, R., Rodrigues, J. A., … Zilberman, D. (2012). Active DNA demethylation in plant companion cells reinforces transposon methylation in gametes. <i>Science</i>. American Association for the Advancement of Science. <a href=\"https://doi.org/10.1126/science.1224839\">https://doi.org/10.1126/science.1224839</a>"},"article_processing_charge":"No","department":[{"_id":"DaZi"}],"has_accepted_license":"1","external_id":{"pmid":["22984074"]},"date_updated":"2021-12-14T08:28:51Z","ddc":["580"],"_id":"9451","publisher":"American Association for the Advancement of Science","title":"Active DNA demethylation in plant companion cells reinforces transposon methylation in gametes","oa_version":"Published Version","main_file_link":[{"open_access":"1","url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4034762/"}],"scopus_import":"1","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","month":"09","language":[{"iso":"eng"}],"publication":"Science","fulldoi":"https://doi.org/10.1126/science.1224839","publication_status":"published","type":"journal_article","issue":"6100","status":"public","year":"2012","extern":"1","intvolume":"       337","date_published":"2012-09-14T00:00:00Z","oa":1,"date_created":"2021-06-04T07:51:31Z","page":"1360-1364","day":"14","author":[{"first_name":"Christian A.","full_name":"Ibarra, Christian A.","last_name":"Ibarra"},{"full_name":"Feng, Xiaoqi","first_name":"Xiaoqi","last_name":"Feng"},{"last_name":"Schoft","first_name":"Vera K.","full_name":"Schoft, Vera K."},{"last_name":"Hsieh","full_name":"Hsieh, Tzung-Fu","first_name":"Tzung-Fu"},{"last_name":"Uzawa","first_name":"Rie","full_name":"Uzawa, Rie"},{"full_name":"Rodrigues, Jessica A.","first_name":"Jessica A.","last_name":"Rodrigues"},{"first_name":"Assaf","full_name":"Zemach, Assaf","last_name":"Zemach"},{"last_name":"Chumak","full_name":"Chumak, Nina","first_name":"Nina"},{"last_name":"Machlicova","full_name":"Machlicova, Adriana","first_name":"Adriana"},{"full_name":"Nishimura, Toshiro","first_name":"Toshiro","last_name":"Nishimura"},{"last_name":"Rojas","full_name":"Rojas, Denisse","first_name":"Denisse"},{"first_name":"Robert L.","full_name":"Fischer, Robert L.","last_name":"Fischer"},{"last_name":"Tamaru","first_name":"Hisashi","full_name":"Tamaru, Hisashi"},{"first_name":"Daniel","full_name":"Zilberman, Daniel","last_name":"Zilberman","id":"6973db13-dd5f-11ea-814e-b3e5455e9ed1","orcid":"0000-0002-0123-8649"}],"quality_controlled":"1","pmid":1,"article_type":"original","volume":337},{"article_number":"e1002988","oa_version":"Published Version","main_file_link":[{"url":"https://doi.org/10.1371/journal.pgen.1002988","open_access":"1"}],"scopus_import":"1","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","month":"10","language":[{"iso":"eng"}],"external_id":{"pmid":["23071449"]},"date_updated":"2021-12-14T08:29:57Z","_id":"9497","publisher":"Public Library of Science","title":"Deposition of histone variant H2A.Z within gene bodies regulates responsive genes","abstract":[{"lang":"eng","text":"The regulation of eukaryotic chromatin relies on interactions between many epigenetic factors, including histone modifications, DNA methylation, and the incorporation of histone variants. H2A.Z, one of the most conserved but enigmatic histone variants that is enriched at the transcriptional start sites of genes, has been implicated in a variety of chromosomal processes. Recently, we reported a genome-wide anticorrelation between H2A.Z and DNA methylation, an epigenetic hallmark of heterochromatin that has also been found in the bodies of active genes in plants and animals. Here, we investigate the basis of this anticorrelation using a novel h2a.z loss-of-function line in Arabidopsis thaliana. Through genome-wide bisulfite sequencing, we demonstrate that loss of H2A.Z in Arabidopsis has only a minor effect on the level or profile of DNA methylation in genes, and we propose that the global anticorrelation between DNA methylation and H2A.Z is primarily caused by the exclusion of H2A.Z from methylated DNA. RNA sequencing and genomic mapping of H2A.Z show that H2A.Z enrichment across gene bodies, rather than at the TSS, is correlated with lower transcription levels and higher measures of gene responsiveness. Loss of H2A.Z causes misregulation of many genes that are disproportionately associated with response to environmental and developmental stimuli. We propose that H2A.Z deposition in gene bodies promotes variability in levels and patterns of gene expression, and that a major function of genic DNA methylation is to exclude H2A.Z from constitutively expressed genes."}],"publication_identifier":{"issn":["1553-7390"],"eissn":["1553-7404"]},"doi":"10.1371/journal.pgen.1002988","citation":{"apa":"Coleman-Derr, D., &#38; Zilberman, D. (2012). Deposition of histone variant H2A.Z within gene bodies regulates responsive genes. <i>PLoS Genetics</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pgen.1002988\">https://doi.org/10.1371/journal.pgen.1002988</a>","mla":"Coleman-Derr, Devin, and Daniel Zilberman. “Deposition of Histone Variant H2A.Z within Gene Bodies Regulates Responsive Genes.” <i>PLoS Genetics</i>, vol. 8, no. 10, e1002988, Public Library of Science, 2012, doi:<a href=\"https://doi.org/10.1371/journal.pgen.1002988\">10.1371/journal.pgen.1002988</a>.","ista":"Coleman-Derr D, Zilberman D. 2012. Deposition of histone variant H2A.Z within gene bodies regulates responsive genes. PLoS Genetics. 8(10), e1002988.","ieee":"D. Coleman-Derr and D. Zilberman, “Deposition of histone variant H2A.Z within gene bodies regulates responsive genes,” <i>PLoS Genetics</i>, vol. 8, no. 10. Public Library of Science, 2012.","ama":"Coleman-Derr D, Zilberman D. Deposition of histone variant H2A.Z within gene bodies regulates responsive genes. <i>PLoS Genetics</i>. 2012;8(10). doi:<a href=\"https://doi.org/10.1371/journal.pgen.1002988\">10.1371/journal.pgen.1002988</a>","short":"D. Coleman-Derr, D. Zilberman, PLoS Genetics 8 (2012).","chicago":"Coleman-Derr, Devin, and Daniel Zilberman. “Deposition of Histone Variant H2A.Z within Gene Bodies Regulates Responsive Genes.” <i>PLoS Genetics</i>. Public Library of Science, 2012. <a href=\"https://doi.org/10.1371/journal.pgen.1002988\">https://doi.org/10.1371/journal.pgen.1002988</a>."},"article_processing_charge":"No","department":[{"_id":"DaZi"}],"quality_controlled":"1","pmid":1,"article_type":"original","volume":8,"day":"11","author":[{"last_name":"Coleman-Derr","first_name":"Devin","full_name":"Coleman-Derr, Devin"},{"first_name":"Daniel","full_name":"Zilberman, Daniel","orcid":"0000-0002-0123-8649","id":"6973db13-dd5f-11ea-814e-b3e5455e9ed1","last_name":"Zilberman"}],"type":"journal_article","issue":"10","year":"2012","status":"public","extern":"1","intvolume":"         8","date_published":"2012-10-11T00:00:00Z","oa":1,"date_created":"2021-06-07T10:55:27Z","publication":"PLoS Genetics","fulldoi":"https://doi.org/10.1371/journal.pgen.1002988","publication_status":"published"},{"quality_controlled":"1","pmid":1,"article_type":"original","volume":8,"day":"22","author":[{"last_name":"Kim","first_name":"Sang Yeol","full_name":"Kim, Sang Yeol"},{"first_name":"Jungeun","full_name":"Lee, Jungeun","last_name":"Lee"},{"last_name":"Eshed-Williams","full_name":"Eshed-Williams, Leor","first_name":"Leor"},{"orcid":"0000-0002-0123-8649","id":"6973db13-dd5f-11ea-814e-b3e5455e9ed1","last_name":"Zilberman","first_name":"Daniel","full_name":"Zilberman, Daniel"},{"last_name":"Sung","first_name":"Z. Renee","full_name":"Sung, Z. Renee"}],"type":"journal_article","issue":"3","year":"2012","extern":"1","status":"public","intvolume":"         8","date_published":"2012-03-22T00:00:00Z","oa":1,"date_created":"2021-06-07T11:07:56Z","publication":"PLoS Genetics","fulldoi":"https://doi.org/10.1371/journal.pgen.1002512","publication_status":"published","article_number":"e1002512","oa_version":"Published Version","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1371/journal.pgen.1002512"}],"scopus_import":"1","language":[{"iso":"eng"}],"month":"03","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","external_id":{"pmid":["22457632"]},"date_updated":"2021-12-14T08:31:14Z","_id":"9499","publisher":"Public Library of Science","title":"EMF1 and PRC2 cooperate to repress key regulators of Arabidopsis development","abstract":[{"text":"EMBRYONIC FLOWER1 (EMF1) is a plant-specific gene crucial to Arabidopsis vegetative development. Loss of function mutants in the EMF1 gene mimic the phenotype caused by mutations in Polycomb Group protein (PcG) genes, which encode epigenetic repressors that regulate many aspects of eukaryotic development. In Arabidopsis, Polycomb Repressor Complex 2 (PRC2), made of PcG proteins, catalyzes trimethylation of lysine 27 on histone H3 (H3K27me3) and PRC1-like proteins catalyze H2AK119 ubiquitination. Despite functional similarity to PcG proteins, EMF1 lacks sequence homology with known PcG proteins; thus, its role in the PcG mechanism is unclear. To study the EMF1 functions and its mechanism of action, we performed genome-wide mapping of EMF1 binding and H3K27me3 modification sites in Arabidopsis seedlings. The EMF1 binding pattern is similar to that of H3K27me3 modification on the chromosomal and genic level. ChIPOTLe peak finding and clustering analyses both show that the highly trimethylated genes also have high enrichment levels of EMF1 binding, termed EMF1_K27 genes. EMF1 interacts with regulatory genes, which are silenced to allow vegetative growth, and with genes specifying cell fates during growth and differentiation. H3K27me3 marks not only these genes but also some genes that are involved in endosperm development and maternal effects. Transcriptome analysis, coupled with the H3K27me3 pattern, of EMF1_K27 genes in emf1 and PRC2 mutants showed that EMF1 represses gene activities via diverse mechanisms and plays a novel role in the PcG mechanism.","lang":"eng"}],"publication_identifier":{"issn":["1553-7390"],"eissn":["1553-7404"]},"doi":"10.1371/journal.pgen.1002512","citation":{"apa":"Kim, S. Y., Lee, J., Eshed-Williams, L., Zilberman, D., &#38; Sung, Z. R. (2012). EMF1 and PRC2 cooperate to repress key regulators of Arabidopsis development. <i>PLoS Genetics</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pgen.1002512\">https://doi.org/10.1371/journal.pgen.1002512</a>","mla":"Kim, Sang Yeol, et al. “EMF1 and PRC2 Cooperate to Repress Key Regulators of Arabidopsis Development.” <i>PLoS Genetics</i>, vol. 8, no. 3, e1002512, Public Library of Science, 2012, doi:<a href=\"https://doi.org/10.1371/journal.pgen.1002512\">10.1371/journal.pgen.1002512</a>.","ista":"Kim SY, Lee J, Eshed-Williams L, Zilberman D, Sung ZR. 2012. EMF1 and PRC2 cooperate to repress key regulators of Arabidopsis development. PLoS Genetics. 8(3), e1002512.","ieee":"S. Y. Kim, J. Lee, L. Eshed-Williams, D. Zilberman, and Z. R. Sung, “EMF1 and PRC2 cooperate to repress key regulators of Arabidopsis development,” <i>PLoS Genetics</i>, vol. 8, no. 3. Public Library of Science, 2012.","ama":"Kim SY, Lee J, Eshed-Williams L, Zilberman D, Sung ZR. EMF1 and PRC2 cooperate to repress key regulators of Arabidopsis development. <i>PLoS Genetics</i>. 2012;8(3). doi:<a href=\"https://doi.org/10.1371/journal.pgen.1002512\">10.1371/journal.pgen.1002512</a>","short":"S.Y. Kim, J. Lee, L. Eshed-Williams, D. Zilberman, Z.R. Sung, PLoS Genetics 8 (2012).","chicago":"Kim, Sang Yeol, Jungeun Lee, Leor Eshed-Williams, Daniel Zilberman, and Z. Renee Sung. “EMF1 and PRC2 Cooperate to Repress Key Regulators of Arabidopsis Development.” <i>PLoS Genetics</i>. Public Library of Science, 2012. <a href=\"https://doi.org/10.1371/journal.pgen.1002512\">https://doi.org/10.1371/journal.pgen.1002512</a>."},"article_processing_charge":"No","department":[{"_id":"DaZi"}]},{"scopus_import":"1","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","language":[{"iso":"eng"}],"month":"04","oa_version":"None","department":[{"_id":"DaZi"}],"abstract":[{"text":"Accumulating evidence points toward diverse functions for plant chromatin. Remarkable progress has been made over the last few years in elucidating the mechanisms for a number of these functions. Activity of the histone demethylase IBM1 accurately targets DNA methylation to silent repeats and transposable elements, not to genes. A genetic screen uncovered the surprising role of H2A.Z-containing nucleosomes in sensing precise differences in ambient temperature and consequent gene regulation. Precise maintenance of chromosome number is assured by a histone modification that suppresses inappropriate DNA replication and by centromeric histone H3 regulation of chromosome segregation. Histones and noncoding RNAs regulate FLOWERING LOCUS C, the expression of which quantitatively measures the duration of cold exposure, functioning as memory of winter. These findings are a testament to the power of using plants to research chromatin organization, and demonstrate examples of how chromatin functions to achieve biological accuracy, precision, and memory.","lang":"eng"}],"publication_identifier":{"issn":["0959-437X"]},"citation":{"short":"J.T. Huff, D. Zilberman, Current Opinion in Genetics and Development 22 (2012) 132–138.","chicago":"Huff, Jason T., and Daniel Zilberman. “Regulation of Biological Accuracy, Precision, and Memory by Plant Chromatin Organization.” <i>Current Opinion in Genetics and Development</i>. Elsevier, 2012. <a href=\"https://doi.org/10.1016/j.gde.2012.01.007\">https://doi.org/10.1016/j.gde.2012.01.007</a>.","ama":"Huff JT, Zilberman D. Regulation of biological accuracy, precision, and memory by plant chromatin organization. <i>Current Opinion in Genetics and Development</i>. 2012;22(2):132-138. doi:<a href=\"https://doi.org/10.1016/j.gde.2012.01.007\">10.1016/j.gde.2012.01.007</a>","ieee":"J. T. Huff and D. Zilberman, “Regulation of biological accuracy, precision, and memory by plant chromatin organization,” <i>Current Opinion in Genetics and Development</i>, vol. 22, no. 2. Elsevier, pp. 132–138, 2012.","ista":"Huff JT, Zilberman D. 2012. Regulation of biological accuracy, precision, and memory by plant chromatin organization. Current Opinion in Genetics and Development. 22(2), 132–138.","mla":"Huff, Jason T., and Daniel Zilberman. “Regulation of Biological Accuracy, Precision, and Memory by Plant Chromatin Organization.” <i>Current Opinion in Genetics and Development</i>, vol. 22, no. 2, Elsevier, 2012, pp. 132–38, doi:<a href=\"https://doi.org/10.1016/j.gde.2012.01.007\">10.1016/j.gde.2012.01.007</a>.","apa":"Huff, J. T., &#38; Zilberman, D. (2012). Regulation of biological accuracy, precision, and memory by plant chromatin organization. <i>Current Opinion in Genetics and Development</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.gde.2012.01.007\">https://doi.org/10.1016/j.gde.2012.01.007</a>"},"doi":"10.1016/j.gde.2012.01.007","article_processing_charge":"No","title":"Regulation of biological accuracy, precision, and memory by plant chromatin organization","external_id":{"pmid":["22336527"]},"date_updated":"2021-12-14T08:32:38Z","_id":"9528","publisher":"Elsevier","author":[{"first_name":"Jason T.","full_name":"Huff, Jason T.","last_name":"Huff"},{"id":"6973db13-dd5f-11ea-814e-b3e5455e9ed1","last_name":"Zilberman","orcid":"0000-0002-0123-8649","full_name":"Zilberman, Daniel","first_name":"Daniel"}],"page":"132-138","volume":22,"quality_controlled":"1","pmid":1,"article_type":"review","publication":"Current Opinion in Genetics and Development","fulldoi":"https://doi.org/10.1016/j.gde.2012.01.007","publication_status":"published","date_published":"2012-04-01T00:00:00Z","date_created":"2021-06-08T08:58:52Z","type":"journal_article","issue":"2","extern":"1","status":"public","year":"2012","intvolume":"        22"},{"scopus_import":"1","language":[{"iso":"eng"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","month":"12","oa_version":"Published Version","main_file_link":[{"url":"https://doi.org/10.1101/sqb.2012.77.014944","open_access":"1"}],"title":"DNA methylation, H2A.Z, and the regulation of constitutive expression","external_id":{"pmid":["23250988"]},"date_updated":"2021-12-14T08:33:09Z","publisher":"Cold Spring Harbor Laboratory Press","_id":"9535","department":[{"_id":"DaZi"}],"abstract":[{"lang":"eng","text":"The most well-studied function of DNA methylation in eukaryotic cells is the transcriptional silencing of genes and transposons. More recent results showed that many eukaryotes methylate the bodies of genes as well and that this methylation correlates with transcriptional activity rather than repression. The purpose of gene body methylation remains mysterious, but is potentially related to the histone variant H2A.Z. Studies in plants and animals have shown that the genome-wide distributions of H2A.Z and DNA methylation are strikingly anticorrelated. Furthermore, we and other investigators have shown that this relationship is likely to be the result of an ancient but unknown mechanism by which DNA methylation prevents the incorporation of H2A.Z. Recently, we discovered strong correlations between the presence of H2A.Z within gene bodies, the degree to which a gene's expression varies across tissue types or environmental conditions, and transcriptional misregulation in an h2a.z mutant. We propose that one basal function of gene body methylation is the establishment of constitutive expression patterns within housekeeping genes by excluding H2A.Z from their bodies."}],"publication_identifier":{"eissn":["1943-4456"],"issn":["0091-7451"]},"doi":"10.1101/sqb.2012.77.014944","citation":{"ieee":"D. Coleman-Derr and D. Zilberman, “DNA methylation, H2A.Z, and the regulation of constitutive expression,” <i>Cold Spring Harbor Symposia on Quantitative Biology</i>, vol. 77. Cold Spring Harbor Laboratory Press, pp. 147–154, 2012.","ista":"Coleman-Derr D, Zilberman D. 2012. DNA methylation, H2A.Z, and the regulation of constitutive expression. Cold Spring Harbor Symposia on Quantitative Biology. 77, 147–154.","short":"D. Coleman-Derr, D. Zilberman, Cold Spring Harbor Symposia on Quantitative Biology 77 (2012) 147–154.","chicago":"Coleman-Derr, D., and Daniel Zilberman. “DNA Methylation, H2A.Z, and the Regulation of Constitutive Expression.” <i>Cold Spring Harbor Symposia on Quantitative Biology</i>. Cold Spring Harbor Laboratory Press, 2012. <a href=\"https://doi.org/10.1101/sqb.2012.77.014944\">https://doi.org/10.1101/sqb.2012.77.014944</a>.","ama":"Coleman-Derr D, Zilberman D. DNA methylation, H2A.Z, and the regulation of constitutive expression. <i>Cold Spring Harbor Symposia on Quantitative Biology</i>. 2012;77:147-154. doi:<a href=\"https://doi.org/10.1101/sqb.2012.77.014944\">10.1101/sqb.2012.77.014944</a>","mla":"Coleman-Derr, D., and Daniel Zilberman. “DNA Methylation, H2A.Z, and the Regulation of Constitutive Expression.” <i>Cold Spring Harbor Symposia on Quantitative Biology</i>, vol. 77, Cold Spring Harbor Laboratory Press, 2012, pp. 147–54, doi:<a href=\"https://doi.org/10.1101/sqb.2012.77.014944\">10.1101/sqb.2012.77.014944</a>.","apa":"Coleman-Derr, D., &#38; Zilberman, D. (2012). DNA methylation, H2A.Z, and the regulation of constitutive expression. <i>Cold Spring Harbor Symposia on Quantitative Biology</i>. Cold Spring Harbor Laboratory Press. <a href=\"https://doi.org/10.1101/sqb.2012.77.014944\">https://doi.org/10.1101/sqb.2012.77.014944</a>"},"article_processing_charge":"No","volume":77,"quality_controlled":"1","pmid":1,"article_type":"review","day":"18","author":[{"first_name":"D.","full_name":"Coleman-Derr, D.","last_name":"Coleman-Derr"},{"orcid":"0000-0002-0123-8649","id":"6973db13-dd5f-11ea-814e-b3e5455e9ed1","last_name":"Zilberman","full_name":"Zilberman, Daniel","first_name":"Daniel"}],"page":"147-154","date_published":"2012-12-18T00:00:00Z","oa":1,"date_created":"2021-06-08T13:01:23Z","type":"journal_article","extern":"1","year":"2012","status":"public","intvolume":"        77","publication":"Cold Spring Harbor Symposia on Quantitative Biology","fulldoi":"https://doi.org/10.1101/sqb.2012.77.014944","publication_status":"published"},{"citation":{"mla":"Konrad, Matthias, et al. <i>Data from: Social Transfer of Pathogenic Fungus Promotes Active Immunisation in Ant Colonies</i>. Dryad, 2012, doi:<a href=\"https://doi.org/10.5061/dryad.sv37s\">10.5061/dryad.sv37s</a>.","apa":"Konrad, M., Vyleta, M., Theis, F., Stock, M., Klatt, M., Drescher, V., … Cremer, S. (2012). Data from: Social transfer of pathogenic fungus promotes active immunisation in ant colonies. Dryad. <a href=\"https://doi.org/10.5061/dryad.sv37s\">https://doi.org/10.5061/dryad.sv37s</a>","ieee":"M. Konrad <i>et al.</i>, “Data from: Social transfer of pathogenic fungus promotes active immunisation in ant colonies.” Dryad, 2012.","ista":"Konrad M, Vyleta M, Theis F, Stock M, Klatt M, Drescher V, Marr C, Ugelvig LV, Cremer S. 2012. Data from: Social transfer of pathogenic fungus promotes active immunisation in ant colonies, Dryad, <a href=\"https://doi.org/10.5061/dryad.sv37s\">10.5061/dryad.sv37s</a>.","short":"M. Konrad, M. Vyleta, F. Theis, M. Stock, M. Klatt, V. Drescher, C. Marr, L.V. Ugelvig, S. Cremer, (2012).","chicago":"Konrad, Matthias, Meghan Vyleta, Fabian Theis, Miriam Stock, Martina Klatt, Verena Drescher, Carsten Marr, Line V Ugelvig, and Sylvia Cremer. “Data from: Social Transfer of Pathogenic Fungus Promotes Active Immunisation in Ant Colonies.” Dryad, 2012. <a href=\"https://doi.org/10.5061/dryad.sv37s\">https://doi.org/10.5061/dryad.sv37s</a>.","ama":"Konrad M, Vyleta M, Theis F, et al. Data from: Social transfer of pathogenic fungus promotes active immunisation in ant colonies. 2012. doi:<a href=\"https://doi.org/10.5061/dryad.sv37s\">10.5061/dryad.sv37s</a>"},"doi":"10.5061/dryad.sv37s","abstract":[{"lang":"eng","text":"Due to the omnipresent risk of epidemics, insect societies have evolved sophisticated disease defences at the individual and colony level. An intriguing yet little understood phenomenon is that social contact to pathogen-exposed individuals reduces susceptibility of previously naive nestmates to this pathogen. We tested whether such social immunisation in Lasius ants against the entomopathogenic fungus Metarhizium anisopliae is based on active upregulation of the immune system of nestmates following contact to an infectious individual or passive protection via transfer of immune effectors among group members—that is, active versus passive immunisation. We found no evidence for involvement of passive immunisation via transfer of antimicrobials among colony members. Instead, intensive allogrooming behaviour between naive and pathogen-exposed ants before fungal conidia firmly attached to their cuticle suggested passage of the pathogen from the exposed individuals to their nestmates. By tracing fluorescence-labelled conidia we indeed detected frequent pathogen transfer to the nestmates, where they caused low-level infections as revealed by growth of small numbers of fungal colony forming units from their dissected body content. These infections rarely led to death, but instead promoted an enhanced ability to inhibit fungal growth and an active upregulation of immune genes involved in antifungal defences (defensin and prophenoloxidase, PPO). Contrarily, there was no upregulation of the gene cathepsin L, which is associated with antibacterial and antiviral defences, and we found no increased antibacterial activity of nestmates of fungus-exposed ants. This indicates that social immunisation after fungal exposure is specific, similar to recent findings for individual-level immune priming in invertebrates. Epidemiological modeling further suggests that active social immunisation is adaptive, as it leads to faster elimination of the disease and lower death rates than passive immunisation. Interestingly, humans have also utilised the protective effect of low-level infections to fight smallpox by intentional transfer of low pathogen doses (“variolation” or “inoculation”)."}],"fulldoi":"https://doi.org/10.5061/dryad.sv37s","article_processing_charge":"No","department":[{"_id":"SyCr"}],"type":"research_data_reference","publisher":"Dryad","_id":"9755","related_material":{"record":[{"id":"3242","status":"public","relation":"used_in_publication"}]},"year":"2012","date_updated":"2025-09-30T07:50:00Z","status":"public","oa":1,"title":"Data from: Social transfer of pathogenic fungus promotes active immunisation in ant colonies","date_published":"2012-09-27T00:00:00Z","date_created":"2021-07-30T08:39:13Z","oa_version":"Published Version","main_file_link":[{"url":"https://doi.org/10.5061/dryad.sv37s","open_access":"1"}],"day":"27","author":[{"id":"46528076-F248-11E8-B48F-1D18A9856A87","last_name":"Konrad","first_name":"Matthias","full_name":"Konrad, Matthias"},{"first_name":"Meghan","full_name":"Vyleta, Meghan","last_name":"Vyleta","id":"418901AA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Theis, Fabian","first_name":"Fabian","last_name":"Theis"},{"first_name":"Miriam","full_name":"Stock, Miriam","id":"42462816-F248-11E8-B48F-1D18A9856A87","last_name":"Stock"},{"full_name":"Klatt, Martina","first_name":"Martina","last_name":"Klatt","id":"E60F29C6-E9AE-11E9-AF6E-D190C7302F38"},{"full_name":"Drescher, Verena","first_name":"Verena","last_name":"Drescher"},{"last_name":"Marr","first_name":"Carsten","full_name":"Marr, Carsten"},{"full_name":"Ugelvig, Line V","first_name":"Line V","id":"3DC97C8E-F248-11E8-B48F-1D18A9856A87","last_name":"Ugelvig","orcid":"0000-0003-1832-8883"},{"first_name":"Sylvia","full_name":"Cremer, Sylvia","orcid":"0000-0002-2193-3868","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","last_name":"Cremer"}],"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","month":"09"},{"status":"public","date_updated":"2025-09-30T08:15:49Z","year":"2012","related_material":{"record":[{"relation":"used_in_publication","id":"2926","status":"public"}]},"_id":"9757","publisher":"Dryad","type":"research_data_reference","date_created":"2021-07-30T12:31:31Z","date_published":"2012-12-14T00:00:00Z","title":"Data from: Ants disinfect fungus-exposed brood by oral uptake and spread of their poison","oa":1,"fulldoi":"https://doi.org/10.5061/dryad.61649","article_processing_charge":"No","abstract":[{"text":"To fight infectious diseases, host immune defences are employed at multiple levels. Sanitary behaviour, such as pathogen avoidance and removal, acts as a first line of defence to prevent infection [1] before activation of the physiological immune system. Insect societies have evolved a wide range of collective hygiene measures and intensive health care towards pathogen-exposed group members [2]. One of the most common behaviours is allogrooming, in which nestmates remove infectious particles from the body surfaces of exposed individuals [3]. Here we show that, in invasive garden ants, grooming of fungus-exposed brood is effective beyond the sheer mechanical removal of fungal conidiospores as it also includes chemical disinfection through the application of poison produced by the ants themselves. Formic acid is the main active component of the poison. It inhibits fungal growth of conidiospores remaining on the brood surface after grooming and also those collected in the mouth of the grooming ant. This dual function is achieved by uptake of the poison droplet into the mouth through acidopore self-grooming and subsequent application onto the infectious brood via brood grooming. This extraordinary behaviour extends current understanding of grooming and the establishment of social immunity in insect societies.","lang":"eng"}],"doi":"10.5061/dryad.61649","citation":{"apa":"Tragust, S., Mitteregger, B., Barone, V., Konrad, M., Ugelvig, L. V., &#38; Cremer, S. (2012). Data from: Ants disinfect fungus-exposed brood by oral uptake and spread of their poison. Dryad. <a href=\"https://doi.org/10.5061/dryad.61649\">https://doi.org/10.5061/dryad.61649</a>","mla":"Tragust, Simon, et al. <i>Data from: Ants Disinfect Fungus-Exposed Brood by Oral Uptake and Spread of Their Poison</i>. Dryad, 2012, doi:<a href=\"https://doi.org/10.5061/dryad.61649\">10.5061/dryad.61649</a>.","ista":"Tragust S, Mitteregger B, Barone V, Konrad M, Ugelvig LV, Cremer S. 2012. Data from: Ants disinfect fungus-exposed brood by oral uptake and spread of their poison, Dryad, <a href=\"https://doi.org/10.5061/dryad.61649\">10.5061/dryad.61649</a>.","ieee":"S. Tragust, B. Mitteregger, V. Barone, M. Konrad, L. V. Ugelvig, and S. Cremer, “Data from: Ants disinfect fungus-exposed brood by oral uptake and spread of their poison.” Dryad, 2012.","ama":"Tragust S, Mitteregger B, Barone V, Konrad M, Ugelvig LV, Cremer S. Data from: Ants disinfect fungus-exposed brood by oral uptake and spread of their poison. 2012. doi:<a href=\"https://doi.org/10.5061/dryad.61649\">10.5061/dryad.61649</a>","chicago":"Tragust, Simon, Barbara Mitteregger, Vanessa Barone, Matthias Konrad, Line V Ugelvig, and Sylvia Cremer. “Data from: Ants Disinfect Fungus-Exposed Brood by Oral Uptake and Spread of Their Poison.” Dryad, 2012. <a href=\"https://doi.org/10.5061/dryad.61649\">https://doi.org/10.5061/dryad.61649</a>.","short":"S. Tragust, B. Mitteregger, V. Barone, M. Konrad, L.V. Ugelvig, S. Cremer, (2012)."},"department":[{"_id":"SyCr"}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.5061/dryad.61649"}],"oa_version":"Published Version","month":"12","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","author":[{"last_name":"Tragust","id":"35A7A418-F248-11E8-B48F-1D18A9856A87","first_name":"Simon","full_name":"Tragust, Simon"},{"first_name":"Barbara","full_name":"Mitteregger, Barbara","id":"479DDAAC-E9CD-11E9-9B5F-82450873F7A1","last_name":"Mitteregger"},{"full_name":"Barone, Vanessa","first_name":"Vanessa","last_name":"Barone","id":"419EECCC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2676-3367"},{"full_name":"Konrad, Matthias","first_name":"Matthias","last_name":"Konrad","id":"46528076-F248-11E8-B48F-1D18A9856A87"},{"id":"3DC97C8E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1832-8883","last_name":"Ugelvig","first_name":"Line V","full_name":"Ugelvig, Line V"},{"last_name":"Cremer","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2193-3868","first_name":"Sylvia","full_name":"Cremer, Sylvia"}],"day":"14"},{"abstract":[{"text":"We propose a two-step procedure for estimating multiple migration rates in an approximate Bayesian computation (ABC) framework, accounting for global nuisance parameters. The approach is not limited to migration, but generally of interest for inference problems with multiple parameters and a modular structure (e.g. independent sets of demes or loci). We condition on a known, but complex demographic model of a spatially subdivided population, motivated by the reintroduction of Alpine ibex (Capra ibex) into Switzerland. In the first step, the global parameters ancestral mutation rate and male mating skew have been estimated for the whole population in Aeschbacher et al. (Genetics 2012; 192: 1027). In the second step, we estimate in this study the migration rates independently for clusters of demes putatively connected by migration. For large clusters (many migration rates), ABC faces the problem of too many summary statistics. We therefore assess by simulation if estimation per pair of demes is a valid alternative. We find that the trade-off between reduced dimensionality for the pairwise estimation on the one hand and lower accuracy due to the assumption of pairwise independence on the other depends on the number of migration rates to be inferred: the accuracy of the pairwise approach increases with the number of parameters, relative to the joint estimation approach. To distinguish between low and zero migration, we perform ABC-type model comparison between a model with migration and one without. Applying the approach to microsatellite data from Alpine ibex, we find no evidence for substantial gene flow via migration, except for one pair of demes in one direction.","lang":"eng"}],"doi":"10.5061/dryad.274b1","citation":{"ieee":"S. Aeschbacher, A. Futschik, and M. Beaumont, “Data from: Approximate Bayesian computation for modular inference problems with many parameters: the example of migration rates.” Dryad, 2012.","ista":"Aeschbacher S, Futschik A, Beaumont M. 2012. Data from: Approximate Bayesian computation for modular inference problems with many parameters: the example of migration rates, Dryad, <a href=\"https://doi.org/10.5061/dryad.274b1\">10.5061/dryad.274b1</a>.","chicago":"Aeschbacher, Simon, Andreas Futschik, and Mark Beaumont. “Data from: Approximate Bayesian Computation for Modular Inference Problems with Many Parameters: The Example of Migration Rates.” Dryad, 2012. <a href=\"https://doi.org/10.5061/dryad.274b1\">https://doi.org/10.5061/dryad.274b1</a>.","short":"S. Aeschbacher, A. Futschik, M. Beaumont, (2012).","ama":"Aeschbacher S, Futschik A, Beaumont M. Data from: Approximate Bayesian computation for modular inference problems with many parameters: the example of migration rates. 2012. doi:<a href=\"https://doi.org/10.5061/dryad.274b1\">10.5061/dryad.274b1</a>","mla":"Aeschbacher, Simon, et al. <i>Data from: Approximate Bayesian Computation for Modular Inference Problems with Many Parameters: The Example of Migration Rates</i>. Dryad, 2012, doi:<a href=\"https://doi.org/10.5061/dryad.274b1\">10.5061/dryad.274b1</a>.","apa":"Aeschbacher, S., Futschik, A., &#38; Beaumont, M. (2012). Data from: Approximate Bayesian computation for modular inference problems with many parameters: the example of migration rates. Dryad. <a href=\"https://doi.org/10.5061/dryad.274b1\">https://doi.org/10.5061/dryad.274b1</a>"},"article_processing_charge":"No","fulldoi":"https://doi.org/10.5061/dryad.274b1","department":[{"_id":"NiBa"}],"type":"research_data_reference","date_updated":"2025-09-29T13:25:35Z","status":"public","year":"2012","related_material":{"record":[{"status":"public","id":"2944","relation":"used_in_publication"}]},"_id":"9758","publisher":"Dryad","title":"Data from: Approximate Bayesian computation for modular inference problems with many parameters: the example of migration rates","date_published":"2012-11-14T00:00:00Z","oa":1,"date_created":"2021-07-30T12:36:39Z","oa_version":"Published Version","main_file_link":[{"open_access":"1","url":"https://doi.org/10.5061/dryad.274b1"}],"day":"14","month":"11","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","author":[{"last_name":"Aeschbacher","id":"2D35326E-F248-11E8-B48F-1D18A9856A87","first_name":"Simon","full_name":"Aeschbacher, Simon"},{"full_name":"Futschik, Andreas","first_name":"Andreas","last_name":"Futschik"},{"full_name":"Beaumont, Mark","first_name":"Mark","last_name":"Beaumont"}]}]