[{"citation":{"short":"C. Maccallum, B. Nürnberger, N.H. Barton, J. Szymura, Evolution 52 (1998) 227–239.","ieee":"C. Maccallum, B. Nürnberger, N. H. Barton, and J. Szymura, “Habitat preference in the Bombina hybrid zone in Croatia,” <i>Evolution</i>, vol. 52, no. 1. Wiley-Blackwell, pp. 227–239, 1998.","apa":"Maccallum, C., Nürnberger, B., Barton, N. H., &#38; Szymura, J. (1998). Habitat preference in the Bombina hybrid zone in Croatia. <i>Evolution</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1111/j.1558-5646.1998.tb05156.x\">https://doi.org/10.1111/j.1558-5646.1998.tb05156.x</a>","ista":"Maccallum C, Nürnberger B, Barton NH, Szymura J. 1998. Habitat preference in the Bombina hybrid zone in Croatia. Evolution. 52(1), 227–239.","chicago":"Maccallum, Catriona, Beate Nürnberger, Nicholas H Barton, and Jacek Szymura. “Habitat Preference in the Bombina Hybrid Zone in Croatia.” <i>Evolution</i>. Wiley-Blackwell, 1998. <a href=\"https://doi.org/10.1111/j.1558-5646.1998.tb05156.x\">https://doi.org/10.1111/j.1558-5646.1998.tb05156.x</a>.","mla":"Maccallum, Catriona, et al. “Habitat Preference in the Bombina Hybrid Zone in Croatia.” <i>Evolution</i>, vol. 52, no. 1, Wiley-Blackwell, 1998, pp. 227–39, doi:<a href=\"https://doi.org/10.1111/j.1558-5646.1998.tb05156.x\">10.1111/j.1558-5646.1998.tb05156.x</a>.","ama":"Maccallum C, Nürnberger B, Barton NH, Szymura J. Habitat preference in the Bombina hybrid zone in Croatia. <i>Evolution</i>. 1998;52(1):227-239. doi:<a href=\"https://doi.org/10.1111/j.1558-5646.1998.tb05156.x\">10.1111/j.1558-5646.1998.tb05156.x</a>"},"intvolume":"        52","status":"public","pmid":1,"acknowledgement":"This work was supported by a NERC studentshipto CJM, by NERC grants GR3/9353, GR3/8002, andGR9/1909A to NHB,  and by KBN grant 193/P04/95/09to JMS. We are grateful to J. W.Arntzen, L.Kruuk, R. G.Harrison, J. W.Sites, and an anonymous reviewer for their comments on the manuscript.","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","abstract":[{"text":"This paper demonstrates the effect of habitat heterogeneity and a habitat preference on the genetic structure of a hybrid zone between the toads Bombina bombina and B. variegata (Anura: Discoglossidae); 1613 toads from 85 sites across a transect near Pešćenica, Croatia, were scored for five unlinked diagnostic allozyme markers. These were found to be largely concordant. Aside from minor systematic deviations, there was little variance in allele frequency among loci within sites. Yet the allele frequencies did not follow a smooth cline, but formed a mosaic in the center, such that neighboring sites could differ markedly in their enzyme score. A detailed ecological survey revealed a correlation between this pattern and habitat. In keeping with the typical breeding sites of the parental taxa, B. bombina-like hybrids were found more often in ponds, whereas B. variegata-like hybrids were more common in puddles. In addition, there was significant heterozygote deficit (FIS) and strong linkage disequilibrium (R), both of which were stronger on the B. bombina side of the transect, and stronger in puddles than ponds. Mark-recapture data showed: (1) that the animals disperse beyond the scale of the habitat pattern; (2) frequent turn-over of individuals within sites; and (3) nonrandom movement between two sites of different habitat type. We conclude that an active habitat preference must contribute to the observed association between marker alleles and habitat. As a consequence, there is incomplete mixing of the two gene pools, which could explain the high level of FIS and R. The asymmetry in these parameters may reflect asymmetry in the preference or in the distribution of habitats across the zone. We discuss the implications of habitat preference for the dynamics of hybrid zones.","lang":"eng"}],"title":"Habitat preference in the Bombina hybrid zone in Croatia","_id":"3629","publication_identifier":{"issn":["0014-3820"]},"issue":"1","scopus_import":"1","article_type":"original","oa_version":"None","external_id":{"pmid":["28568140"]},"date_published":"1998-02-01T00:00:00Z","type":"journal_article","volume":52,"month":"02","quality_controlled":"1","extern":"1","article_processing_charge":"No","date_updated":"2022-08-26T11:00:17Z","doi":"10.1111/j.1558-5646.1998.tb05156.x","publisher":"Wiley-Blackwell","publication":"Evolution","date_created":"2018-12-11T12:04:20Z","day":"01","publication_status":"published","publist_id":"2754","author":[{"last_name":"Maccallum","first_name":"Catriona","full_name":"Maccallum, Catriona"},{"last_name":"Nürnberger","first_name":"Beate","full_name":"Nürnberger, Beate"},{"orcid":"0000-0002-8548-5240","last_name":"Barton","full_name":"Barton, Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","first_name":"Nicholas H"},{"last_name":"Szymura","first_name":"Jacek","full_name":"Szymura, Jacek"}],"page":"227 - 239","language":[{"iso":"eng"}],"year":"1998"},{"year":"1998","language":[{"iso":"eng"}],"page":"1 - 9","author":[{"first_name":"Sylvia","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","full_name":"Cremer, Sylvia","last_name":"Cremer","orcid":"0000-0002-2193-3868"},{"full_name":"Greenfield, Michael","first_name":"Michael","last_name":"Greenfield"}],"day":"01","publication_status":"published","publist_id":"2227","date_created":"2018-12-11T12:05:56Z","date_updated":"2022-08-26T09:11:08Z","publisher":"Wiley-Blackwell","doi":"10.1111/j.1439-0310.1998.tb00025.x","publication":"Ethology","article_processing_charge":"No","quality_controlled":"1","extern":"1","month":"01","date_published":"1998-01-01T00:00:00Z","type":"journal_article","volume":104,"oa_version":"None","article_type":"original","scopus_import":"1","issue":"1","publication_identifier":{"issn":["0044-3573"]},"title":"Partitioning the components of sexual selection: attractiveness and agonistic behaviour in male wax moths, Achroia grisella (Lepidoptera, Pyralidae)","_id":"3926","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","abstract":[{"text":"Two components of sexual selection in the lesser wax moth, Achroia grisella, are clearly defined: females choose males based on characters of their ultrasonic advertisement signals, and males display agonistic behaviour patterns in contests over signalling stations. We conducted a series of laboratory trials to determine whether successes in these two sexual selection arenas were related. Our trials showed that winners in contests over signalling stations were characterized by earlier initiation of both signalling and aggression. These characteristics may indicate higher levels of ‘motivation,’ but it is unclear whether this level is a fixed trait. There was no relationship, however, between any measure of a male's attractiveness to females and his success in winning competition trials. Thus, inter- and intra-sexual selection may be acting on different, uncorrelated traits in A. grisella.","lang":"eng"}],"acknowledgement":"We thank Robert MINCKI-EY for collecting A. griseh from infested honeybee colonies and Yikweon J,4M;. Feng-You JIA, James MCLLOUGH and Kelly WILLAMS for indispensable laboratory assistaiice. Analyses of the ultrasonic advertisement signals was made possible by digital signal-processing programs written by Tom PETERS and Ric ROGERO (both of the University of Kansas Instrumentation Development Laboratory) and Martin CREMER. Marc BRANHAM and Klaus-Gerhardt HELLER offered valuable discussion during the project and Yikweon JAG, Klaus REINHOLD and several anonymous referees provided critical  reviews of the manuscript. Financial support was provided by US National Science Foundation grant IBN-9407162.","status":"public","intvolume":"       104","citation":{"chicago":"Cremer, Sylvia, and Michael Greenfield. “Partitioning the Components of Sexual Selection: Attractiveness and Agonistic Behaviour in Male Wax Moths, Achroia Grisella (Lepidoptera, Pyralidae).” <i>Ethology</i>. Wiley-Blackwell, 1998. <a href=\"https://doi.org/10.1111/j.1439-0310.1998.tb00025.x\">https://doi.org/10.1111/j.1439-0310.1998.tb00025.x</a>.","mla":"Cremer, Sylvia, and Michael Greenfield. “Partitioning the Components of Sexual Selection: Attractiveness and Agonistic Behaviour in Male Wax Moths, Achroia Grisella (Lepidoptera, Pyralidae).” <i>Ethology</i>, vol. 104, no. 1, Wiley-Blackwell, 1998, pp. 1–9, doi:<a href=\"https://doi.org/10.1111/j.1439-0310.1998.tb00025.x\">10.1111/j.1439-0310.1998.tb00025.x</a>.","ama":"Cremer S, Greenfield M. Partitioning the components of sexual selection: attractiveness and agonistic behaviour in male wax moths, Achroia grisella (Lepidoptera, Pyralidae). <i>Ethology</i>. 1998;104(1):1-9. doi:<a href=\"https://doi.org/10.1111/j.1439-0310.1998.tb00025.x\">10.1111/j.1439-0310.1998.tb00025.x</a>","ieee":"S. Cremer and M. Greenfield, “Partitioning the components of sexual selection: attractiveness and agonistic behaviour in male wax moths, Achroia grisella (Lepidoptera, Pyralidae),” <i>Ethology</i>, vol. 104, no. 1. Wiley-Blackwell, pp. 1–9, 1998.","short":"S. Cremer, M. Greenfield, Ethology 104 (1998) 1–9.","apa":"Cremer, S., &#38; Greenfield, M. (1998). Partitioning the components of sexual selection: attractiveness and agonistic behaviour in male wax moths, Achroia grisella (Lepidoptera, Pyralidae). <i>Ethology</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1111/j.1439-0310.1998.tb00025.x\">https://doi.org/10.1111/j.1439-0310.1998.tb00025.x</a>","ista":"Cremer S, Greenfield M. 1998. Partitioning the components of sexual selection: attractiveness and agonistic behaviour in male wax moths, Achroia grisella (Lepidoptera, Pyralidae). Ethology. 104(1), 1–9."}},{"scopus_import":"1","issue":"1","publication_identifier":{"issn":["0887-3585"]},"abstract":[{"lang":"eng","text":"The size and shape of macromolecules such as proteins and nucleic acids play an important role in their functions. Prior efforts to quantify these properties have been based on various discretization or tessellation procedures involving analytical or numerical computations. In this article, we present an analytically exact method for computing the metric properties of macromolecules based on the alpha shape theory. This method uses the duality between alpha complex and the weighted Voronoi decomposition of a molecule. We describe the intuitive ideas and concepts behind the alpha shape theory and the algorithm for computing areas and volumes of macromolecules. We apply our method to compute areas and volumes of a number of protein systems. We also discuss several difficulties commonly encountered in molecular shape computations and outline methods to overcome these problems. (C) 1998 Wiley-Liss, Inc."}],"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","_id":"4011","title":"Analytical shape computation of macromolecules: I. molecular area and volume through alpha shape","acknowledgement":"We thank Michael Facello for the torus area formula and suggestion regarding computation of MS model from  SA model. We thank Nataraj Akkiraju, Patrick Moran, and Marcus Wagner for interesting discussionson the topic of this article and for help in the generationof two- and three-dimensional illustrations. We thank NSF Meta Center Allocation  for providing computational resources. The software VOLBL is available at:http://alpha.ncsa.uiuc.edu/alpha.","status":"public","intvolume":"        33","citation":{"short":"J. Liang, H. Edelsbrunner, P. Fu, P. Sudhakar, S. Subramaniam, Proteins: Structure, Function and Bioinformatics 33 (1998) 1–17.","ieee":"J. Liang, H. Edelsbrunner, P. Fu, P. Sudhakar, and S. Subramaniam, “Analytical shape computation of macromolecules: I. molecular area and volume through alpha shape,” <i>Proteins: Structure, Function and Bioinformatics</i>, vol. 33, no. 1. Wiley-Blackwell, pp. 1–17, 1998.","ista":"Liang J, Edelsbrunner H, Fu P, Sudhakar P, Subramaniam S. 1998. Analytical shape computation of macromolecules: I. molecular area and volume through alpha shape. Proteins: Structure, Function and Bioinformatics. 33(1), 1–17.","apa":"Liang, J., Edelsbrunner, H., Fu, P., Sudhakar, P., &#38; Subramaniam, S. (1998). Analytical shape computation of macromolecules: I. molecular area and volume through alpha shape. <i>Proteins: Structure, Function and Bioinformatics</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1002/(SICI)1097-0134(19981001)33:1&#38;lt;1::AID-PROT1&#38;gt;3.0.CO;2-O\">https://doi.org/10.1002/(SICI)1097-0134(19981001)33:1&#38;lt;1::AID-PROT1&#38;gt;3.0.CO;2-O</a>","chicago":"Liang, Jie, Herbert Edelsbrunner, Ping Fu, Pamidighantam Sudhakar, and Shankar Subramaniam. “Analytical Shape Computation of Macromolecules: I. Molecular Area and Volume through Alpha Shape.” <i>Proteins: Structure, Function and Bioinformatics</i>. Wiley-Blackwell, 1998. <a href=\"https://doi.org/10.1002/(SICI)1097-0134(19981001)33:1&#38;lt;1::AID-PROT1&#38;gt;3.0.CO;2-O\">https://doi.org/10.1002/(SICI)1097-0134(19981001)33:1&#38;lt;1::AID-PROT1&#38;gt;3.0.CO;2-O</a>.","ama":"Liang J, Edelsbrunner H, Fu P, Sudhakar P, Subramaniam S. Analytical shape computation of macromolecules: I. molecular area and volume through alpha shape. <i>Proteins: Structure, Function and Bioinformatics</i>. 1998;33(1):1-17. doi:<a href=\"https://doi.org/10.1002/(SICI)1097-0134(19981001)33:1&#38;lt;1::AID-PROT1&#38;gt;3.0.CO;2-O\">10.1002/(SICI)1097-0134(19981001)33:1&#38;lt;1::AID-PROT1&#38;gt;3.0.CO;2-O</a>","mla":"Liang, Jie, et al. “Analytical Shape Computation of Macromolecules: I. Molecular Area and Volume through Alpha Shape.” <i>Proteins: Structure, Function and Bioinformatics</i>, vol. 33, no. 1, Wiley-Blackwell, 1998, pp. 1–17, doi:<a href=\"https://doi.org/10.1002/(SICI)1097-0134(19981001)33:1&#38;lt;1::AID-PROT1&#38;gt;3.0.CO;2-O\">10.1002/(SICI)1097-0134(19981001)33:1&#38;lt;1::AID-PROT1&#38;gt;3.0.CO;2-O</a>."},"language":[{"iso":"eng"}],"year":"1998","author":[{"full_name":"Liang, Jie","first_name":"Jie","last_name":"Liang"},{"last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert"},{"first_name":"Ping","full_name":"Fu, Ping","last_name":"Fu"},{"full_name":"Sudhakar, Pamidighantam","first_name":"Pamidighantam","last_name":"Sudhakar"},{"first_name":"Shankar","full_name":"Subramaniam, Shankar","last_name":"Subramaniam"}],"page":"1 - 17","date_created":"2018-12-11T12:06:25Z","publist_id":"2112","publication_status":"published","day":"01","article_processing_charge":"No","publication":"Proteins: Structure, Function and Bioinformatics","doi":"10.1002/(SICI)1097-0134(19981001)33:1&lt;1::AID-PROT1&gt;3.0.CO;2-O","date_updated":"2022-08-25T13:32:59Z","publisher":"Wiley-Blackwell","month":"10","extern":"1","quality_controlled":"1","volume":33,"date_published":"1998-10-01T00:00:00Z","type":"journal_article","oa_version":"None","article_type":"original"},{"volume":33,"type":"journal_article","date_published":"1998-10-01T00:00:00Z","article_type":"original","oa_version":"None","article_processing_charge":"No","publication":"Proteins: Structure, Function and Bioinformatics","doi":"10.1002/(SICI)1097-0134(19981001)33:1&lt;18::AID-PROT2&gt;3.0.CO;2-H","publisher":"Wiley-Blackwell","date_updated":"2022-08-25T13:35:41Z","month":"10","extern":"1","quality_controlled":"1","author":[{"full_name":"Liang, Jie","first_name":"Jie","last_name":"Liang"},{"orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","full_name":"Edelsbrunner, Herbert"},{"last_name":"Fu","first_name":"Ping","full_name":"Fu, Ping"},{"full_name":"Sudhakar, Pamidighantam","first_name":"Pamidighantam","last_name":"Sudhakar"},{"full_name":"Subramaniam, Shankar","first_name":"Shankar","last_name":"Subramaniam"}],"page":"18 - 29","date_created":"2018-12-11T12:06:26Z","publication_status":"published","publist_id":"2113","day":"01","language":[{"iso":"eng"}],"year":"1998","status":"public","intvolume":"        33","citation":{"ista":"Liang J, Edelsbrunner H, Fu P, Sudhakar P, Subramaniam S. 1998. Analytical shape computation of macromolecules: II. Inaccessible cavities in proteins. Proteins: Structure, Function and Bioinformatics. 33(1), 18–29.","apa":"Liang, J., Edelsbrunner, H., Fu, P., Sudhakar, P., &#38; Subramaniam, S. (1998). Analytical shape computation of macromolecules: II. Inaccessible cavities in proteins. <i>Proteins: Structure, Function and Bioinformatics</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1002/(SICI)1097-0134(19981001)33:1&#38;lt;18::AID-PROT2&#38;gt;3.0.CO;2-H\">https://doi.org/10.1002/(SICI)1097-0134(19981001)33:1&#38;lt;18::AID-PROT2&#38;gt;3.0.CO;2-H</a>","short":"J. Liang, H. Edelsbrunner, P. Fu, P. Sudhakar, S. Subramaniam, Proteins: Structure, Function and Bioinformatics 33 (1998) 18–29.","ieee":"J. Liang, H. Edelsbrunner, P. Fu, P. Sudhakar, and S. Subramaniam, “Analytical shape computation of macromolecules: II. Inaccessible cavities in proteins,” <i>Proteins: Structure, Function and Bioinformatics</i>, vol. 33, no. 1. Wiley-Blackwell, pp. 18–29, 1998.","ama":"Liang J, Edelsbrunner H, Fu P, Sudhakar P, Subramaniam S. Analytical shape computation of macromolecules: II. Inaccessible cavities in proteins. <i>Proteins: Structure, Function and Bioinformatics</i>. 1998;33(1):18-29. doi:<a href=\"https://doi.org/10.1002/(SICI)1097-0134(19981001)33:1&#38;lt;18::AID-PROT2&#38;gt;3.0.CO;2-H\">10.1002/(SICI)1097-0134(19981001)33:1&#38;lt;18::AID-PROT2&#38;gt;3.0.CO;2-H</a>","mla":"Liang, Jie, et al. “Analytical Shape Computation of Macromolecules: II. Inaccessible Cavities in Proteins.” <i>Proteins: Structure, Function and Bioinformatics</i>, vol. 33, no. 1, Wiley-Blackwell, 1998, pp. 18–29, doi:<a href=\"https://doi.org/10.1002/(SICI)1097-0134(19981001)33:1&#38;lt;18::AID-PROT2&#38;gt;3.0.CO;2-H\">10.1002/(SICI)1097-0134(19981001)33:1&#38;lt;18::AID-PROT2&#38;gt;3.0.CO;2-H</a>.","chicago":"Liang, Jie, Herbert Edelsbrunner, Ping Fu, Pamidighantam Sudhakar, and Shankar Subramaniam. “Analytical Shape Computation of Macromolecules: II. Inaccessible Cavities in Proteins.” <i>Proteins: Structure, Function and Bioinformatics</i>. Wiley-Blackwell, 1998. <a href=\"https://doi.org/10.1002/(SICI)1097-0134(19981001)33:1&#38;lt;18::AID-PROT2&#38;gt;3.0.CO;2-H\">https://doi.org/10.1002/(SICI)1097-0134(19981001)33:1&#38;lt;18::AID-PROT2&#38;gt;3.0.CO;2-H</a>."},"abstract":[{"text":"The structures of proteins are well-packed, yet they contain numerous cavities which play key roles in accommodating small molecules, or enabling conformational changes. From high-resolution structures it is possible to identify these cavities. We have developed a precise algorithm based on alpha shapes for measuring space-filling-based molecular models (such as van der Waals, solvent accessible, and molecular surface descriptions). We applied this method for accurate computation of the surface area and volume of cavities in several proteins. In addition, all of the atoms/residues Lining the cavities are identified, We use this method to study the structure and the stability of proteins, as well as to locate cavities that could contain structural water molecules in the proton transport pathway in the membrane protein bacteriorhodopsin.","lang":"eng"}],"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","_id":"4012","title":"Analytical shape computation of macromolecules: II. Inaccessible cavities in proteins","acknowledgement":"The software for constructing weighted Delaunay complexes and the alpha shape filters was written by Ernst Mücke and Michael Facello. We thank them forcreating reliable and robust software so that wecan build on their results. The authors thank NSF Meta Center Allocation for providing computational resources. The software VOLBL is part of the standard distribution of the alpha shapes software, andis available at http://alpha.ncsa.uiuc.edu/alpha.","issue":"1","publication_identifier":{"issn":["0887-3585"]},"scopus_import":"1"},{"publist_id":"2114","publication_status":"published","day":"09","date_created":"2018-12-11T12:06:26Z","page":"83 - 102","author":[{"last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Facello","first_name":"Michael","full_name":"Facello, Michael"},{"last_name":"Liang","full_name":"Liang, Jie","first_name":"Jie"}],"year":"1998","language":[{"iso":"eng"}],"oa_version":"Published Version","article_type":"original","external_id":{"pmid":["9390238"]},"volume":88,"type":"journal_article","date_published":"1998-11-09T00:00:00Z","extern":"1","oa":1,"quality_controlled":"1","month":"11","publication":"Discrete Applied Mathematics","publisher":"Elsevier","doi":"10.1016/S0166-218X(98)00067-5","date_updated":"2022-08-25T15:06:30Z","article_processing_charge":"No","publication_identifier":{"issn":["0166-218X"]},"issue":"1-3","scopus_import":"1","main_file_link":[{"url":"https://www.sciencedirect.com/science/article/pii/S0166218X98000675?via%3Dihub","open_access":"1"}],"citation":{"ama":"Edelsbrunner H, Facello M, Liang J. On the definition and the construction of pockets in macromolecules. <i>Discrete Applied Mathematics</i>. 1998;88(1-3):83-102. doi:<a href=\"https://doi.org/10.1016/S0166-218X(98)00067-5\">10.1016/S0166-218X(98)00067-5</a>","mla":"Edelsbrunner, Herbert, et al. “On the Definition and the Construction of Pockets in Macromolecules.” <i>Discrete Applied Mathematics</i>, vol. 88, no. 1–3, Elsevier, 1998, pp. 83–102, doi:<a href=\"https://doi.org/10.1016/S0166-218X(98)00067-5\">10.1016/S0166-218X(98)00067-5</a>.","chicago":"Edelsbrunner, Herbert, Michael Facello, and Jie Liang. “On the Definition and the Construction of Pockets in Macromolecules.” <i>Discrete Applied Mathematics</i>. Elsevier, 1998. <a href=\"https://doi.org/10.1016/S0166-218X(98)00067-5\">https://doi.org/10.1016/S0166-218X(98)00067-5</a>.","ista":"Edelsbrunner H, Facello M, Liang J. 1998. On the definition and the construction of pockets in macromolecules. Discrete Applied Mathematics. 88(1–3), 83–102.","apa":"Edelsbrunner, H., Facello, M., &#38; Liang, J. (1998). On the definition and the construction of pockets in macromolecules. <i>Discrete Applied Mathematics</i>. Elsevier. <a href=\"https://doi.org/10.1016/S0166-218X(98)00067-5\">https://doi.org/10.1016/S0166-218X(98)00067-5</a>","short":"H. Edelsbrunner, M. Facello, J. Liang, Discrete Applied Mathematics 88 (1998) 83–102.","ieee":"H. Edelsbrunner, M. Facello, and J. Liang, “On the definition and the construction of pockets in macromolecules,” <i>Discrete Applied Mathematics</i>, vol. 88, no. 1–3. Elsevier, pp. 83–102, 1998."},"intvolume":"        88","status":"public","acknowledgement":"The authors thank Ping Fu and Ernst Miicke for their contributions to the alpha shapes software in which the pockets software is embedded. ","pmid":1,"_id":"4013","title":"On the definition and the construction of pockets in macromolecules","abstract":[{"lang":"eng","text":"The shape of a protein is important for its functions, This includes the location and size of identifiable regions in its complement space. We formally define pockets as regions in the complement with limited accessibility from the outside. Pockets can be efficiently constructed by an algorithm based on alpha complexes. The algorithm is implemented and applied to proteins with known three-dimensional conformations. 1998 Published by Elsevier Science B.V. All rights reserved."}],"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17"},{"type":"conference","date_published":"1998-03-25T00:00:00Z","volume":1380,"status":"public","oa_version":"None","intvolume":"      1380","citation":{"ama":"Edelsbrunner H. Shape reconstruction with Delaunay complex. In: <i>Proceedingsof the 3rd Latin American Symposium on Theoretical Informatics</i>. Vol 1380. Springer; 1998:119-132. doi:<a href=\"https://doi.org/10.1007/BFb0054315\">10.1007/BFb0054315</a>","mla":"Edelsbrunner, Herbert. “Shape Reconstruction with Delaunay Complex.” <i>Proceedingsof the 3rd Latin American Symposium on Theoretical Informatics</i>, vol. 1380, Springer, 1998, pp. 119–32, doi:<a href=\"https://doi.org/10.1007/BFb0054315\">10.1007/BFb0054315</a>.","chicago":"Edelsbrunner, Herbert. “Shape Reconstruction with Delaunay Complex.” In <i>Proceedingsof the 3rd Latin American Symposium on Theoretical Informatics</i>, 1380:119–32. Springer, 1998. <a href=\"https://doi.org/10.1007/BFb0054315\">https://doi.org/10.1007/BFb0054315</a>.","ista":"Edelsbrunner H. 1998. Shape reconstruction with Delaunay complex. Proceedingsof the 3rd Latin American Symposium on Theoretical Informatics. LATIN: Latin American Symposium on Theoretical Informatics , LNCS, vol. 1380, 119–132.","apa":"Edelsbrunner, H. (1998). Shape reconstruction with Delaunay complex. In <i>Proceedingsof the 3rd Latin American Symposium on Theoretical Informatics</i> (Vol. 1380, pp. 119–132). Campinas, Brazil: Springer. <a href=\"https://doi.org/10.1007/BFb0054315\">https://doi.org/10.1007/BFb0054315</a>","ieee":"H. Edelsbrunner, “Shape reconstruction with Delaunay complex,” in <i>Proceedingsof the 3rd Latin American Symposium on Theoretical Informatics</i>, Campinas, Brazil, 1998, vol. 1380, pp. 119–132.","short":"H. Edelsbrunner, in:, Proceedingsof the 3rd Latin American Symposium on Theoretical Informatics, Springer, 1998, pp. 119–132."},"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","article_processing_charge":"No","abstract":[{"lang":"eng","text":"The reconstruction of a shape or surface from a finite set of points is a practically significant and theoretically challenging problem. This paper presents a unified view of algorithmic solutions proposed in the computer science literature that are based on the Delaunay complex of the points."}],"date_updated":"2022-08-25T12:22:10Z","doi":"10.1007/BFb0054315","title":"Shape reconstruction with Delaunay complex","publisher":"Springer","_id":"4015","publication":"Proceedingsof the 3rd Latin American Symposium on Theoretical Informatics","month":"03","quality_controlled":"1","extern":"1","author":[{"last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","full_name":"Edelsbrunner, Herbert"}],"conference":{"name":"LATIN: Latin American Symposium on Theoretical Informatics ","start_date":"1998-04-20","end_date":"1998-04-24","location":"Campinas, Brazil"},"page":"119 - 132","alternative_title":["LNCS"],"publication_identifier":{"isbn":["9783540642756"]},"date_created":"2018-12-11T12:06:27Z","day":"25","publication_status":"published","publist_id":"2109","language":[{"iso":"eng"}],"year":"1998"},{"conference":{"name":"Three-Dimensional Image Capture and Applications"},"alternative_title":["SPIE"],"page":"148 - 158","author":[{"first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833"},{"full_name":"Facello, Michael","first_name":"Michael","last_name":"Facello"},{"first_name":"Ping","full_name":"Fu, Ping","last_name":"Fu"},{"full_name":"Qian, Jiang","first_name":"Jiang","last_name":"Qian"},{"last_name":"Nekhayev","full_name":"Nekhayev, Dmitry","first_name":"Dmitry"}],"day":"01","publist_id":"2110","publication_status":"published","date_created":"2018-12-11T12:06:27Z","language":[{"iso":"eng"}],"year":"1998","scopus_import":"1","status":"public","date_published":"1998-01-01T00:00:00Z","type":"conference","volume":3313,"citation":{"chicago":"Edelsbrunner, Herbert, Michael Facello, Ping Fu, Jiang Qian, and Dmitry Nekhayev. “Wrapping 3D Scanning Data,” 3313:148–58. SPIE, 1998. <a href=\"https://doi.org/10.1117/12.302448\">https://doi.org/10.1117/12.302448</a>.","mla":"Edelsbrunner, Herbert, et al. <i>Wrapping 3D Scanning Data</i>. Vol. 3313, SPIE, 1998, pp. 148–58, doi:<a href=\"https://doi.org/10.1117/12.302448\">10.1117/12.302448</a>.","ama":"Edelsbrunner H, Facello M, Fu P, Qian J, Nekhayev D. Wrapping 3D scanning data. In: Vol 3313. SPIE; 1998:148-158. doi:<a href=\"https://doi.org/10.1117/12.302448\">10.1117/12.302448</a>","short":"H. Edelsbrunner, M. Facello, P. Fu, J. Qian, D. Nekhayev, in:, SPIE, 1998, pp. 148–158.","ieee":"H. Edelsbrunner, M. Facello, P. Fu, J. Qian, and D. Nekhayev, “Wrapping 3D scanning data,” presented at the Three-Dimensional Image Capture and Applications, 1998, vol. 3313, pp. 148–158.","apa":"Edelsbrunner, H., Facello, M., Fu, P., Qian, J., &#38; Nekhayev, D. (1998). Wrapping 3D scanning data (Vol. 3313, pp. 148–158). Presented at the Three-Dimensional Image Capture and Applications, SPIE. <a href=\"https://doi.org/10.1117/12.302448\">https://doi.org/10.1117/12.302448</a>","ista":"Edelsbrunner H, Facello M, Fu P, Qian J, Nekhayev D. 1998. Wrapping 3D scanning data. Three-Dimensional Image Capture and Applications, SPIE, vol. 3313, 148–158."},"intvolume":"      3313","oa_version":"None","publisher":"SPIE","date_updated":"2022-08-25T12:37:01Z","title":"Wrapping 3D scanning data","doi":"10.1117/12.302448","_id":"4016","article_processing_charge":"No","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","abstract":[{"lang":"eng","text":"Geomagic Wrap™ is a commercially available software for reconstructing shapes and surfaces from 3D scanning data. The data can be any arbitrary finite point set in 3D, and there are no requirements on local density or organization in slices etc. The software contains components for surface reconstruction, improvement, and analysis, and it supports a variety of input and output formats that make it compatible with scanning hardware and CAD and graphics software."}],"quality_controlled":"1","extern":"1","month":"01"},{"scopus_import":"1","issue":"9","publication_identifier":{"issn":["0961-8368"]},"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","abstract":[{"lang":"eng","text":"Identification and size characterization of surface pockets and occluded cavities are initial steps in protein structure-based ligand design. A new program, CAST, for automatically locating and measuring protein pockets and cavities, is based on precise computational geometry methods, including alpha shape and discrete flow theory. CAST identifies and measures pockets and pocket mouth openings, as well as cavities. The program specifies the atoms lining pockets, pocket openings. and buried cavities; the volume and area of pockets and cavities; and the area and circumference of mouth openings. CAST analysis of over 100 proteins has been carried out; proteins examined include a set of 51 monomeric enzyme-ligand structures, several elastase-inhibitor complexes, the FK506 binding protein, 30 HIV-1 protease-inhibitor complexes, and a number of small and large protein inhibitors, Medium-sized globular proteins typically have 10-20 pockets/cavities. Most often, binding sites are pockets with 1-2 mouth openings; much less frequently they are cavities. Ligand binding pockets vary widely in size, most within the range 10(2)-10(3) Angstrom(3). Statistical analysis reveals that the number of pockets and cavities is correlated with protein size, but there is no correlation between the size of the protein and the size of binding sites. Most frequently, the largest pocket/cavity is thp active site, but there are a number of instructive exceptions. Ligand volume and binding site volume are somewhat correlated when binding site volume is less than or equal to 700 Angstrom(3), but the ligand seldom occupies the entire site. Auxiliary pockets near the active site have been suggested as additional binding surface for designed ligands (Mattos C ct al., 1993, Nat Struct Biol 1:55-58). Analysis of elastase-inhibitor complexes suggests that CAST can identify ancillary pockets, suitable for recruitment in ligand design strategies. Analysis of the FK506 binding protein, and of compounds developed in SAR by NMR (Shuker SE et al.. 1996, Science 274:1531-1534), indicates that CAST pocket computation may provide a priori identification of target proteins for Linked-fragment design. CAST analysis of 30 HIV-1 protease-inhibitor complexes shows that the flexible active site pocket can vary over a range of 853-1,566 Angstrom(3), and that there are two pockets near or adjoining the active site that may be recruited for ligand design."}],"title":"Anatomy of protein pockets and cavities: Measurement of binding site geometry and implications for ligand design","_id":"4017","pmid":1,"status":"public","citation":{"ieee":"J. Liang, H. Edelsbrunner, and C. Woodward, “Anatomy of protein pockets and cavities: Measurement of binding site geometry and implications for ligand design,” <i>Protein Science</i>, vol. 7, no. 9. Wiley-Blackwell, pp. 1884–1897, 1998.","short":"J. Liang, H. Edelsbrunner, C. Woodward, Protein Science 7 (1998) 1884–1897.","apa":"Liang, J., Edelsbrunner, H., &#38; Woodward, C. (1998). Anatomy of protein pockets and cavities: Measurement of binding site geometry and implications for ligand design. <i>Protein Science</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1002/pro.5560070905\">https://doi.org/10.1002/pro.5560070905</a>","ista":"Liang J, Edelsbrunner H, Woodward C. 1998. Anatomy of protein pockets and cavities: Measurement of binding site geometry and implications for ligand design. Protein Science. 7(9), 1884–1897.","chicago":"Liang, Jie, Herbert Edelsbrunner, and Clare Woodward. “Anatomy of Protein Pockets and Cavities: Measurement of Binding Site Geometry and Implications for Ligand Design.” <i>Protein Science</i>. Wiley-Blackwell, 1998. <a href=\"https://doi.org/10.1002/pro.5560070905\">https://doi.org/10.1002/pro.5560070905</a>.","mla":"Liang, Jie, et al. “Anatomy of Protein Pockets and Cavities: Measurement of Binding Site Geometry and Implications for Ligand Design.” <i>Protein Science</i>, vol. 7, no. 9, Wiley-Blackwell, 1998, pp. 1884–97, doi:<a href=\"https://doi.org/10.1002/pro.5560070905\">10.1002/pro.5560070905</a>.","ama":"Liang J, Edelsbrunner H, Woodward C. Anatomy of protein pockets and cavities: Measurement of binding site geometry and implications for ligand design. <i>Protein Science</i>. 1998;7(9):1884-1897. doi:<a href=\"https://doi.org/10.1002/pro.5560070905\">10.1002/pro.5560070905</a>"},"intvolume":"         7","main_file_link":[{"open_access":"1","url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC2144175/"}],"year":"1998","language":[{"iso":"eng"}],"author":[{"full_name":"Liang, Jie","first_name":"Jie","last_name":"Liang"},{"full_name":"Edelsbrunner, Herbert","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833"},{"last_name":"Woodward","first_name":"Clare","full_name":"Woodward, Clare"}],"page":"1884 - 1897","date_created":"2018-12-11T12:06:27Z","day":"01","publication_status":"published","publist_id":"2111","article_processing_charge":"No","publisher":"Wiley-Blackwell","doi":"10.1002/pro.5560070905","date_updated":"2022-08-25T12:49:41Z","publication":"Protein Science","month":"09","oa":1,"quality_controlled":"1","extern":"1","type":"journal_article","date_published":"1998-09-01T00:00:00Z","volume":7,"oa_version":"Published Version","external_id":{"pmid":["9761470 "]},"article_type":"original"},{"month":"10","extern":"1","acknowledgement":"This research is partially supported by the National Science Foundation under grants CCR-96-19542 and CCR-97-12088, and by the Army Research O*ce under grant DAAG55-98-1-0177.","quality_controlled":"1","abstract":[{"text":"The construction of shape spaces is studied from a mathematical and a computational viewpoint. A program is outlined reducing the problem to four tasks: the representation of geometry, the canonical deformation of geometry, the measuring of distance in shape space, and the selection of base shapes. The technical part of this paper focuses on the second task: the specification of a deformation mixing two or more shapes in continuously, changing proportions.","lang":"eng"}],"article_processing_charge":"No","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","_id":"4019","publication":"Proceedings of the 6th Pacific Conference on Computer Graphics and Applications","title":"Shape space from deformation","date_updated":"2022-08-25T12:06:20Z","publisher":"IEEE","doi":"10.1109/PCCGA.1998.732056","oa_version":"None","citation":{"ista":"Cheng H, Edelsbrunner H, Fu P. 1998. Shape space from deformation. Proceedings of the 6th Pacific Conference on Computer Graphics and Applications. CGA: Conference on Computer Graphics and Applications , 104–113.","apa":"Cheng, H., Edelsbrunner, H., &#38; Fu, P. (1998). Shape space from deformation. In <i>Proceedings of the 6th Pacific Conference on Computer Graphics and Applications</i> (pp. 104–113). Singapore: IEEE. <a href=\"https://doi.org/10.1109/PCCGA.1998.732056\">https://doi.org/10.1109/PCCGA.1998.732056</a>","short":"H. Cheng, H. Edelsbrunner, P. Fu, in:, Proceedings of the 6th Pacific Conference on Computer Graphics and Applications, IEEE, 1998, pp. 104–113.","ieee":"H. Cheng, H. Edelsbrunner, and P. Fu, “Shape space from deformation,” in <i>Proceedings of the 6th Pacific Conference on Computer Graphics and Applications</i>, Singapore, 1998, pp. 104–113.","ama":"Cheng H, Edelsbrunner H, Fu P. Shape space from deformation. In: <i>Proceedings of the 6th Pacific Conference on Computer Graphics and Applications</i>. IEEE; 1998:104-113. doi:<a href=\"https://doi.org/10.1109/PCCGA.1998.732056\">10.1109/PCCGA.1998.732056</a>","mla":"Cheng, Ho, et al. “Shape Space from Deformation.” <i>Proceedings of the 6th Pacific Conference on Computer Graphics and Applications</i>, IEEE, 1998, pp. 104–13, doi:<a href=\"https://doi.org/10.1109/PCCGA.1998.732056\">10.1109/PCCGA.1998.732056</a>.","chicago":"Cheng, Ho, Herbert Edelsbrunner, and Ping Fu. “Shape Space from Deformation.” In <i>Proceedings of the 6th Pacific Conference on Computer Graphics and Applications</i>, 104–13. IEEE, 1998. <a href=\"https://doi.org/10.1109/PCCGA.1998.732056\">https://doi.org/10.1109/PCCGA.1998.732056</a>."},"date_published":"1998-10-01T00:00:00Z","type":"conference","status":"public","year":"1998","language":[{"iso":"eng"}],"publication_identifier":{"isbn":["0818686200"]},"date_created":"2018-12-11T12:06:28Z","publication_status":"published","publist_id":"2107","day":"01","author":[{"full_name":"Cheng, Ho","first_name":"Ho","last_name":"Cheng"},{"orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert"},{"last_name":"Fu","first_name":"Ping","full_name":"Fu, Ping"}],"page":"104 - 113","conference":{"end_date":"1998-10-29","location":"Singapore","name":"CGA: Conference on Computer Graphics and Applications ","start_date":"1998-10-26"}},{"language":[{"iso":"eng"}],"year":"1998","publication_identifier":{"isbn":["9781568810812"]},"date_created":"2018-12-11T12:06:28Z","publication_status":"published","publist_id":"2108","day":"01","author":[{"first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833"}],"page":"265 - 277","month":"10","extern":"1","quality_controlled":"1","abstract":[{"text":"Space Filing diagrams are geometric models of molecular conformations in three-dimensional space. Each atom is a location is space and a quantitative expression of influence on the immediate surrounding. This paper surveys the basic types of space filling diagrams with a focus on the dual alpha shape. Properties of those diagrams that relate to questions of connectivity, size, shape and symmetry, and metamorphosis are discussed.","lang":"eng"}],"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","article_processing_charge":"No","publication":"Robotics: The Algorithmic Perspective","_id":"4020","publisher":"AK Peters","date_updated":"2022-08-25T12:12:04Z","title":"Geometry for modeling biomolecules","oa_version":"None","citation":{"chicago":"Edelsbrunner, Herbert. “Geometry for Modeling Biomolecules.” In <i>Robotics: The Algorithmic Perspective</i>, 265–77. AK Peters, 1998.","ama":"Edelsbrunner H. Geometry for modeling biomolecules. In: <i>Robotics: The Algorithmic Perspective</i>. AK Peters; 1998:265-277.","mla":"Edelsbrunner, Herbert. “Geometry for Modeling Biomolecules.” <i>Robotics: The Algorithmic Perspective</i>, AK Peters, 1998, pp. 265–77.","ieee":"H. Edelsbrunner, “Geometry for modeling biomolecules,” in <i>Robotics: The Algorithmic Perspective</i>, AK Peters, 1998, pp. 265–277.","short":"H. Edelsbrunner, in:, Robotics: The Algorithmic Perspective, AK Peters, 1998, pp. 265–277.","ista":"Edelsbrunner H. 1998.Geometry for modeling biomolecules. In: Robotics: The Algorithmic Perspective. , 265–277.","apa":"Edelsbrunner, H. (1998). Geometry for modeling biomolecules. In <i>Robotics: The Algorithmic Perspective</i> (pp. 265–277). AK Peters."},"date_published":"1998-10-01T00:00:00Z","type":"book_chapter","status":"public"},{"publication_identifier":{"issn":["0169-5347"]},"issue":"7","citation":{"mla":"Ritchie, Mike, and Nicholas H. Barton. “Hybrids and Hybrid Zones: Reply from M.G. Ritchie and N.H. Barton.” <i>Trends in Ecology and Evolution</i>, vol. 13, no. 7, Cell Press, 1998, pp. 282–83, doi:<a href=\"https://doi.org/10.1016/S0169-5347(98)01396-2\">10.1016/S0169-5347(98)01396-2</a>.","ama":"Ritchie M, Barton NH. Hybrids and hybrid zones: Reply from M.G. Ritchie and N.H. Barton. <i>Trends in Ecology and Evolution</i>. 1998;13(7):282-283. doi:<a href=\"https://doi.org/10.1016/S0169-5347(98)01396-2\">10.1016/S0169-5347(98)01396-2</a>","chicago":"Ritchie, Mike, and Nicholas H Barton. “Hybrids and Hybrid Zones: Reply from M.G. Ritchie and N.H. Barton.” <i>Trends in Ecology and Evolution</i>. Cell Press, 1998. <a href=\"https://doi.org/10.1016/S0169-5347(98)01396-2\">https://doi.org/10.1016/S0169-5347(98)01396-2</a>.","apa":"Ritchie, M., &#38; Barton, N. H. (1998). Hybrids and hybrid zones: Reply from M.G. Ritchie and N.H. Barton. <i>Trends in Ecology and Evolution</i>. Cell Press. <a href=\"https://doi.org/10.1016/S0169-5347(98)01396-2\">https://doi.org/10.1016/S0169-5347(98)01396-2</a>","ista":"Ritchie M, Barton NH. 1998. Hybrids and hybrid zones: Reply from M.G. Ritchie and N.H. Barton. Trends in Ecology and Evolution. 13(7), 282–283.","ieee":"M. Ritchie and N. H. Barton, “Hybrids and hybrid zones: Reply from M.G. Ritchie and N.H. Barton,” <i>Trends in Ecology and Evolution</i>, vol. 13, no. 7. Cell Press, pp. 282–283, 1998.","short":"M. Ritchie, N.H. Barton, Trends in Ecology and Evolution 13 (1998) 282–283."},"intvolume":"        13","status":"public","pmid":1,"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","_id":"4280","title":"Hybrids and hybrid zones: Reply from M.G. Ritchie and N.H. Barton","date_created":"2018-12-11T12:08:01Z","publist_id":"1806","publication_status":"published","day":"01","author":[{"last_name":"Ritchie","first_name":"Mike","full_name":"Ritchie, Mike"},{"first_name":"Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","full_name":"Barton, Nicholas H","last_name":"Barton","orcid":"0000-0002-8548-5240"}],"page":"282 - 283","year":"1998","language":[{"iso":"eng"}],"external_id":{"pmid":["21238302"]},"oa_version":"None","article_type":"original","volume":13,"type":"journal_article","date_published":"1998-07-01T00:00:00Z","month":"07","extern":"1","quality_controlled":"1","article_processing_charge":"No","publication":"Trends in Ecology and Evolution","doi":"10.1016/S0169-5347(98)01396-2","date_updated":"2022-08-25T11:56:08Z","publisher":"Cell Press"},{"scopus_import":"1","issue":"5385","publication_identifier":{"issn":["0036-8075"]},"abstract":[{"lang":"eng","text":"Most higher organisms reproduce sexually, despite the automatic reproductive advantage experienced by asexual variants. This implies the operation of selective forces that confer an advantage to sexuality and genetic recombination, at either the population or individual level. The effect of sex and recombination in breaking down negative correlations between favorable variants at different genetic loci, which increases the efficiency of natural selection, is likely to be a major factor favoring their evolution and maintenance. Various processes that can cause such an effect have been studied theoretically. It has, however, so far proved hard to discriminate among them empirically. "}],"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","_id":"4281","title":"Why sex and recombination?","pmid":1,"status":"public","citation":{"chicago":"Barton, Nicholas H, and Brian Charlesworth. “Why Sex and Recombination?” <i>Science</i>. American Association for the Advancement of Science, 1998. <a href=\"https://doi.org/10.1126/science.281.5385.1986\">https://doi.org/10.1126/science.281.5385.1986</a>.","ama":"Barton NH, Charlesworth B. Why sex and recombination? <i>Science</i>. 1998;281(5385):1986-1990. doi:<a href=\"https://doi.org/10.1126/science.281.5385.1986\">10.1126/science.281.5385.1986</a>","mla":"Barton, Nicholas H., and Brian Charlesworth. “Why Sex and Recombination?” <i>Science</i>, vol. 281, no. 5385, American Association for the Advancement of Science, 1998, pp. 1986–90, doi:<a href=\"https://doi.org/10.1126/science.281.5385.1986\">10.1126/science.281.5385.1986</a>.","short":"N.H. Barton, B. Charlesworth, Science 281 (1998) 1986–1990.","ieee":"N. H. Barton and B. Charlesworth, “Why sex and recombination?,” <i>Science</i>, vol. 281, no. 5385. American Association for the Advancement of Science, pp. 1986–1990, 1998.","ista":"Barton NH, Charlesworth B. 1998. Why sex and recombination? Science. 281(5385), 1986–1990.","apa":"Barton, N. H., &#38; Charlesworth, B. (1998). Why sex and recombination? <i>Science</i>. American Association for the Advancement of Science. <a href=\"https://doi.org/10.1126/science.281.5385.1986\">https://doi.org/10.1126/science.281.5385.1986</a>"},"intvolume":"       281","language":[{"iso":"eng"}],"year":"1998","author":[{"orcid":"0000-0002-8548-5240","last_name":"Barton","full_name":"Barton, Nicholas H","first_name":"Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Charlesworth, Brian","first_name":"Brian","last_name":"Charlesworth"}],"page":"1986 - 1990","date_created":"2018-12-11T12:08:01Z","publist_id":"1804","publication_status":"published","day":"25","article_processing_charge":"No","publication":"Science","publisher":"American Association for the Advancement of Science","doi":"10.1126/science.281.5385.1986","date_updated":"2022-08-25T11:53:29Z","month":"09","extern":"1","quality_controlled":"1","volume":281,"date_published":"1998-09-25T00:00:00Z","type":"journal_article","external_id":{"pmid":["9748151"]},"article_type":"original","oa_version":"None"},{"author":[{"orcid":"0000-0002-8548-5240","last_name":"Barton","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","first_name":"Nicholas H","full_name":"Barton, Nicholas H"}],"issue":"1","page":"73 - 73","date_created":"2018-12-11T12:08:01Z","publication_identifier":{"issn":["0016-6723"]},"publist_id":"1801","publication_status":"published","day":"01","language":[{"iso":"eng"}],"year":"1998","volume":72,"date_published":"1998-08-01T00:00:00Z","type":"review","status":"public","oa_version":"None","citation":{"chicago":"Barton, Nicholas H. “Genetics and Analysis of Quantitative Traits.” <i>Genetical Research</i>. Cambridge University Press, 1998. <a href=\"https://doi.org/10.1017/S0016672398219732\">https://doi.org/10.1017/S0016672398219732</a>.","mla":"Barton, Nicholas H. “Genetics and Analysis of Quantitative Traits.” <i>Genetical Research</i>, vol. 72, no. 1, Cambridge University Press, 1998, pp. 73–73, doi:<a href=\"https://doi.org/10.1017/S0016672398219732\">10.1017/S0016672398219732</a>.","ama":"Barton NH. Genetics and analysis of quantitative traits. <i>Genetical Research</i>. 1998;72(1):73-73. doi:<a href=\"https://doi.org/10.1017/S0016672398219732\">10.1017/S0016672398219732</a>","short":"N.H. Barton, Genetical Research 72 (1998) 73–73.","ieee":"N. H. Barton, “Genetics and analysis of quantitative traits,” <i>Genetical Research</i>, vol. 72, no. 1. Cambridge University Press, pp. 73–73, 1998.","apa":"Barton, N. H. (1998). Genetics and analysis of quantitative traits. <i>Genetical Research</i>. Cambridge University Press. <a href=\"https://doi.org/10.1017/S0016672398219732\">https://doi.org/10.1017/S0016672398219732</a>","ista":"Barton NH. 1998. Genetics and analysis of quantitative traits. Genetical Research. 72(1), 73–73."},"intvolume":"        72","article_processing_charge":"No","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","publication":"Genetical Research","_id":"4282","publisher":"Cambridge University Press","date_updated":"2022-08-24T13:36:46Z","doi":"10.1017/S0016672398219732","title":"Genetics and analysis of quantitative traits","month":"08","extern":"1"},{"volume":395,"date_published":"1998-10-01T00:00:00Z","type":"review","status":"public","oa_version":"None","citation":{"ama":"Barton NH. The geometry of adaptation. <i>Nature</i>. 1998;395(6704):751-752. doi:<a href=\"https://doi.org/10.1038/27338\">10.1038/27338</a>","mla":"Barton, Nicholas H. “The Geometry of Adaptation.” <i>Nature</i>, vol. 395, no. 6704, Nature Publishing Group, 1998, pp. 751–52, doi:<a href=\"https://doi.org/10.1038/27338\">10.1038/27338</a>.","chicago":"Barton, Nicholas H. “The Geometry of Adaptation.” <i>Nature</i>. Nature Publishing Group, 1998. <a href=\"https://doi.org/10.1038/27338\">https://doi.org/10.1038/27338</a>.","ista":"Barton NH. 1998. The geometry of adaptation. Nature. 395(6704), 751–752.","apa":"Barton, N. H. (1998). The geometry of adaptation. <i>Nature</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/27338\">https://doi.org/10.1038/27338</a>","ieee":"N. H. Barton, “The geometry of adaptation,” <i>Nature</i>, vol. 395, no. 6704. Nature Publishing Group, pp. 751–752, 1998.","short":"N.H. Barton, Nature 395 (1998) 751–752."},"intvolume":"       395","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","article_processing_charge":"No","_id":"4283","publication":"Nature","doi":"10.1038/27338","date_updated":"2022-08-24T13:50:49Z","title":"The geometry of adaptation","publisher":"Nature Publishing Group","month":"10","extern":"1","quality_controlled":"1","author":[{"last_name":"Barton","orcid":"0000-0002-8548-5240","full_name":"Barton, Nicholas H","first_name":"Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87"}],"issue":"6704","page":"751 - 752","date_created":"2018-12-11T12:08:02Z","publication_identifier":{"issn":["0028-0836"]},"publication_status":"published","publist_id":"1802","day":"01","scopus_import":"1","language":[{"iso":"eng"}],"year":"1998"},{"quality_controlled":"1","extern":"1","month":"01","doi":"10.1007/BFb0055625","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","date_updated":"2022-08-24T12:15:17Z","publication":"Proceedings of the 9th Interantional Conference on Concurrency Theory","article_processing_charge":"No","oa_version":"None","date_published":"1998-01-01T00:00:00Z","type":"conference","volume":1466,"year":"1998","language":[{"iso":"eng"}],"day":"01","publist_id":"323","publication_status":"published","date_created":"2018-12-11T12:08:42Z","conference":{"end_date":"1998-09-11","location":"Nice, France","name":"CONCUR: Concurrency Theory","start_date":"1998-09-08"},"page":"219 - 236","alternative_title":["LNCS"],"author":[{"full_name":"Raskin, Jean","first_name":"Jean","last_name":"Raskin"},{"full_name":"Schobbens, Pierre","first_name":"Pierre","last_name":"Schobbens"},{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724"}],"acknowledgement":"This work is supported in part by the ONR YIP award N00014-95-1-0520, by the NSF CAREER award CCR-9501708, by the NSF grant CCR-9504469, by the DARPA/NASA grant NAG2-1214, by the ARO MURI grant DAAH-04-96-1-0341, by the SRC contract 97-DC-324.041, the Belgian National Fund for Scientific Research (FNRS), the European Commission under WGs Aspire and Fireworks, the Portuguese FCT, and by Belgacom.","title":"Axioms for real-time logics","_id":"4408","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","abstract":[{"text":"This paper presents a complete axiomatization of fully decidable propositional real-time linear temporal logics with past: the Event Clock Logic (ECL) and the Metric Interval Temporal Logic with past (MITL). The completeness proof consists of an effective proof building procedure for ECL. From this result we obtain a complete axiomatization of MITL by providing axioms translating MITL formulae into ECL formulae, the two logics being equally expressive. Our proof is structured to yield a similar axiomatization and procedure for interesting fragments of these logics, such as the linear temporal logic of the real numbers (LTR).","lang":"eng"}],"citation":{"ama":"Raskin J, Schobbens P, Henzinger TA. Axioms for real-time logics. In: <i>Proceedings of the 9th Interantional Conference on Concurrency Theory</i>. Vol 1466. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 1998:219-236. doi:<a href=\"https://doi.org/10.1007/BFb0055625\">10.1007/BFb0055625</a>","mla":"Raskin, Jean, et al. “Axioms for Real-Time Logics.” <i>Proceedings of the 9th Interantional Conference on Concurrency Theory</i>, vol. 1466, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 1998, pp. 219–36, doi:<a href=\"https://doi.org/10.1007/BFb0055625\">10.1007/BFb0055625</a>.","chicago":"Raskin, Jean, Pierre Schobbens, and Thomas A Henzinger. “Axioms for Real-Time Logics.” In <i>Proceedings of the 9th Interantional Conference on Concurrency Theory</i>, 1466:219–36. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 1998. <a href=\"https://doi.org/10.1007/BFb0055625\">https://doi.org/10.1007/BFb0055625</a>.","ista":"Raskin J, Schobbens P, Henzinger TA. 1998. Axioms for real-time logics. Proceedings of the 9th Interantional Conference on Concurrency Theory. CONCUR: Concurrency Theory, LNCS, vol. 1466, 219–236.","apa":"Raskin, J., Schobbens, P., &#38; Henzinger, T. A. (1998). Axioms for real-time logics. In <i>Proceedings of the 9th Interantional Conference on Concurrency Theory</i> (Vol. 1466, pp. 219–236). Nice, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.1007/BFb0055625\">https://doi.org/10.1007/BFb0055625</a>","short":"J. Raskin, P. Schobbens, T.A. Henzinger, in:, Proceedings of the 9th Interantional Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 1998, pp. 219–236.","ieee":"J. Raskin, P. Schobbens, and T. A. Henzinger, “Axioms for real-time logics,” in <i>Proceedings of the 9th Interantional Conference on Concurrency Theory</i>, Nice, France, 1998, vol. 1466, pp. 219–236."},"intvolume":"      1466","status":"public","scopus_import":"1","publication_identifier":{"isbn":["9783540648963"]}},{"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","abstract":[{"lang":"eng","text":"Rectangular automata are well suited for approximate modeling of continuous-discrete systems. The exact analysis of these automata is feasible for small examples but can encounter severe numerical problems for even medium-sized systems. This paper presents an analysis algorithm that uses conservative overapproximation to avoid these numerical problems. The algorithm is demonstrated on a simple benchmark system consisting of two connected tanks.\r\nSupported by the German Research Council (DFG) under grant Ko1430/3 in the special program KONDISK (‘Continuous-discrete dynamics of technical systems’)."}],"title":"An algorithm for the approximative analysis of rectangular automata","_id":"4410","acknowledgement":"This research was supported in part by the ONR YIP award N00014-95-1-0520, by the NSF CAREER award CCR-9501708, by the NSF grant CCR-9504469, by the DARPA/NASA grant NAG2-1214, by the ARO MURI grant DAAH-04-96-1-0341, and by the SRC contract 97-DC-324.041.","status":"public","intvolume":"      1486","citation":{"ieee":"J. Preußig, S. Kowalewski, H. Wong Toi, and T. A. Henzinger, “An algorithm for the approximative analysis of rectangular automata,” in <i>Proceedings of the 5th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems</i>, Lyngby, Denmark, 1998, vol. 1486, pp. 228–240.","short":"J. Preußig, S. Kowalewski, H. Wong Toi, T.A. Henzinger, in:, Proceedings of the 5th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems, Springer, 1998, pp. 228–240.","ista":"Preußig J, Kowalewski S, Wong Toi H, Henzinger TA. 1998. An algorithm for the approximative analysis of rectangular automata. Proceedings of the 5th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems. FTRTFT: Formal Techniques in Real-Time and Fault-Tolerant Systems, LNCS, vol. 1486, 228–240.","apa":"Preußig, J., Kowalewski, S., Wong Toi, H., &#38; Henzinger, T. A. (1998). An algorithm for the approximative analysis of rectangular automata. In <i>Proceedings of the 5th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems</i> (Vol. 1486, pp. 228–240). Lyngby, Denmark: Springer. <a href=\"https://doi.org/10.1007/BFb0055350\">https://doi.org/10.1007/BFb0055350</a>","chicago":"Preußig, Jörg, Stefan Kowalewski, Howard Wong Toi, and Thomas A Henzinger. “An Algorithm for the Approximative Analysis of Rectangular Automata.” In <i>Proceedings of the 5th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems</i>, 1486:228–40. Springer, 1998. <a href=\"https://doi.org/10.1007/BFb0055350\">https://doi.org/10.1007/BFb0055350</a>.","ama":"Preußig J, Kowalewski S, Wong Toi H, Henzinger TA. An algorithm for the approximative analysis of rectangular automata. In: <i>Proceedings of the 5th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems</i>. Vol 1486. Springer; 1998:228-240. doi:<a href=\"https://doi.org/10.1007/BFb0055350\">10.1007/BFb0055350</a>","mla":"Preußig, Jörg, et al. “An Algorithm for the Approximative Analysis of Rectangular Automata.” <i>Proceedings of the 5th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems</i>, vol. 1486, Springer, 1998, pp. 228–40, doi:<a href=\"https://doi.org/10.1007/BFb0055350\">10.1007/BFb0055350</a>."},"scopus_import":"1","publication_identifier":{"isbn":["9783540650034"]},"article_processing_charge":"No","doi":"10.1007/BFb0055350","date_updated":"2022-08-24T12:01:57Z","publisher":"Springer","publication":"Proceedings of the 5th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems","month":"01","quality_controlled":"1","extern":"1","type":"conference","date_published":"1998-01-01T00:00:00Z","volume":1486,"oa_version":"None","year":"1998","language":[{"iso":"eng"}],"author":[{"last_name":"Preußig","first_name":"Jörg","full_name":"Preußig, Jörg"},{"full_name":"Kowalewski, Stefan","first_name":"Stefan","last_name":"Kowalewski"},{"last_name":"Wong Toi","full_name":"Wong Toi, Howard","first_name":"Howard"},{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724"}],"conference":{"location":"Lyngby, Denmark","end_date":"1998-09-18","start_date":"1998-09-14","name":"FTRTFT: Formal Techniques in Real-Time and Fault-Tolerant Systems"},"alternative_title":["LNCS"],"page":"228 - 240","date_created":"2018-12-11T12:08:43Z","day":"01","publist_id":"320","publication_status":"published"},{"oa_version":"None","volume":1386,"type":"conference","date_published":"1998-01-01T00:00:00Z","extern":"1","quality_controlled":"1","month":"01","publication":"Proceedings of the 1st International Workshop on Hybrid Systems: Computation and Control","publisher":"Springer","doi":"10.1007/3-540-64358-3_40","date_updated":"2022-08-24T11:29:14Z","article_processing_charge":"No","publication_status":"published","publist_id":"299","day":"01","date_created":"2018-12-11T12:08:48Z","page":"190 - 204","alternative_title":["LNCS"],"conference":{"name":"HSCC: Hybrid Systems - Computation and Control","start_date":"1998-04-13","end_date":"1998-04-15","location":"Berkely, CA, United States of America"},"author":[{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724"},{"full_name":"Rusu, Vlad","first_name":"Vlad","last_name":"Rusu"}],"year":"1998","language":[{"iso":"eng"}],"intvolume":"      1386","citation":{"ama":"Henzinger TA, Rusu V. Reachability verification for hybrid automata. In: <i>Proceedings of the 1st International Workshop on Hybrid Systems: Computation and Control</i>. Vol 1386. Springer; 1998:190-204. doi:<a href=\"https://doi.org/10.1007/3-540-64358-3_40\">10.1007/3-540-64358-3_40</a>","mla":"Henzinger, Thomas A., and Vlad Rusu. “Reachability Verification for Hybrid Automata.” <i>Proceedings of the 1st International Workshop on Hybrid Systems: Computation and Control</i>, vol. 1386, Springer, 1998, pp. 190–204, doi:<a href=\"https://doi.org/10.1007/3-540-64358-3_40\">10.1007/3-540-64358-3_40</a>.","chicago":"Henzinger, Thomas A, and Vlad Rusu. “Reachability Verification for Hybrid Automata.” In <i>Proceedings of the 1st International Workshop on Hybrid Systems: Computation and Control</i>, 1386:190–204. Springer, 1998. <a href=\"https://doi.org/10.1007/3-540-64358-3_40\">https://doi.org/10.1007/3-540-64358-3_40</a>.","ista":"Henzinger TA, Rusu V. 1998. Reachability verification for hybrid automata. Proceedings of the 1st International Workshop on Hybrid Systems: Computation and Control. HSCC: Hybrid Systems - Computation and Control, LNCS, vol. 1386, 190–204.","apa":"Henzinger, T. A., &#38; Rusu, V. (1998). Reachability verification for hybrid automata. In <i>Proceedings of the 1st International Workshop on Hybrid Systems: Computation and Control</i> (Vol. 1386, pp. 190–204). Berkely, CA, United States of America: Springer. <a href=\"https://doi.org/10.1007/3-540-64358-3_40\">https://doi.org/10.1007/3-540-64358-3_40</a>","ieee":"T. A. Henzinger and V. Rusu, “Reachability verification for hybrid automata,” in <i>Proceedings of the 1st International Workshop on Hybrid Systems: Computation and Control</i>, Berkely, CA, United States of America, 1998, vol. 1386, pp. 190–204.","short":"T.A. Henzinger, V. Rusu, in:, Proceedings of the 1st International Workshop on Hybrid Systems: Computation and Control, Springer, 1998, pp. 190–204."},"status":"public","acknowledgement":"This research was supported in part by the ONR YIP award N00014-95-1-0520, by the NSF CAREER award CCR-9501708, by the NSF grant CCR-9504469, by the AFOSR contract F49620-93-1-0056, by the ARO MURI grant DAAH-04-96-1-0341, by the ARPA grant NAG2-892, and by the SRC contract 95-DC-324.036.\r\nSupported by Lavoisier grant of the French Foreign Affairs Ministry and by SRI.","_id":"4429","title":"Reachability verification for hybrid automata","abstract":[{"text":"We study the reachability problem for hybrid automata. Automatic approaches, which attempt to construct the reachable region by symbolic execution, often do not terminate. In these cases, we require the user to guess the reachable region, and we use a theorem prover (Pvs) to verify the guess. We classify hybrid automata according to the theory in which their reachable region can be defined finitely. This is the theory in which the prover needs to operate in order to verify the guess. The approach is interesting, because an appropriate guess can often be deduced by extrapolating from the first few steps of symbolic execution.","lang":"eng"}],"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","publication_identifier":{"isbn":["9783540643586"]},"scopus_import":"1"},{"alternative_title":["LNCS"],"conference":{"end_date":"1998-04-15","location":"Berkeley, CA, United States of America","name":"HSCC: Hybrid Systems: Computation and Control","start_date":"1998-04-13"},"date_created":"2018-12-11T12:08:49Z","publication_identifier":{"isbn":["978-3-540-64358-6"]},"publication_status":"published","publist_id":"300","day":"01","year":"1998","language":[{"iso":"eng"}],"volume":1386,"type":"conference_editor","date_published":"1998-01-01T00:00:00Z","status":"public","oa_version":"None","editor":[{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724","last_name":"Henzinger"}],"citation":{"apa":"Henzinger, T. A. (Ed.). (1998). <i>HSCC: Hybrid Systems—Computation and Control</i> (Vol. 1386). Presented at the HSCC: Hybrid Systems: Computation and Control, Berkeley, CA, United States of America: Springer. <a href=\"https://doi.org/10.1007/3-540-64358-3\">https://doi.org/10.1007/3-540-64358-3</a>","ista":"Henzinger TA ed. 1998. HSCC: Hybrid Systems—Computation and Control, Springer,p.","ieee":"T. A. Henzinger, Ed., <i>HSCC: Hybrid Systems—Computation and Control</i>, vol. 1386. Springer, 1998.","short":"T.A. Henzinger, ed., HSCC: Hybrid Systems—Computation and Control, Springer, 1998.","mla":"Henzinger, Thomas A., editor. <i>HSCC: Hybrid Systems—Computation and Control</i>. Vol. 1386, Springer, 1998, doi:<a href=\"https://doi.org/10.1007/3-540-64358-3\">10.1007/3-540-64358-3</a>.","ama":"Henzinger TA, ed. <i>HSCC: Hybrid Systems—Computation and Control</i>. Vol 1386. Springer; 1998. doi:<a href=\"https://doi.org/10.1007/3-540-64358-3\">10.1007/3-540-64358-3</a>","chicago":"Henzinger, Thomas A, ed. <i>HSCC: Hybrid Systems—Computation and Control</i>. Vol. 1386. Springer, 1998. <a href=\"https://doi.org/10.1007/3-540-64358-3\">https://doi.org/10.1007/3-540-64358-3</a>."},"intvolume":"      1386","article_processing_charge":"No","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","_id":"4430","publisher":"Springer","doi":"10.1007/3-540-64358-3","title":"HSCC: Hybrid Systems—Computation and Control","date_updated":"2022-08-24T11:36:03Z","month":"01","extern":"1"},{"type":"conference","date_published":"1998-01-01T00:00:00Z","volume":1522,"oa_version":"None","article_processing_charge":"No","date_updated":"2022-08-24T10:00:50Z","doi":"10.1007/3-540-49519-3_27","publisher":"Springer","publication":"Proceedings of the 2nd International Conference on Formal Methods in Computer-Aided Design","month":"01","quality_controlled":"1","extern":"1","author":[{"full_name":"Henzinger, Thomas A","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","last_name":"Henzinger"},{"last_name":"Qadeer","full_name":"Qadeer, Shaz","first_name":"Shaz"},{"first_name":"Sriram","full_name":"Rajamani, Sriram","last_name":"Rajamani"},{"first_name":"Serdar","full_name":"Tasiran, Serdar","last_name":"Tasiran"}],"conference":{"location":"Palo Alto, CA, United States of America","end_date":"1998-11-06","start_date":"1998-11-04","name":"FMCAD: Formal Methods in Computer-Aided Design"},"alternative_title":["LNCS"],"page":"421 - 432","date_created":"2018-12-11T12:09:06Z","day":"01","publist_id":"242","publication_status":"published","language":[{"iso":"eng"}],"year":"1998","status":"public","citation":{"chicago":"Henzinger, Thomas A, Shaz Qadeer, Sriram Rajamani, and Serdar Tasiran. “An Assume-Guarantee Rule for Checking Simulation.” In <i>Proceedings of the 2nd International Conference on Formal Methods in Computer-Aided Design</i>, 1522:421–32. Springer, 1998. <a href=\"https://doi.org/10.1007/3-540-49519-3_27\">https://doi.org/10.1007/3-540-49519-3_27</a>.","mla":"Henzinger, Thomas A., et al. “An Assume-Guarantee Rule for Checking Simulation.” <i>Proceedings of the 2nd International Conference on Formal Methods in Computer-Aided Design</i>, vol. 1522, Springer, 1998, pp. 421–32, doi:<a href=\"https://doi.org/10.1007/3-540-49519-3_27\">10.1007/3-540-49519-3_27</a>.","ama":"Henzinger TA, Qadeer S, Rajamani S, Tasiran S. An assume-guarantee rule for checking simulation. In: <i>Proceedings of the 2nd International Conference on Formal Methods in Computer-Aided Design</i>. Vol 1522. Springer; 1998:421-432. doi:<a href=\"https://doi.org/10.1007/3-540-49519-3_27\">10.1007/3-540-49519-3_27</a>","ieee":"T. A. Henzinger, S. Qadeer, S. Rajamani, and S. Tasiran, “An assume-guarantee rule for checking simulation,” in <i>Proceedings of the 2nd International Conference on Formal Methods in Computer-Aided Design</i>, Palo Alto, CA, United States of America, 1998, vol. 1522, pp. 421–432.","short":"T.A. Henzinger, S. Qadeer, S. Rajamani, S. Tasiran, in:, Proceedings of the 2nd International Conference on Formal Methods in Computer-Aided Design, Springer, 1998, pp. 421–432.","apa":"Henzinger, T. A., Qadeer, S., Rajamani, S., &#38; Tasiran, S. (1998). An assume-guarantee rule for checking simulation. In <i>Proceedings of the 2nd International Conference on Formal Methods in Computer-Aided Design</i> (Vol. 1522, pp. 421–432). Palo Alto, CA, United States of America: Springer. <a href=\"https://doi.org/10.1007/3-540-49519-3_27\">https://doi.org/10.1007/3-540-49519-3_27</a>","ista":"Henzinger TA, Qadeer S, Rajamani S, Tasiran S. 1998. An assume-guarantee rule for checking simulation. Proceedings of the 2nd International Conference on Formal Methods in Computer-Aided Design. FMCAD: Formal Methods in Computer-Aided Design, LNCS, vol. 1522, 421–432."},"intvolume":"      1522","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","abstract":[{"lang":"eng","text":"The simulation preorder on state transition systems is widely accepted as a useful notion of refinement, both in its own right and as an efficiently checkable sufficient condition for trace containment. For composite systems, due to the exponential explosion of the state space, there is a need for decomposing a simulation check of the form P&lt; s Q into simpler simulation checks on the components of P and Q. We present an assume-guarantee rule that enables such a decomposition. To the best of our knowledge, this is the first assume-guarantee rule that applies to a refinement relation different from trace containment. Our rule is circular, and its soundness proof requires induction on trace trees. The proof is constructive: given simulation relations that witness the simulation preorder between corresponding components of P and Q, we provide a procedure for constructing a witness relation for P&lt; s Q. We also extend our assume-guarantee rule to account for fairness assumptions on transition systems"}],"title":"An assume-guarantee rule for checking simulation","_id":"4486","acknowledgement":"This research was supported in part by the Office of Naval Research Young Investigator award N00014-95-1-0520, by the National Science Foundation CAREER award CCR-9501708, by the National Science Foundation grant CCR-9504469, by the Defense Advanced Research Projects Agency grant NAG2-1214, by the Army Research Office MURI grant DAAH-04-96-1-0341, and by the Semiconductor Research Corporation contract 97-DC-324.041.","publication_identifier":{"isbn":["9783540651918"]},"scopus_import":"1"},{"oa_version":"None","type":"conference","date_published":"1998-01-01T00:00:00Z","volume":1427,"month":"01","quality_controlled":"1","extern":"1","article_processing_charge":"No","date_updated":"2022-09-05T07:31:52Z","publisher":"Springer","doi":"10.1007/BFb0028765","publication":"Proceedings of the 10th International Conference on Computer Aided Verification","date_created":"2018-12-11T12:09:06Z","day":"01","publication_status":"published","publist_id":"239","author":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger"},{"first_name":"Shaz","full_name":"Qadeer, Shaz","last_name":"Qadeer"},{"last_name":"Rajamani","full_name":"Rajamani, Sriram","first_name":"Sriram"}],"conference":{"location":"Vancouver, Canada","end_date":"1998-07-02","start_date":"1998-06-28","name":"CAV: Computer Aided Verification"},"page":"440 - 451","alternative_title":["LNCS"],"year":"1998","language":[{"iso":"eng"}],"citation":{"short":"T.A. Henzinger, S. Qadeer, S. Rajamani, in:, Proceedings of the 10th International Conference on Computer Aided Verification, Springer, 1998, pp. 440–451.","ieee":"T. A. Henzinger, S. Qadeer, and S. Rajamani, “You assume, we guarantee: Methodology and case studies,” in <i>Proceedings of the 10th International Conference on Computer Aided Verification</i>, Vancouver, Canada, 1998, vol. 1427, pp. 440–451.","ista":"Henzinger TA, Qadeer S, Rajamani S. 1998. You assume, we guarantee: Methodology and case studies. Proceedings of the 10th International Conference on Computer Aided Verification. CAV: Computer Aided Verification, LNCS, vol. 1427, 440–451.","apa":"Henzinger, T. A., Qadeer, S., &#38; Rajamani, S. (1998). You assume, we guarantee: Methodology and case studies. In <i>Proceedings of the 10th International Conference on Computer Aided Verification</i> (Vol. 1427, pp. 440–451). Vancouver, Canada: Springer. <a href=\"https://doi.org/10.1007/BFb0028765\">https://doi.org/10.1007/BFb0028765</a>","chicago":"Henzinger, Thomas A, Shaz Qadeer, and Sriram Rajamani. “You Assume, We Guarantee: Methodology and Case Studies.” In <i>Proceedings of the 10th International Conference on Computer Aided Verification</i>, 1427:440–51. Springer, 1998. <a href=\"https://doi.org/10.1007/BFb0028765\">https://doi.org/10.1007/BFb0028765</a>.","ama":"Henzinger TA, Qadeer S, Rajamani S. You assume, we guarantee: Methodology and case studies. In: <i>Proceedings of the 10th International Conference on Computer Aided Verification</i>. Vol 1427. Springer; 1998:440-451. doi:<a href=\"https://doi.org/10.1007/BFb0028765\">10.1007/BFb0028765</a>","mla":"Henzinger, Thomas A., et al. “You Assume, We Guarantee: Methodology and Case Studies.” <i>Proceedings of the 10th International Conference on Computer Aided Verification</i>, vol. 1427, Springer, 1998, pp. 440–51, doi:<a href=\"https://doi.org/10.1007/BFb0028765\">10.1007/BFb0028765</a>."},"intvolume":"      1427","status":"public","acknowledgement":"This work is supported in part by ONR YIP award N00014-95-1-0520, by NSF CAREER award CCR-9501708, by NSF grant CCR-9504469, by ARO MURI grant DAAH-04-96-1-0341, and by the SRC contract 97-DC-324.041.","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","abstract":[{"text":"Assume-guarantee reasoning has long been advertised as an important method for decomposing proof obligations in system verification. Refinement mappings (homomorphisms) have long been advertised as an important method for solving the language-inclusion problem in practice. When confronted with large verification problems, we therefore attempted to make use of both techniques. We soon found that rather than offering instant solutions, the success of assume-guarantee reasoning depends critically on the construction of suitable abstraction modules, and the success of refinement checking depends critically on the construction of suitable witness modules. Moreover, as abstractions need to be witnessed, and witnesses abstracted, the process must be iterated. We present here the main lessons we learned from our experiments, in limn of a systematic and structured discipline for the compositional verification of reactive modules. An infrastructure to support this discipline, and automate parts of the verification, has been implemented in the tool Mocha.","lang":"eng"}],"title":"You assume, we guarantee: Methodology and case studies","_id":"4488","publication_identifier":{"isbn":["9783540646082"]},"scopus_import":"1"}]