[{"oa":1,"citation":{"ieee":"X. Cao <i>et al.</i>, “Role of the DRM and CMT3 methyltransferases in RNA-directed DNA methylation,” <i>Current Biology</i>, vol. 13, no. 24. Elsevier, pp. 2212–2217, 2003.","apa":"Cao, X., Aufsatz, W., Zilberman, D., Mette, M. F., Huang, M. S., Matzke, M., &#38; Jacobsen, S. E. (2003). Role of the DRM and CMT3 methyltransferases in RNA-directed DNA methylation. <i>Current Biology</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.cub.2003.11.052\">https://doi.org/10.1016/j.cub.2003.11.052</a>","mla":"Cao, Xiaofeng, et al. “Role of the DRM and CMT3 Methyltransferases in RNA-Directed DNA Methylation.” <i>Current Biology</i>, vol. 13, no. 24, Elsevier, 2003, pp. 2212–17, doi:<a href=\"https://doi.org/10.1016/j.cub.2003.11.052\">10.1016/j.cub.2003.11.052</a>.","chicago":"Cao, Xiaofeng, Werner Aufsatz, Daniel Zilberman, M.Florian Mette, Michael S. Huang, Marjori Matzke, and Steven E. Jacobsen. “Role of the DRM and CMT3 Methyltransferases in RNA-Directed DNA Methylation.” <i>Current Biology</i>. Elsevier, 2003. <a href=\"https://doi.org/10.1016/j.cub.2003.11.052\">https://doi.org/10.1016/j.cub.2003.11.052</a>.","short":"X. Cao, W. Aufsatz, D. Zilberman, M.F. Mette, M.S. Huang, M. Matzke, S.E. Jacobsen, Current Biology 13 (2003) 2212–2217.","ama":"Cao X, Aufsatz W, Zilberman D, et al. Role of the DRM and CMT3 methyltransferases in RNA-directed DNA methylation. <i>Current Biology</i>. 2003;13(24):2212-2217. doi:<a href=\"https://doi.org/10.1016/j.cub.2003.11.052\">10.1016/j.cub.2003.11.052</a>","ista":"Cao X, Aufsatz W, Zilberman D, Mette MF, Huang MS, Matzke M, Jacobsen SE. 2003. Role of the DRM and CMT3 methyltransferases in RNA-directed DNA methylation. Current Biology. 13(24), 2212–2217."},"department":[{"_id":"DaZi"}],"publication":"Current Biology","day":"16","scopus_import":"1","date_created":"2021-06-07T10:43:02Z","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","volume":13,"intvolume":"        13","pmid":1,"extern":"1","abstract":[{"lang":"eng","text":"RNA interference is a conserved process in which double-stranded RNA is processed into 21–25 nucleotide siRNAs that trigger posttranscriptional gene silencing. In addition, plants display a phenomenon termed RNA-directed DNA methylation (RdDM) in which DNA with sequence identity to silenced RNA is de novo methylated at its cytosine residues. This methylation is not only at canonical CpG sites but also at cytosines in CpNpG and asymmetric sequence contexts. In this report, we study the role of the DRM and CMT3 DNA methyltransferase genes in the initiation and maintenance of RdDM. Neither drm nor cmt3 mutants affected the maintenance of preestablished RNA-directed CpG methylation. However, drm mutants showed a nearly complete loss of asymmetric methylation and a partial loss of CpNpG methylation. The remaining asymmetric and CpNpG methylation was dependent on the activity of CMT3, showing that DRM and CMT3 act redundantly to maintain non-CpG methylation. These DNA methyltransferases appear to act downstream of siRNAs, since drm1 drm2 cmt3 triple mutants show a lack of non-CpG methylation but elevated levels of siRNAs. Finally, we demonstrate that DRM activity is required for the initial establishment of RdDM in all sequence contexts including CpG, CpNpG, and asymmetric sites."}],"publication_status":"published","oa_version":"Published Version","doi":"10.1016/j.cub.2003.11.052","publisher":"Elsevier","year":"2003","status":"public","title":"Role of the DRM and CMT3 methyltransferases in RNA-directed DNA methylation","author":[{"last_name":"Cao","first_name":"Xiaofeng","full_name":"Cao, Xiaofeng"},{"full_name":"Aufsatz, Werner","first_name":"Werner","last_name":"Aufsatz"},{"id":"6973db13-dd5f-11ea-814e-b3e5455e9ed1","full_name":"Zilberman, Daniel","first_name":"Daniel","last_name":"Zilberman","orcid":"0000-0002-0123-8649"},{"full_name":"Mette, M.Florian","first_name":"M.Florian","last_name":"Mette"},{"first_name":"Michael S.","last_name":"Huang","full_name":"Huang, Michael S."},{"last_name":"Matzke","first_name":"Marjori","full_name":"Matzke, Marjori"},{"first_name":"Steven E.","last_name":"Jacobsen","full_name":"Jacobsen, Steven E."}],"main_file_link":[{"url":"https://doi.org/10.1016/j.cub.2003.11.052","open_access":"1"}],"type":"journal_article","quality_controlled":"1","date_published":"2003-12-16T00:00:00Z","language":[{"iso":"eng"}],"page":"2212-2217","issue":"24","article_type":"original","external_id":{"pmid":["14680640"]},"date_updated":"2021-12-14T08:41:38Z","publication_identifier":{"eissn":["1879-0445"],"issn":["0960-9822"]},"month":"12","article_processing_charge":"No","_id":"9495"},{"date_updated":"2023-02-21T16:32:40Z","extern":"1","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2003-05-01T00:00:00Z","date_created":"2022-08-16T08:55:05Z","quality_controlled":"1","_id":"11860","article_processing_charge":"No","abstract":[{"lang":"eng","text":"Many daily activities present information in the form of a stream of text, and often people can benefit from additional information on the topic discussed. TV broadcast news can be treated as one such stream of text; in this paper we discuss finding news articles on the web that are relevant to news currently being broadcast.We evaluated a variety of algorithms for this problem, looking at the impact of inverse document frequency, stemming, compounds, history, and query length on the relevance and coverage of news articles returned in real time during a broadcast. We also evaluated several postprocessing techniques for improving the precision, including reranking using additional terms, reranking by document similarity, and filtering on document similarity. For the best algorithm, 84%-91% of the articles found were relevant, with at least 64% of the articles being on the exact topic of the broadcast. In addition, a relevant article was found for at least 70% of the topics."}],"month":"05","publication_status":"published","publication_identifier":{"isbn":["978-158113680-7"]},"article_number":"1-10","title":"Query-free news search","year":"2003","publication":"Proceedings of the 12th international conference on World Wide Web","status":"public","publisher":"Association for Computing Machinery","doi":"10.1145/775152.775154","citation":{"short":"M.H. Henzinger, B.-W. Chang, B. Milch, S. Brin, in:, Proceedings of the 12th International Conference on World Wide Web, Association for Computing Machinery, 2003.","ista":"Henzinger MH, Chang B-W, Milch B, Brin S. 2003. Query-free news search. Proceedings of the 12th international conference on World Wide Web. WWW: International Conference on World Wide Web, 1–10.","ama":"Henzinger MH, Chang B-W, Milch B, Brin S. Query-free news search. In: <i>Proceedings of the 12th International Conference on World Wide Web</i>. Association for Computing Machinery; 2003. doi:<a href=\"https://doi.org/10.1145/775152.775154\">10.1145/775152.775154</a>","mla":"Henzinger, Monika H., et al. “Query-Free News Search.” <i>Proceedings of the 12th International Conference on World Wide Web</i>, 1–10, Association for Computing Machinery, 2003, doi:<a href=\"https://doi.org/10.1145/775152.775154\">10.1145/775152.775154</a>.","chicago":"Henzinger, Monika H, Bay-Wei Chang, Brian Milch, and Sergey Brin. “Query-Free News Search.” In <i>Proceedings of the 12th International Conference on World Wide Web</i>. Association for Computing Machinery, 2003. <a href=\"https://doi.org/10.1145/775152.775154\">https://doi.org/10.1145/775152.775154</a>.","apa":"Henzinger, M. H., Chang, B.-W., Milch, B., &#38; Brin, S. (2003). Query-free news search. In <i>Proceedings of the 12th international conference on World Wide Web</i>. Budapest, Hungary: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/775152.775154\">https://doi.org/10.1145/775152.775154</a>","ieee":"M. H. Henzinger, B.-W. Chang, B. Milch, and S. Brin, “Query-free news search,” in <i>Proceedings of the 12th international conference on World Wide Web</i>, Budapest, Hungary, 2003."},"oa_version":"None","day":"01","scopus_import":"1","conference":{"start_date":"2003-05-20","end_date":"2003-05-24","name":"WWW: International Conference on World Wide Web","location":"Budapest, Hungary"},"type":"conference","related_material":{"record":[{"id":"11904","relation":"later_version","status":"public"}]},"author":[{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H","first_name":"Monika H","last_name":"Henzinger","orcid":"0000-0002-5008-6530"},{"last_name":"Chang","first_name":"Bay-Wei","full_name":"Chang, Bay-Wei"},{"first_name":"Brian","last_name":"Milch","full_name":"Milch, Brian"},{"first_name":"Sergey","last_name":"Brin","full_name":"Brin, Sergey"}]},{"oa_version":"None","year":"2003","status":"public","publication":"21st annual international ACM SIGIR conference on Research and development in information retrieval","title":"Improved algorithms for topic distillation in a hyperlinked environment","citation":{"chicago":"Bharat, Krishna, and Monika H Henzinger. “Improved Algorithms for Topic Distillation in a Hyperlinked Environment.” In <i>21st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval</i>, 104–111. Association for Computing Machinery, 2003. <a href=\"https://doi.org/10.1145/290941.290972\">https://doi.org/10.1145/290941.290972</a>.","mla":"Bharat, Krishna, and Monika H. Henzinger. “Improved Algorithms for Topic Distillation in a Hyperlinked Environment.” <i>21st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval</i>, Association for Computing Machinery, 2003, pp. 104–111, doi:<a href=\"https://doi.org/10.1145/290941.290972\">10.1145/290941.290972</a>.","ieee":"K. Bharat and M. H. Henzinger, “Improved algorithms for topic distillation in a hyperlinked environment,” in <i>21st annual international ACM SIGIR conference on Research and development in information retrieval</i>, Melbourne, Australia, 2003, pp. 104–111.","apa":"Bharat, K., &#38; Henzinger, M. H. (2003). Improved algorithms for topic distillation in a hyperlinked environment. In <i>21st annual international ACM SIGIR conference on Research and development in information retrieval</i> (pp. 104–111). Melbourne, Australia: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/290941.290972\">https://doi.org/10.1145/290941.290972</a>","ista":"Bharat K, Henzinger MH. 2003. Improved algorithms for topic distillation in a hyperlinked environment. 21st annual international ACM SIGIR conference on Research and development in information retrieval. SIGIR: International Conference on Research and Development in Information Retrieval, 104–111.","ama":"Bharat K, Henzinger MH. Improved algorithms for topic distillation in a hyperlinked environment. In: <i>21st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval</i>. Association for Computing Machinery; 2003:104–111. doi:<a href=\"https://doi.org/10.1145/290941.290972\">10.1145/290941.290972</a>","short":"K. Bharat, M.H. Henzinger, in:, 21st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, Association for Computing Machinery, 2003, pp. 104–111."},"doi":"10.1145/290941.290972","publisher":"Association for Computing Machinery","author":[{"full_name":"Bharat, Krishna","last_name":"Bharat","first_name":"Krishna"},{"orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","last_name":"Henzinger","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"}],"scopus_import":"1","day":"01","conference":{"location":"Melbourne, Australia","end_date":"1998-08-28","name":"SIGIR: International Conference on Research and Development in Information Retrieval","start_date":"1998-08-24"},"type":"conference","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"date_published":"2003-08-01T00:00:00Z","date_created":"2022-08-17T08:56:18Z","quality_controlled":"1","date_updated":"2023-02-17T14:47:44Z","extern":"1","page":"104–111","publication_identifier":{"isbn":["978-1-58113-015-7"],"issn":["01635840"]},"_id":"11897","publication_status":"published","abstract":[{"lang":"eng","text":"This paper addresses the problem of topic distillation on the World Wide Web, namely, given a typical user query to find quality documents related to the query topic. Connectivity analysis has been shown to be useful in identifying high quality pages within a topic specific graph of hyperlinked documents. The essence of our approach is to augment a previous connectivity analysis based algorithm with content analysis. We identify three problems with the existing approach and devise algorithms to tackle them. The results of a user evaluation are reported that show an improvement of precision at 10\r\ndocuments by at least 45% over pure connectivity analysis. "}],"month":"08","article_processing_charge":"No"},{"year":"2003","title":"Challenges in web search engines","publication":"18th International Joint Conference on Artificial Intelligence","status":"public","publisher":"Association for Computing Machinery","citation":{"ista":"Henzinger MH, Motwani R, Silverstein C. 2003. Challenges in web search engines. 18th International Joint Conference on Artificial Intelligence. IJCAI: International Joint Conference on Artificial Intelligence, 1573–1579.","ama":"Henzinger MH, Motwani R, Silverstein C. Challenges in web search engines. In: <i>18th International Joint Conference on Artificial Intelligence</i>. Association for Computing Machinery; 2003:1573-1579.","short":"M.H. Henzinger, R. Motwani, C. Silverstein, in:, 18th International Joint Conference on Artificial Intelligence, Association for Computing Machinery, 2003, pp. 1573–1579.","apa":"Henzinger, M. H., Motwani, R., &#38; Silverstein, C. (2003). Challenges in web search engines. In <i>18th International Joint Conference on Artificial Intelligence</i> (pp. 1573–1579). Acapulco, Mexico: Association for Computing Machinery.","ieee":"M. H. Henzinger, R. Motwani, and C. Silverstein, “Challenges in web search engines,” in <i>18th International Joint Conference on Artificial Intelligence</i>, Acapulco, Mexico, 2003, pp. 1573–1579.","chicago":"Henzinger, Monika H, Rajeev Motwani, and Craig Silverstein. “Challenges in Web Search Engines.” In <i>18th International Joint Conference on Artificial Intelligence</i>, 1573–79. Association for Computing Machinery, 2003.","mla":"Henzinger, Monika H., et al. “Challenges in Web Search Engines.” <i>18th International Joint Conference on Artificial Intelligence</i>, Association for Computing Machinery, 2003, pp. 1573–79."},"oa":1,"oa_version":"Published Version","day":"01","scopus_import":"1","type":"conference","conference":{"location":"Acapulco, Mexico","end_date":"2003-08-15","name":"IJCAI: International Joint Conference on Artificial Intelligence","start_date":"2003-08-09"},"main_file_link":[{"url":"https://www.ijcai.org/Proceedings/03/Papers/278.pdf","open_access":"1"}],"author":[{"orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H","last_name":"Henzinger","first_name":"Monika H"},{"full_name":"Motwani, Rajeev","last_name":"Motwani","first_name":"Rajeev"},{"full_name":"Silverstein, Craig","first_name":"Craig","last_name":"Silverstein"}],"date_updated":"2023-02-09T12:05:25Z","page":"1573-1579","extern":"1","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2022-08-18T06:40:02Z","date_published":"2003-08-01T00:00:00Z","quality_controlled":"1","_id":"11909","article_processing_charge":"No","publication_status":"published","month":"08","abstract":[{"lang":"eng","text":"This article presents a high-level discussion of some problems that are unique to web search engines. The goal is to raise awareness and stimulate research in these areas."}],"publication_identifier":{"issn":["1045-0823"]}},{"date_updated":"2021-01-12T07:43:23Z","page":"277 - 288","extern":"1","volume":166,"intvolume":"       166","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T12:03:16Z","date_published":"2003-01-01T00:00:00Z","_id":"3425","article_processing_charge":"No","month":"01","publication_status":"published","status":"public","title":"3D supernova collapse calculations","year":"2003","publisher":"Springer","citation":{"ieee":"M. T. Bollenbach, T. Strother, and W. Bauer, “3D supernova collapse calculations,” presented at the NATO ASI on Structure and Dynamics of Elementary Matter, 2003, vol. 166, pp. 277–288.","apa":"Bollenbach, M. T., Strother, T., &#38; Bauer, W. (2003). 3D supernova collapse calculations (Vol. 166, pp. 277–288). Presented at the NATO ASI on Structure and Dynamics of Elementary Matter, Springer. <a href=\"https://doi.org/10.1007/978-1-4020-2705-5_21\">https://doi.org/10.1007/978-1-4020-2705-5_21</a>","chicago":"Bollenbach, Mark Tobias, T. Strother, and Wolfgang Bauer. “3D Supernova Collapse Calculations,” 166:277–88. Springer, 2003. <a href=\"https://doi.org/10.1007/978-1-4020-2705-5_21\">https://doi.org/10.1007/978-1-4020-2705-5_21</a>.","mla":"Bollenbach, Mark Tobias, et al. <i>3D Supernova Collapse Calculations</i>. Vol. 166, Springer, 2003, pp. 277–88, doi:<a href=\"https://doi.org/10.1007/978-1-4020-2705-5_21\">10.1007/978-1-4020-2705-5_21</a>.","ama":"Bollenbach MT, Strother T, Bauer W. 3D supernova collapse calculations. In: Vol 166. Springer; 2003:277-288. doi:<a href=\"https://doi.org/10.1007/978-1-4020-2705-5_21\">10.1007/978-1-4020-2705-5_21</a>","ista":"Bollenbach MT, Strother T, Bauer W. 2003. 3D supernova collapse calculations. NATO ASI on Structure and Dynamics of Elementary Matter, Nato Science Series II, vol. 166, 277–288.","short":"M.T. Bollenbach, T. Strother, W. Bauer, in:, Springer, 2003, pp. 277–288."},"doi":"10.1007/978-1-4020-2705-5_21","publist_id":"2976","oa_version":"None","alternative_title":["Nato Science Series II"],"day":"01","type":"conference","conference":{"name":"NATO ASI on Structure and Dynamics of Elementary Matter"},"author":[{"id":"3E6DB97A-F248-11E8-B48F-1D18A9856A87","first_name":"Mark Tobias","last_name":"Bollenbach","full_name":"Bollenbach, Mark Tobias","orcid":"0000-0003-4398-476X"},{"last_name":"Strother","first_name":"T.","full_name":"Strother, T."},{"first_name":"Wolfgang","last_name":"Bauer","full_name":"Bauer, Wolfgang"}]},{"day":"01","type":"book_chapter","author":[{"first_name":"Peter M","last_name":"Jonas","full_name":"Peter Jonas","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5001-4804"},{"last_name":"Unsicker","first_name":"Klaus","full_name":"Unsicker, Klaus"}],"year":"2003","title":"Molekulare und zelluläre Grundlagen des Nervensystems.","status":"public","publication":"Lehrbuch Vorklinik","publisher":"Deutscher Ärzte Verlag","citation":{"mla":"Jonas, Peter M., and Klaus Unsicker. “Molekulare Und Zelluläre Grundlagen Des Nervensystems.” <i>Lehrbuch Vorklinik</i>, edited by R. Schmidt, vol. B, Deutscher Ärzte Verlag, 2003, pp. 3–26.","chicago":"Jonas, Peter M, and Klaus Unsicker. “Molekulare Und Zelluläre Grundlagen Des Nervensystems.” In <i>Lehrbuch Vorklinik</i>, edited by R. Schmidt, B:3–26. Deutscher Ärzte Verlag, 2003.","ieee":"P. M. Jonas and K. Unsicker, “Molekulare und zelluläre Grundlagen des Nervensystems.,” in <i>Lehrbuch Vorklinik</i>, vol. B, R. Schmidt, Ed. Deutscher Ärzte Verlag, 2003, pp. 3–26.","apa":"Jonas, P. M., &#38; Unsicker, K. (2003). Molekulare und zelluläre Grundlagen des Nervensystems. In R. Schmidt (Ed.), <i>Lehrbuch Vorklinik</i> (Vol. B, pp. 3–26). Deutscher Ärzte Verlag.","short":"P.M. Jonas, K. Unsicker, in:, R. Schmidt (Ed.), Lehrbuch Vorklinik, Deutscher Ärzte Verlag, 2003, pp. 3–26.","ista":"Jonas PM, Unsicker K. 2003.Molekulare und zelluläre Grundlagen des Nervensystems. In: Lehrbuch Vorklinik. vol. B, 3–26.","ama":"Jonas PM, Unsicker K. Molekulare und zelluläre Grundlagen des Nervensystems. In: Schmidt R, ed. <i>Lehrbuch Vorklinik</i>. Vol B. Deutscher Ärzte Verlag; 2003:3-26."},"publist_id":"2929","_id":"3458","month":"01","publication_status":"published","editor":[{"full_name":"Schmidt, R. F.","first_name":"R.","last_name":"Schmidt"}],"date_updated":"2021-01-12T07:43:35Z","page":"3 - 26","extern":1,"volume":"B","quality_controlled":0,"date_created":"2018-12-11T12:03:26Z","date_published":"2003-01-01T00:00:00Z"},{"status":"public","publication":"Nature","title":"Organization of cell assemblies in the hippocampus","year":"2003","citation":{"short":"K. Harris, J.L. Csicsvari, H. Hirase, G. Dragoi, G. Buzsáki, Nature 424 (2003) 552–556.","ama":"Harris K, Csicsvari JL, Hirase H, Dragoi G, Buzsáki G. Organization of cell assemblies in the hippocampus. <i>Nature</i>. 2003;424(6948):552-556. doi:<a href=\"https://doi.org/0.1038/nature01834\">0.1038/nature01834</a>","ista":"Harris K, Csicsvari JL, Hirase H, Dragoi G, Buzsáki G. 2003. Organization of cell assemblies in the hippocampus. Nature. 424(6948), 552–556.","mla":"Harris, Kenneth, et al. “Organization of Cell Assemblies in the Hippocampus.” <i>Nature</i>, vol. 424, no. 6948, Nature Publishing Group, 2003, pp. 552–56, doi:<a href=\"https://doi.org/0.1038/nature01834\">0.1038/nature01834</a>.","chicago":"Harris, Kenneth, Jozsef L Csicsvari, Hajima Hirase, George Dragoi, and György Buzsáki. “Organization of Cell Assemblies in the Hippocampus.” <i>Nature</i>. Nature Publishing Group, 2003. <a href=\"https://doi.org/0.1038/nature01834\">https://doi.org/0.1038/nature01834</a>.","ieee":"K. Harris, J. L. Csicsvari, H. Hirase, G. Dragoi, and G. Buzsáki, “Organization of cell assemblies in the hippocampus,” <i>Nature</i>, vol. 424, no. 6948. Nature Publishing Group, pp. 552–556, 2003.","apa":"Harris, K., Csicsvari, J. L., Hirase, H., Dragoi, G., &#38; Buzsáki, G. (2003). Organization of cell assemblies in the hippocampus. <i>Nature</i>. Nature Publishing Group. <a href=\"https://doi.org/0.1038/nature01834\">https://doi.org/0.1038/nature01834</a>"},"doi":"0.1038/nature01834","publisher":"Nature Publishing Group","publist_id":"2859","day":"31","type":"journal_article","author":[{"full_name":"Harris, Kenneth D","last_name":"Harris","first_name":"Kenneth"},{"orcid":"0000-0002-5193-4036","id":"3FA14672-F248-11E8-B48F-1D18A9856A87","last_name":"Csicsvari","first_name":"Jozsef L","full_name":"Jozsef Csicsvari"},{"last_name":"Hirase","first_name":"Hajima","full_name":"Hirase, Hajima"},{"full_name":"Dragoi, George","last_name":"Dragoi","first_name":"George"},{"last_name":"Buzsáki","first_name":"György","full_name":"Buzsáki, György"}],"date_updated":"2021-01-12T07:44:04Z","page":"552 - 556","extern":1,"issue":"6948","volume":424,"intvolume":"       424","quality_controlled":0,"date_created":"2018-12-11T12:03:47Z","date_published":"2003-07-31T00:00:00Z","_id":"3526","abstract":[{"text":"Neurons can produce action potentials with high temporal precision(1). A fundamental issue is whether, and how, this capability is used in information processing. According to the `cell assembly' hypothesis, transient synchrony of anatomically distributed groups of neurons underlies processing of both external sensory input and internal cognitive mechanisms(2-4). Accordingly, neuron populations should be arranged into groups whose synchrony exceeds that predicted by common modulation by sensory input. Here we find that the spike times of hippocampal pyramidal cells can be predicted more accurately by using the spike times of simultaneously recorded neurons in addition to the animals location in space. This improvement remained when the spatial prediction was refined with a spatially dependent theta phase modulation(5-8). The time window in which spike times are best predicted from simultaneous peer activity is 10-30 ms, suggesting that cell assemblies are synchronized at this timescale. Because this temporal window matches the membrane time constant of pyramidal neurons(9), the period of the hippocampal gamma oscillation(10) and the time window for synaptic plasticity(11), we propose that cooperative activity at this timescale is optimal for information transmission and storage in cortical circuits.","lang":"eng"}],"publication_status":"published","month":"07"},{"author":[{"last_name":"Csicsvari","first_name":"Jozsef L","full_name":"Jozsef Csicsvari","id":"3FA14672-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-5193-4036"},{"first_name":"Brian","last_name":"Jamieson","full_name":"Jamieson, Brian G"},{"first_name":"Kensall","last_name":"Wise","full_name":"Wise, Kensall D"},{"first_name":"György","last_name":"Buzsáki","full_name":"Buzsáki, György"}],"type":"journal_article","day":"01","publist_id":"2857","publisher":"Elsevier","citation":{"ama":"Csicsvari JL, Jamieson B, Wise K, Buzsáki G. Mechanisms of gamma oscillations in the hippocampus of the behaving rat. <i>Neuron</i>. 2003;37(2):311-322. doi:<a href=\"https://doi.org/10.1016/S0896-6273(02)01169-8\">10.1016/S0896-6273(02)01169-8</a>","ista":"Csicsvari JL, Jamieson B, Wise K, Buzsáki G. 2003. Mechanisms of gamma oscillations in the hippocampus of the behaving rat. Neuron. 37(2), 311–322.","short":"J.L. Csicsvari, B. Jamieson, K. Wise, G. Buzsáki, Neuron 37 (2003) 311–322.","chicago":"Csicsvari, Jozsef L, Brian Jamieson, Kensall Wise, and György Buzsáki. “Mechanisms of Gamma Oscillations in the Hippocampus of the Behaving Rat.” <i>Neuron</i>. Elsevier, 2003. <a href=\"https://doi.org/10.1016/S0896-6273(02)01169-8\">https://doi.org/10.1016/S0896-6273(02)01169-8</a>.","mla":"Csicsvari, Jozsef L., et al. “Mechanisms of Gamma Oscillations in the Hippocampus of the Behaving Rat.” <i>Neuron</i>, vol. 37, no. 2, Elsevier, 2003, pp. 311–22, doi:<a href=\"https://doi.org/10.1016/S0896-6273(02)01169-8\">10.1016/S0896-6273(02)01169-8</a>.","ieee":"J. L. Csicsvari, B. Jamieson, K. Wise, and G. Buzsáki, “Mechanisms of gamma oscillations in the hippocampus of the behaving rat,” <i>Neuron</i>, vol. 37, no. 2. Elsevier, pp. 311–322, 2003.","apa":"Csicsvari, J. L., Jamieson, B., Wise, K., &#38; Buzsáki, G. (2003). Mechanisms of gamma oscillations in the hippocampus of the behaving rat. <i>Neuron</i>. Elsevier. <a href=\"https://doi.org/10.1016/S0896-6273(02)01169-8\">https://doi.org/10.1016/S0896-6273(02)01169-8</a>"},"doi":"10.1016/S0896-6273(02)01169-8","publication":"Neuron","year":"2003","status":"public","title":"Mechanisms of gamma oscillations in the hippocampus of the behaving rat","abstract":[{"text":"Gamma frequency oscillations (30-100 Hz) have been suggested to underlie various cognitive and motor functions. Here, we examine the generation of gamma oscillation currents in the hippocampus, using two-dimensional, 96-site silicon probes. Two gamma generators were identified, one in the dentate gyrus and another in the CA3-CA1 regions. The coupling strength between the two oscillators varied during both theta and nontheta states. Both pyramidal cells and interneurons were phase-locked to gamma waves. Anatomical connectivity, rather than physical distance, determined the coupling strength of the oscillating neurons. CA3 pyramidal neurons discharged CA3 and CA1 interneurons at latencies indicative of monosynaptic connections. Intrahippocampal gamma oscillation emerges in the CA3 recurrent system, which entrains the CA1 region via its interneurons.","lang":"eng"}],"publication_status":"published","month":"01","_id":"3528","date_created":"2018-12-11T12:03:48Z","date_published":"2003-01-01T00:00:00Z","quality_controlled":0,"volume":37,"intvolume":"        37","page":"311 - 322","issue":"2","extern":1,"date_updated":"2021-01-12T07:44:05Z"},{"publist_id":"2856","publisher":"American Physiological Society","doi":"10.1152/jn.00116.2003","citation":{"ista":"Csicsvari JL, Henze D, Jamieson B, Harris K, Sirota A, Bartho P, Wise K, Buzsáki G. 2003. Massively parallel recording of unit and local field potentials with silicon-based electrodes. Journal of Neurophysiology. 90(2), 1314–1323.","ama":"Csicsvari JL, Henze D, Jamieson B, et al. Massively parallel recording of unit and local field potentials with silicon-based electrodes. <i>Journal of Neurophysiology</i>. 2003;90(2):1314-1323. doi:<a href=\"https://doi.org/10.1152/jn.00116.2003\">10.1152/jn.00116.2003</a>","short":"J.L. Csicsvari, D. Henze, B. Jamieson, K. Harris, A. Sirota, P. Bartho, K. Wise, G. Buzsáki, Journal of Neurophysiology 90 (2003) 1314–1323.","chicago":"Csicsvari, Jozsef L, Darrell Henze, Brian Jamieson, Kenneth Harris, Anton Sirota, Peter Bartho, Kensall Wise, and György Buzsáki. “Massively Parallel Recording of Unit and Local Field Potentials with Silicon-Based Electrodes.” <i>Journal of Neurophysiology</i>. American Physiological Society, 2003. <a href=\"https://doi.org/10.1152/jn.00116.2003\">https://doi.org/10.1152/jn.00116.2003</a>.","mla":"Csicsvari, Jozsef L., et al. “Massively Parallel Recording of Unit and Local Field Potentials with Silicon-Based Electrodes.” <i>Journal of Neurophysiology</i>, vol. 90, no. 2, American Physiological Society, 2003, pp. 1314–23, doi:<a href=\"https://doi.org/10.1152/jn.00116.2003\">10.1152/jn.00116.2003</a>.","ieee":"J. L. Csicsvari <i>et al.</i>, “Massively parallel recording of unit and local field potentials with silicon-based electrodes,” <i>Journal of Neurophysiology</i>, vol. 90, no. 2. American Physiological Society, pp. 1314–1323, 2003.","apa":"Csicsvari, J. L., Henze, D., Jamieson, B., Harris, K., Sirota, A., Bartho, P., … Buzsáki, G. (2003). Massively parallel recording of unit and local field potentials with silicon-based electrodes. <i>Journal of Neurophysiology</i>. American Physiological Society. <a href=\"https://doi.org/10.1152/jn.00116.2003\">https://doi.org/10.1152/jn.00116.2003</a>"},"title":"Massively parallel recording of unit and local field potentials with silicon-based electrodes","year":"2003","publication":"Journal of Neurophysiology","status":"public","author":[{"id":"3FA14672-F248-11E8-B48F-1D18A9856A87","first_name":"Jozsef L","last_name":"Csicsvari","full_name":"Jozsef Csicsvari","orcid":"0000-0002-5193-4036"},{"first_name":"Darrell","last_name":"Henze","full_name":"Henze, Darrell A"},{"last_name":"Jamieson","first_name":"Brian","full_name":"Jamieson, Brian G"},{"last_name":"Harris","first_name":"Kenneth","full_name":"Harris, Kenneth D"},{"full_name":"Sirota, Anton M","first_name":"Anton","last_name":"Sirota"},{"full_name":"Bartho, Peter","first_name":"Peter","last_name":"Bartho"},{"last_name":"Wise","first_name":"Kensall","full_name":"Wise, Kensall D"},{"last_name":"Buzsáki","first_name":"György","full_name":"Buzsáki, György"}],"type":"journal_article","day":"01","date_published":"2003-08-01T00:00:00Z","date_created":"2018-12-11T12:03:48Z","quality_controlled":0,"intvolume":"        90","volume":90,"extern":1,"issue":"2","page":"1314 - 1323","date_updated":"2021-01-12T07:44:05Z","month":"08","publication_status":"published","abstract":[{"text":"Parallel recording of neuronal activity in the behaving animal is a prerequisite for our understanding of neuronal representation and storage of information. Here we describe the development of micro-machined silicon microelectrode arrays for unit and local field recordings. The two-dimensional probes with 96 or 64 recording sites provided high-density recording of unit and field activity with minimal tissue displacement or damage. The on-chip active circuit eliminated movement and other artifacts and greatly reduced the weight of the headgear. The precise geometry of the recording tips allowed for the estimation of the spatial location of the recorded neurons and for high-resolution estimation of extracellular current source density. Action potentials could be simultaneously recorded from the soma and dendrites of the same neurons. Silicon technology is a promising approach for high-density, high-resolution sampling of neuronal activity in both basic research and prosthetic devices.","lang":"eng"}],"_id":"3529"},{"date_updated":"2021-01-12T07:44:09Z","extern":1,"page":"201 - 211","issue":"1","volume":116,"intvolume":"       116","date_created":"2018-12-11T12:03:50Z","quality_controlled":0,"date_published":"2003-01-15T00:00:00Z","_id":"3536","month":"01","publication_status":"published","abstract":[{"text":"Genetic engineering of the mouse brain allows investigators to address novel hypotheses in vivo. Because of the paucity of information on the network patterns of the mouse hippocampus, we investigated the electrical patterns in the behaving animal using multisite silicon probes and wire tetrodes. Theta (6-9 Hz) and gamma (40-100 Hz) oscillations were present during exploration and rapid eye movement sleep. Gamma power and theta power were comodulated and gamma power varied as a function of the theta cycle. Pyramidal cells and putative interneurons were phase-locked to theta oscillations. During immobility, consummatory behaviors and slow-wave sleep, sharp waves were present in cornu ammonis region CA1 of the hippocampus stratum radiatum associated with 140-200-Hz “ripples” in the pyramidal cell layer and population burst of CA1 neurons. In the hilus, large-amplitude “dentate spikes” occurred in association with increased discharge of hilar neurons. The amplitude of field patterns was larger in the mouse than in the rat, likely reflecting the higher neuron density in a smaller brain. We suggest that the main hippocampal network patterns are mediated by similar pathways and mechanisms in mouse and rat. ","lang":"eng"}],"status":"public","title":"Hippocampal network patterns of activity in the mouse","publication":"Neuroscience","year":"2003","doi":"10.1016/S0306-4522(02)00669-3","citation":{"ieee":"G. Buzsáki, D. Buhl, K. Harris, J. L. Csicsvari, B. Czéh, and A. Morozov, “Hippocampal network patterns of activity in the mouse,” <i>Neuroscience</i>, vol. 116, no. 1. Elsevier, pp. 201–211, 2003.","apa":"Buzsáki, G., Buhl, D., Harris, K., Csicsvari, J. L., Czéh, B., &#38; Morozov, A. (2003). Hippocampal network patterns of activity in the mouse. <i>Neuroscience</i>. Elsevier. <a href=\"https://doi.org/10.1016/S0306-4522(02)00669-3\">https://doi.org/10.1016/S0306-4522(02)00669-3</a>","mla":"Buzsáki, György, et al. “Hippocampal Network Patterns of Activity in the Mouse.” <i>Neuroscience</i>, vol. 116, no. 1, Elsevier, 2003, pp. 201–11, doi:<a href=\"https://doi.org/10.1016/S0306-4522(02)00669-3\">10.1016/S0306-4522(02)00669-3</a>.","chicago":"Buzsáki, György, Derek Buhl, Kenneth Harris, Jozsef L Csicsvari, Boldizsár Czéh, and Alexei Morozov. “Hippocampal Network Patterns of Activity in the Mouse.” <i>Neuroscience</i>. Elsevier, 2003. <a href=\"https://doi.org/10.1016/S0306-4522(02)00669-3\">https://doi.org/10.1016/S0306-4522(02)00669-3</a>.","short":"G. Buzsáki, D. Buhl, K. Harris, J.L. Csicsvari, B. Czéh, A. Morozov, Neuroscience 116 (2003) 201–211.","ista":"Buzsáki G, Buhl D, Harris K, Csicsvari JL, Czéh B, Morozov A. 2003. Hippocampal network patterns of activity in the mouse. Neuroscience. 116(1), 201–211.","ama":"Buzsáki G, Buhl D, Harris K, Csicsvari JL, Czéh B, Morozov A. Hippocampal network patterns of activity in the mouse. <i>Neuroscience</i>. 2003;116(1):201-211. doi:<a href=\"https://doi.org/10.1016/S0306-4522(02)00669-3\">10.1016/S0306-4522(02)00669-3</a>"},"publisher":"Elsevier","publist_id":"2849","day":"15","type":"journal_article","author":[{"first_name":"György","last_name":"Buzsáki","full_name":"Buzsáki, György"},{"last_name":"Buhl","first_name":"Derek","full_name":"Buhl, Derek L"},{"first_name":"Kenneth","last_name":"Harris","full_name":"Harris, Kenneth D"},{"orcid":"0000-0002-5193-4036","id":"3FA14672-F248-11E8-B48F-1D18A9856A87","last_name":"Csicsvari","first_name":"Jozsef L","full_name":"Jozsef Csicsvari"},{"full_name":"Czéh, Boldizsár","first_name":"Boldizsár","last_name":"Czéh"},{"last_name":"Morozov","first_name":"Alexei","full_name":"Morozov, Alexei"}]},{"day":"18","type":"journal_article","author":[{"full_name":"Sirota, Anton M","first_name":"Anton","last_name":"Sirota"},{"id":"3FA14672-F248-11E8-B48F-1D18A9856A87","first_name":"Jozsef L","last_name":"Csicsvari","full_name":"Jozsef Csicsvari","orcid":"0000-0002-5193-4036"},{"full_name":"Buhl, Derek L","first_name":"Derek","last_name":"Buhl"},{"full_name":"Buzsáki, György","last_name":"Buzsáki","first_name":"György"}],"year":"2003","title":"Communication between neocortex and hippocampus during sleep in rodents","status":"public","publication":"PNAS","publisher":"National Academy of Sciences","doi":"10.1073/pnas.0437938100","citation":{"short":"A. Sirota, J.L. Csicsvari, D. Buhl, G. Buzsáki, PNAS 100 (2003) 2065–2069.","ista":"Sirota A, Csicsvari JL, Buhl D, Buzsáki G. 2003. Communication between neocortex and hippocampus during sleep in rodents. PNAS. 100(4), 2065–2069.","ama":"Sirota A, Csicsvari JL, Buhl D, Buzsáki G. Communication between neocortex and hippocampus during sleep in rodents. <i>PNAS</i>. 2003;100(4):2065-2069. doi:<a href=\"https://doi.org/10.1073/pnas.0437938100\">10.1073/pnas.0437938100</a>","apa":"Sirota, A., Csicsvari, J. L., Buhl, D., &#38; Buzsáki, G. (2003). Communication between neocortex and hippocampus during sleep in rodents. <i>PNAS</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.0437938100\">https://doi.org/10.1073/pnas.0437938100</a>","ieee":"A. Sirota, J. L. Csicsvari, D. Buhl, and G. Buzsáki, “Communication between neocortex and hippocampus during sleep in rodents,” <i>PNAS</i>, vol. 100, no. 4. National Academy of Sciences, pp. 2065–2069, 2003.","mla":"Sirota, Anton, et al. “Communication between Neocortex and Hippocampus during Sleep in Rodents.” <i>PNAS</i>, vol. 100, no. 4, National Academy of Sciences, 2003, pp. 2065–69, doi:<a href=\"https://doi.org/10.1073/pnas.0437938100\">10.1073/pnas.0437938100</a>.","chicago":"Sirota, Anton, Jozsef L Csicsvari, Derek Buhl, and György Buzsáki. “Communication between Neocortex and Hippocampus during Sleep in Rodents.” <i>PNAS</i>. National Academy of Sciences, 2003. <a href=\"https://doi.org/10.1073/pnas.0437938100\">https://doi.org/10.1073/pnas.0437938100</a>."},"publist_id":"2841","_id":"3543","abstract":[{"text":"Both neocortical and hippocampal networks organize the firing patterns of their neurons by prominent oscillations during sleep, but the functional role of these rhythms is not well understood. Here, we show a robust correlation of neuronal discharges between the somatosensory cortex and hippocampus on both slow and fine time scales in the mouse and rat. Neuronal bursts in deep cortical layers, associated with sleep spindles and delta waves/slow rhythm, effectively triggered hippocampal discharges related to fast (ripple) oscillations. We hypothesize that oscillation-mediated temporal links coordinate specific information transfer between neocortical and hippocampal cell assemblies. Such a neocortical-hippocampal interplay may be important for memory consolidation.","lang":"eng"}],"month":"02","publication_status":"published","date_updated":"2021-01-12T07:44:12Z","page":"2065 - 2069","issue":"4","extern":1,"intvolume":"       100","volume":100,"date_published":"2003-02-18T00:00:00Z","date_created":"2018-12-11T12:03:53Z","quality_controlled":0},{"publist_id":"2829","publisher":"ACM","doi":"10.1145/777792.777846","citation":{"chicago":"Edelsbrunner, Herbert, John Harer, Vijay Natarajan, and Valerio Pascucci. “Morse-Smale Complexes for Piecewise Linear 3-Manifolds,” 361–70. ACM, 2003. <a href=\"https://doi.org/10.1145/777792.777846\">https://doi.org/10.1145/777792.777846</a>.","mla":"Edelsbrunner, Herbert, et al. <i>Morse-Smale Complexes for Piecewise Linear 3-Manifolds</i>. ACM, 2003, pp. 361–70, doi:<a href=\"https://doi.org/10.1145/777792.777846\">10.1145/777792.777846</a>.","apa":"Edelsbrunner, H., Harer, J., Natarajan, V., &#38; Pascucci, V. (2003). Morse-Smale complexes for piecewise linear 3-manifolds (pp. 361–370). Presented at the SCG: Symposium on Computational Geometry, ACM. <a href=\"https://doi.org/10.1145/777792.777846\">https://doi.org/10.1145/777792.777846</a>","ieee":"H. Edelsbrunner, J. Harer, V. Natarajan, and V. Pascucci, “Morse-Smale complexes for piecewise linear 3-manifolds,” presented at the SCG: Symposium on Computational Geometry, 2003, pp. 361–370.","ista":"Edelsbrunner H, Harer J, Natarajan V, Pascucci V. 2003. Morse-Smale complexes for piecewise linear 3-manifolds. SCG: Symposium on Computational Geometry, 361–370.","ama":"Edelsbrunner H, Harer J, Natarajan V, Pascucci V. Morse-Smale complexes for piecewise linear 3-manifolds. In: ACM; 2003:361-370. doi:<a href=\"https://doi.org/10.1145/777792.777846\">10.1145/777792.777846</a>","short":"H. Edelsbrunner, J. Harer, V. Natarajan, V. Pascucci, in:, ACM, 2003, pp. 361–370."},"title":"Morse-Smale complexes for piecewise linear 3-manifolds","year":"2003","status":"public","author":[{"last_name":"Edelsbrunner","first_name":"Herbert","full_name":"Herbert Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833"},{"last_name":"Harer","first_name":"John","full_name":"Harer, John"},{"first_name":"Vijay","last_name":"Natarajan","full_name":"Natarajan, Vijay"},{"first_name":"Valerio","last_name":"Pascucci","full_name":"Pascucci, Valerio"}],"main_file_link":[{"url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.14.9592","open_access":"0"}],"conference":{"name":"SCG: Symposium on Computational Geometry"},"type":"conference","day":"01","quality_controlled":0,"date_published":"2003-06-01T00:00:00Z","date_created":"2018-12-11T12:03:57Z","page":"361 - 370","extern":1,"date_updated":"2021-01-12T07:44:17Z","abstract":[{"text":"We define the Morse-Smale complex of a Morse function over a 3-manifold as the overlay of the descending and as- cending manifolds of all critical points. In the generic case, its 3-dimensional cells are shaped like crystals and are sepa- rated by quadrangular faces. In this paper, we give a combi- natorial algorithm for constructing such complexes for piece- wise linear data.","lang":"eng"}],"month":"06","publication_status":"published","_id":"3556"},{"_id":"3573","abstract":[{"lang":"eng","text":"Given a finite point set in R, the surface reconstruction problem asks for a surface that passes through many but not necessarily all points. We describe an unambigu- ous definition of such a surface in geometric and topological terms, and sketch a fast algorithm for constructing it. Our solution overcomes past limitations to special point distributions and heuristic design decisions."}],"publication_status":"published","month":"06","quality_controlled":0,"date_created":"2018-12-11T12:04:02Z","date_published":"2003-06-23T00:00:00Z","date_updated":"2021-01-12T07:44:24Z","page":"379 - 404","extern":1,"main_file_link":[{"url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.129.3633","open_access":"0"}],"author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","first_name":"Herbert","full_name":"Herbert Edelsbrunner","orcid":"0000-0002-9823-6833"}],"day":"23","type":"book_chapter","publist_id":"2812","year":"2003","title":"Surface reconstruction by wrapping finite sets in space","publication":"Discrete & Computational Geometry","status":"public","publisher":"Springer","citation":{"mla":"Edelsbrunner, Herbert. “Surface Reconstruction by Wrapping Finite Sets in Space.” <i>Discrete &#38; Computational Geometry</i>, Springer, 2003, pp. 379–404, doi:<a href=\"https://doi.org/10.1007/978-3-642-55566-4_17\">10.1007/978-3-642-55566-4_17</a>.","chicago":"Edelsbrunner, Herbert. “Surface Reconstruction by Wrapping Finite Sets in Space.” In <i>Discrete &#38; Computational Geometry</i>, 379–404. Springer, 2003. <a href=\"https://doi.org/10.1007/978-3-642-55566-4_17\">https://doi.org/10.1007/978-3-642-55566-4_17</a>.","apa":"Edelsbrunner, H. (2003). Surface reconstruction by wrapping finite sets in space. In <i>Discrete &#38; Computational Geometry</i> (pp. 379–404). Springer. <a href=\"https://doi.org/10.1007/978-3-642-55566-4_17\">https://doi.org/10.1007/978-3-642-55566-4_17</a>","ieee":"H. Edelsbrunner, “Surface reconstruction by wrapping finite sets in space,” in <i>Discrete &#38; Computational Geometry</i>, Springer, 2003, pp. 379–404.","short":"H. Edelsbrunner, in:, Discrete &#38; Computational Geometry, Springer, 2003, pp. 379–404.","ista":"Edelsbrunner H. 2003.Surface reconstruction by wrapping finite sets in space. In: Discrete &#38; Computational Geometry. , 379–404.","ama":"Edelsbrunner H. Surface reconstruction by wrapping finite sets in space. In: <i>Discrete &#38; Computational Geometry</i>. Springer; 2003:379-404. doi:<a href=\"https://doi.org/10.1007/978-3-642-55566-4_17\">10.1007/978-3-642-55566-4_17</a>"},"doi":"10.1007/978-3-642-55566-4_17"},{"main_file_link":[{"url":"http://projecteuclid.org/euclid.hha/1088453320"}],"author":[{"orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","first_name":"Herbert","full_name":"Edelsbrunner, Herbert"},{"first_name":"Afra","last_name":"Zomorodian","full_name":"Zomorodian, Afra"}],"day":"22","type":"journal_article","publist_id":"2801","oa_version":"None","title":"Computing linking numbers of a filtration","publication":"Homology, Homotopy and Applications","status":"public","year":"2003","publisher":"International Press","citation":{"ieee":"H. Edelsbrunner and A. Zomorodian, “Computing linking numbers of a filtration,” <i>Homology, Homotopy and Applications</i>, vol. 5, no. 2. International Press, pp. 19–37, 2003.","apa":"Edelsbrunner, H., &#38; Zomorodian, A. (2003). Computing linking numbers of a filtration. <i>Homology, Homotopy and Applications</i>. International Press.","chicago":"Edelsbrunner, Herbert, and Afra Zomorodian. “Computing Linking Numbers of a Filtration.” <i>Homology, Homotopy and Applications</i>. International Press, 2003.","mla":"Edelsbrunner, Herbert, and Afra Zomorodian. “Computing Linking Numbers of a Filtration.” <i>Homology, Homotopy and Applications</i>, vol. 5, no. 2, International Press, 2003, pp. 19–37.","ista":"Edelsbrunner H, Zomorodian A. 2003. Computing linking numbers of a filtration. Homology, Homotopy and Applications. 5(2), 19–37.","ama":"Edelsbrunner H, Zomorodian A. Computing linking numbers of a filtration. <i>Homology, Homotopy and Applications</i>. 2003;5(2):19-37.","short":"H. Edelsbrunner, A. Zomorodian, Homology, Homotopy and Applications 5 (2003) 19–37."},"_id":"3584","abstract":[{"text":"We develop fast algorithms for computing the linking number of a simplicial complex within a filtration.We give experimental results in applying our work toward the detection of non-trivial tangling in biomolecules, modeled as alpha complexes.","lang":"eng"}],"month":"04","publication_status":"published","language":[{"iso":"eng"}],"volume":5,"intvolume":"         5","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","date_published":"2003-04-22T00:00:00Z","date_created":"2018-12-11T12:04:05Z","date_updated":"2021-01-12T07:44:28Z","page":"19 - 37","extern":"1","issue":"2"},{"day":"01","type":"journal_article","author":[{"orcid":"0000-0002-4561-241X","full_name":"Krishnendu Chatterjee","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Dasgupta, Pallab","first_name":"Pallab","last_name":"Dasgupta"},{"full_name":"Chakrabarti, Partha P","last_name":"Chakrabarti","first_name":"Partha"}],"year":"2003","publication":"Journal of Automated Reasoning","status":"public","title":"A branching time temporal framework for quantitative reasoning","publisher":"Springer","doi":"10.1023/A:1023217515688","citation":{"apa":"Chatterjee, K., Dasgupta, P., &#38; Chakrabarti, P. (2003). A branching time temporal framework for quantitative reasoning. <i>Journal of Automated Reasoning</i>. Springer. <a href=\"https://doi.org/10.1023/A:1023217515688\">https://doi.org/10.1023/A:1023217515688</a>","ieee":"K. Chatterjee, P. Dasgupta, and P. Chakrabarti, “A branching time temporal framework for quantitative reasoning,” <i>Journal of Automated Reasoning</i>, vol. 30, no. 2. Springer, pp. 205–232, 2003.","chicago":"Chatterjee, Krishnendu, Pallab Dasgupta, and Partha Chakrabarti. “A Branching Time Temporal Framework for Quantitative Reasoning.” <i>Journal of Automated Reasoning</i>. Springer, 2003. <a href=\"https://doi.org/10.1023/A:1023217515688\">https://doi.org/10.1023/A:1023217515688</a>.","mla":"Chatterjee, Krishnendu, et al. “A Branching Time Temporal Framework for Quantitative Reasoning.” <i>Journal of Automated Reasoning</i>, vol. 30, no. 2, Springer, 2003, pp. 205–32, doi:<a href=\"https://doi.org/10.1023/A:1023217515688\">10.1023/A:1023217515688</a>.","ista":"Chatterjee K, Dasgupta P, Chakrabarti P. 2003. A branching time temporal framework for quantitative reasoning. Journal of Automated Reasoning. 30(2), 205–232.","ama":"Chatterjee K, Dasgupta P, Chakrabarti P. A branching time temporal framework for quantitative reasoning. <i>Journal of Automated Reasoning</i>. 2003;30(2):205-232. doi:<a href=\"https://doi.org/10.1023/A:1023217515688\">10.1023/A:1023217515688</a>","short":"K. Chatterjee, P. Dasgupta, P. Chakrabarti, Journal of Automated Reasoning 30 (2003) 205–232."},"publist_id":"2790","_id":"3593","publication_status":"published","abstract":[{"lang":"eng","text":"Temporal logics such as Computation Tree Logic (CTL) and Linear Temporal Logic (LTL) have become popular for specifying temporal properties over a wide variety of planning and verification problems. In this paper we work towards building a generalized framework for automated reasoning based on temporal logics. We present a powerful extension of CTL with first-order quantification over the set of reachable states for reasoning about extremal properties of weighted labeled transition systems in general. The proposed logic, which we call Weighted Quantified Computation Tree Logic (WQCTL), captures the essential elements common to the domain of planning and verification problems and can thereby be used as an effective specification language in both domains. We show that in spite of the rich, expressive power of the logic, we are able to evaluate WQCTL formulas in time polynomial in the size of the state space times the length of the formula. Wepresent experimental results on the WQCTL verifier."}],"month":"02","date_updated":"2021-01-12T07:44:31Z","issue":"2","page":"205 - 232","extern":1,"volume":30,"intvolume":"        30","quality_controlled":0,"date_created":"2018-12-11T12:04:08Z","date_published":"2003-02-01T00:00:00Z"},{"_id":"3618","month":"07","abstract":[{"text":"There are several analyses in evolutionary ecology which assume that a family of offspring has come from only two parents. Here, we present a simple test for detecting when a batch involves two or more subfamilies. It is based on the fact that the mixing of families generates associations amongst unlinked marker loci. We also present simulations illustrating the power of our method for varying numbers of loci, alleles per locus and genotyped individuals.","lang":"eng"}],"publication_status":"published","date_updated":"2021-01-12T07:44:42Z","page":"1999 - 2002","extern":1,"issue":"7","intvolume":"        12","volume":12,"date_created":"2018-12-11T12:04:16Z","quality_controlled":0,"date_published":"2003-07-01T00:00:00Z","day":"01","type":"journal_article","author":[{"last_name":"Vines","first_name":"Timothy","full_name":"Vines, Timothy H"},{"id":"4880FE40-F248-11E8-B48F-1D18A9856A87","full_name":"Nicholas Barton","last_name":"Barton","first_name":"Nicholas H","orcid":"0000-0002-8548-5240"}],"title":"A new approach to detecting mixed families","year":"2003","status":"public","publication":"Molecular Ecology","citation":{"ieee":"T. Vines and N. H. Barton, “A new approach to detecting mixed families,” <i>Molecular Ecology</i>, vol. 12, no. 7. Wiley-Blackwell, pp. 1999–2002, 2003.","apa":"Vines, T., &#38; Barton, N. H. (2003). A new approach to detecting mixed families. <i>Molecular Ecology</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1046/j.1365-294X.2003.01867.x\">https://doi.org/10.1046/j.1365-294X.2003.01867.x</a>","mla":"Vines, Timothy, and Nicholas H. Barton. “A New Approach to Detecting Mixed Families.” <i>Molecular Ecology</i>, vol. 12, no. 7, Wiley-Blackwell, 2003, pp. 1999–2002, doi:<a href=\"https://doi.org/10.1046/j.1365-294X.2003.01867.x\">10.1046/j.1365-294X.2003.01867.x</a>.","chicago":"Vines, Timothy, and Nicholas H Barton. “A New Approach to Detecting Mixed Families.” <i>Molecular Ecology</i>. Wiley-Blackwell, 2003. <a href=\"https://doi.org/10.1046/j.1365-294X.2003.01867.x\">https://doi.org/10.1046/j.1365-294X.2003.01867.x</a>.","short":"T. Vines, N.H. Barton, Molecular Ecology 12 (2003) 1999–2002.","ista":"Vines T, Barton NH. 2003. A new approach to detecting mixed families. Molecular Ecology. 12(7), 1999–2002.","ama":"Vines T, Barton NH. A new approach to detecting mixed families. <i>Molecular Ecology</i>. 2003;12(7):1999-2002. doi:<a href=\"https://doi.org/10.1046/j.1365-294X.2003.01867.x\">10.1046/j.1365-294X.2003.01867.x</a>"},"doi":"10.1046/j.1365-294X.2003.01867.x","publisher":"Wiley-Blackwell","publist_id":"2765"},{"author":[{"first_name":"Stuart","last_name":"Baird","full_name":"Baird, Stuart J"},{"orcid":"0000-0002-8548-5240","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","full_name":"Nicholas Barton","first_name":"Nicholas H","last_name":"Barton"},{"first_name":"Alison","last_name":"Etheridge","full_name":"Etheridge, Alison M"}],"day":"01","type":"journal_article","publist_id":"2764","publication":"Theoretical Population Biology","status":"public","year":"2003","title":"The distribution of surviving blocks of an ancestral genome","publisher":"Academic Press","doi":"10.1016/S0040-5809(03)00098-4","citation":{"ama":"Baird S, Barton NH, Etheridge A. The distribution of surviving blocks of an ancestral genome. <i>Theoretical Population Biology</i>. 2003;64(4):451-471. doi:<a href=\"https://doi.org/10.1016/S0040-5809(03)00098-4\">10.1016/S0040-5809(03)00098-4</a>","ista":"Baird S, Barton NH, Etheridge A. 2003. The distribution of surviving blocks of an ancestral genome. Theoretical Population Biology. 64(4), 451–471.","short":"S. Baird, N.H. Barton, A. Etheridge, Theoretical Population Biology 64 (2003) 451–471.","chicago":"Baird, Stuart, Nicholas H Barton, and Alison Etheridge. “The Distribution of Surviving Blocks of an Ancestral Genome.” <i>Theoretical Population Biology</i>. Academic Press, 2003. <a href=\"https://doi.org/10.1016/S0040-5809(03)00098-4\">https://doi.org/10.1016/S0040-5809(03)00098-4</a>.","mla":"Baird, Stuart, et al. “The Distribution of Surviving Blocks of an Ancestral Genome.” <i>Theoretical Population Biology</i>, vol. 64, no. 4, Academic Press, 2003, pp. 451–71, doi:<a href=\"https://doi.org/10.1016/S0040-5809(03)00098-4\">10.1016/S0040-5809(03)00098-4</a>.","ieee":"S. Baird, N. H. Barton, and A. Etheridge, “The distribution of surviving blocks of an ancestral genome,” <i>Theoretical Population Biology</i>, vol. 64, no. 4. Academic Press, pp. 451–471, 2003.","apa":"Baird, S., Barton, N. H., &#38; Etheridge, A. (2003). The distribution of surviving blocks of an ancestral genome. <i>Theoretical Population Biology</i>. Academic Press. <a href=\"https://doi.org/10.1016/S0040-5809(03)00098-4\">https://doi.org/10.1016/S0040-5809(03)00098-4</a>"},"_id":"3619","publication_status":"published","month":"12","abstract":[{"lang":"eng","text":"What is the chance that some part of a stretch of genome will survive? In a population of constant size, and with no selection, the probability of survival of some part of a stretch of map length y&lt;1 approaches View the MathML source for View the MathML source. Thus, the whole genome is certain to be lost, but the rate of loss is extremely slow. This solution extends to give the whole distribution of surviving block sizes as a function of time. We show that the expected number of blocks at time t is 1+yt and give expressions for the moments of the number of blocks and the total amount of genome that survives for a given time. The solution is based on a branching process and assumes complete interference between crossovers, so that each descendant carries only a single block of ancestral material. We consider cases where most individuals carry multiple blocks, either because there are multiple crossovers in a long genetic map, or because enough time has passed that most individuals in the population are related to each other. For species such as ours, which have a long genetic map, the genome of any individual which leaves descendants (∼80% of the population for a Poisson offspring number with mean two) is likely to persist for an extremely long time, in the form of a few short blocks of genome."}],"volume":64,"intvolume":"        64","quality_controlled":0,"date_created":"2018-12-11T12:04:17Z","date_published":"2003-12-01T00:00:00Z","date_updated":"2021-01-12T07:44:42Z","extern":1,"issue":"4","page":"451 - 471"},{"month":"08","abstract":[{"text":"Stable hybrid zones in which ecologically divergent taxa give rise to a range of recombinants are natural laboratories in which the genetic basis of adaptation and reproductive isolation can be unraveled. One such hybrid zone is formed by the fire-bellied toads Bombina bombina and B. variegata (Anura: Discoglossidae). Adaptations to permanent and ephemeral breeding habitats, respectively, have shaped numerous phenotypic differences between the taxa. All of these are, in principle, candidates for a genetic dissection via QTL mapping. We present here a linkage map of 28 codominant and 10 dominant markers in the Bombina genome. In an F2 cross, markers that were mainly microsatellites, SSCPs or allozymes were mapped to 20 linkage groups. Among the 40 isolated CA microsatellites, we noted a preponderance of compound and frequently interleaved CA-TA repeats as well as a striking polarity at the 5′ end of the repeats.","lang":"eng"}],"publication_status":"published","_id":"3620","issue":"2","page":"136 - 142","extern":1,"date_updated":"2021-01-12T07:44:43Z","quality_controlled":0,"date_published":"2003-08-01T00:00:00Z","date_created":"2018-12-11T12:04:17Z","intvolume":"        91","volume":91,"type":"journal_article","day":"01","author":[{"full_name":"Nürnberger, Beate","last_name":"Nürnberger","first_name":"Beate"},{"first_name":"Sebastian","last_name":"Hofman","full_name":"Hofman, Sebastian"},{"full_name":"Förg-Brey, Bqruni","first_name":"Bqruni","last_name":"Förg Brey"},{"full_name":"Praetzel, Gabriele","first_name":"Gabriele","last_name":"Praetzel"},{"last_name":"Maclean","first_name":"Alan","full_name":"Maclean, Alan W"},{"full_name":"Szymura, Jacek M","first_name":"Jacek","last_name":"Szymura"},{"last_name":"Abbott","first_name":"Catherine","full_name":"Abbott, Catherine M"},{"orcid":"0000-0002-8548-5240","first_name":"Nicholas H","last_name":"Barton","full_name":"Nicholas Barton","id":"4880FE40-F248-11E8-B48F-1D18A9856A87"}],"publisher":"Nature Publishing Group","citation":{"mla":"Nürnberger, Beate, et al. “A Linkage Map for the Hybridising Toads Bombina Bombina and B. Variegata (Anura: Discoglossidae).” <i>Heredity</i>, vol. 91, no. 2, Nature Publishing Group, 2003, pp. 136–42, doi:<a href=\"https://doi.org/10.1038/sj.hdy.6800291\">10.1038/sj.hdy.6800291</a>.","chicago":"Nürnberger, Beate, Sebastian Hofman, Bqruni Förg Brey, Gabriele Praetzel, Alan Maclean, Jacek Szymura, Catherine Abbott, and Nicholas H Barton. “A Linkage Map for the Hybridising Toads Bombina Bombina and B. Variegata (Anura: Discoglossidae).” <i>Heredity</i>. Nature Publishing Group, 2003. <a href=\"https://doi.org/10.1038/sj.hdy.6800291\">https://doi.org/10.1038/sj.hdy.6800291</a>.","apa":"Nürnberger, B., Hofman, S., Förg Brey, B., Praetzel, G., Maclean, A., Szymura, J., … Barton, N. H. (2003). A linkage map for the hybridising toads Bombina bombina and B. variegata (Anura: Discoglossidae). <i>Heredity</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/sj.hdy.6800291\">https://doi.org/10.1038/sj.hdy.6800291</a>","ieee":"B. Nürnberger <i>et al.</i>, “A linkage map for the hybridising toads Bombina bombina and B. variegata (Anura: Discoglossidae),” <i>Heredity</i>, vol. 91, no. 2. Nature Publishing Group, pp. 136–142, 2003.","short":"B. Nürnberger, S. Hofman, B. Förg Brey, G. Praetzel, A. Maclean, J. Szymura, C. Abbott, N.H. Barton, Heredity 91 (2003) 136–142.","ama":"Nürnberger B, Hofman S, Förg Brey B, et al. A linkage map for the hybridising toads Bombina bombina and B. variegata (Anura: Discoglossidae). <i>Heredity</i>. 2003;91(2):136-142. doi:<a href=\"https://doi.org/10.1038/sj.hdy.6800291\">10.1038/sj.hdy.6800291</a>","ista":"Nürnberger B, Hofman S, Förg Brey B, Praetzel G, Maclean A, Szymura J, Abbott C, Barton NH. 2003. A linkage map for the hybridising toads Bombina bombina and B. variegata (Anura: Discoglossidae). Heredity. 91(2), 136–142."},"doi":"10.1038/sj.hdy.6800291","publication":"Heredity","title":"A linkage map for the hybridising toads Bombina bombina and B. variegata (Anura: Discoglossidae)","year":"2003","status":"public","publist_id":"2763"},{"publist_id":"2704","citation":{"mla":"Lampert, Christoph. “The Neumann Operator in Strictly Pseudoconvex Domains with Weighted Bergman Metric .” <i>Bonner Mathematische Schriften</i>, vol. 356, Universität Bonn, Fachbibliothek Mathematik, 2003, pp. 1–165.","chicago":"Lampert, Christoph. “The Neumann Operator in Strictly Pseudoconvex Domains with Weighted Bergman Metric .” <i>Bonner Mathematische Schriften</i>. Universität Bonn, Fachbibliothek Mathematik, 2003.","ieee":"C. Lampert, “The Neumann operator in strictly pseudoconvex domains with weighted Bergman metric ,” Universität Bonn, Fachbibliothek Mathematik, 2003.","apa":"Lampert, C. (2003). <i>The Neumann operator in strictly pseudoconvex domains with weighted Bergman metric </i>. <i>Bonner Mathematische Schriften</i>. Universität Bonn, Fachbibliothek Mathematik.","short":"C. Lampert, The Neumann Operator in Strictly Pseudoconvex Domains with Weighted Bergman Metric , Universität Bonn, Fachbibliothek Mathematik, 2003.","ama":"Lampert C. The Neumann operator in strictly pseudoconvex domains with weighted Bergman metric . <i>Bonner Mathematische Schriften</i>. 2003;356:1-165.","ista":"Lampert C. 2003. The Neumann operator in strictly pseudoconvex domains with weighted Bergman metric . Universität Bonn, Fachbibliothek Mathematik."},"publisher":"Universität Bonn, Fachbibliothek Mathematik","year":"2003","title":"The Neumann operator in strictly pseudoconvex domains with weighted Bergman metric ","publication":"Bonner Mathematische Schriften","status":"public","author":[{"orcid":"0000-0001-8622-7887","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","full_name":"Christoph Lampert","last_name":"Lampert","first_name":"Christoph"}],"main_file_link":[{"url":"http://pub.ist.ac.at/~chl/papers/lampert-phd2003.pdf","open_access":"0"}],"type":"dissertation","day":"31","quality_controlled":0,"date_created":"2018-12-11T12:04:34Z","date_published":"2003-03-31T00:00:00Z","volume":356,"intvolume":"       356","extern":1,"page":"1 - 165","date_updated":"2021-01-12T07:45:05Z","publication_status":"published","month":"03","_id":"3678"},{"abstract":[{"lang":"eng","text":"The combination of high-resolution atomic force microscopy (AFM) imaging and single-molecule force-spectroscopy was employed to unfold single bacteriorhodopsins (BR) from native purple membrane patches at various physiologically relevant temperatures. The unfolding spectra reveal detailed insight into the stability of individual structural elements of BR against mechanical unfolding. Intermittent states in the unfolding process are associated with the stepwise unfolding of alpha-helices, whereas other states are associated with the unfolding of polypeptide loops connecting the alpha-helices. It was found that the unfolding forces of the secondary structures considerably decreased upon increasing the temperature from 8 to 52°C. Associated with this effect, the probability of individual unfolding pathways of BR was significantly influenced by the temperature. At lower temperatures, transmembrane alpha-helices and extracellular polypeptide loops exhibited sufficient stability to individually establish potential barriers against unfolding, whereas they predominantly unfolded collectively at elevated temperatures. This suggests that increasing the temperature decreases the mechanical stability of secondary structural elements and changes molecular interactions between secondary structures, thereby forcing them to act as grouped structures."}],"month":"01","publication_status":"published","_id":"3725","extern":1,"issue":"19","page":"5220 - 5229","date_updated":"2021-01-12T07:51:45Z","date_created":"2018-12-11T12:04:50Z","quality_controlled":0,"date_published":"2003-01-01T00:00:00Z","intvolume":"        22","volume":22,"type":"journal_article","day":"01","author":[{"orcid":"0000-0002-8023-9315","full_name":"Harald Janovjak","last_name":"Janovjak","first_name":"Harald L","id":"33BA6C30-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Kessler, Max","last_name":"Kessler","first_name":"Max"},{"first_name":"Dieter","last_name":"Oesterhelt","full_name":"Oesterhelt, Dieter"},{"full_name":"Gaub, Hermann","first_name":"Hermann","last_name":"Gaub"},{"first_name":"Daniel","last_name":"Mueller","full_name":"Mueller, Daniel J"}],"main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC204492/","open_access":"1"}],"publisher":"Wiley-Blackwell","doi":"10.1093/emboj/cdg509","citation":{"chicago":"Janovjak, Harald L, Max Kessler, Dieter Oesterhelt, Hermann Gaub, and Daniel Mueller. “Unfolding Pathways of Native Bacteriorhodopsin Depend on Temperature.” <i>EMBO Journal</i>. Wiley-Blackwell, 2003. <a href=\"https://doi.org/10.1093/emboj/cdg509\">https://doi.org/10.1093/emboj/cdg509</a>.","mla":"Janovjak, Harald L., et al. “Unfolding Pathways of Native Bacteriorhodopsin Depend on Temperature.” <i>EMBO Journal</i>, vol. 22, no. 19, Wiley-Blackwell, 2003, pp. 5220–29, doi:<a href=\"https://doi.org/10.1093/emboj/cdg509\">10.1093/emboj/cdg509</a>.","apa":"Janovjak, H. L., Kessler, M., Oesterhelt, D., Gaub, H., &#38; Mueller, D. (2003). Unfolding pathways of native bacteriorhodopsin depend on temperature. <i>EMBO Journal</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1093/emboj/cdg509\">https://doi.org/10.1093/emboj/cdg509</a>","ieee":"H. L. Janovjak, M. Kessler, D. Oesterhelt, H. Gaub, and D. Mueller, “Unfolding pathways of native bacteriorhodopsin depend on temperature,” <i>EMBO Journal</i>, vol. 22, no. 19. Wiley-Blackwell, pp. 5220–5229, 2003.","ama":"Janovjak HL, Kessler M, Oesterhelt D, Gaub H, Mueller D. Unfolding pathways of native bacteriorhodopsin depend on temperature. <i>EMBO Journal</i>. 2003;22(19):5220-5229. doi:<a href=\"https://doi.org/10.1093/emboj/cdg509\">10.1093/emboj/cdg509</a>","ista":"Janovjak HL, Kessler M, Oesterhelt D, Gaub H, Mueller D. 2003. Unfolding pathways of native bacteriorhodopsin depend on temperature. EMBO Journal. 22(19), 5220–5229.","short":"H.L. Janovjak, M. Kessler, D. Oesterhelt, H. Gaub, D. Mueller, EMBO Journal 22 (2003) 5220–5229."},"status":"public","year":"2003","title":"Unfolding pathways of native bacteriorhodopsin depend on temperature","publication":"EMBO Journal","publist_id":"2506","oa":1}]