---
_id: '4634'
abstract:
- lang: eng
  text: "A controller is an environment for a system that achieves a particular control
    objective by providing inputs to the system without constraining the choices of
    the system. For synchronous systems, where system and controller make simultaneous
    and interdependent choices, the notion that a controller must not constrain the
    choices of the system can be formalized by type systems for composability. In
    a previous paper, we solved the control problem for static and dynamic types:
    a static type is a dependency relation between inputs and outputs, and composition
    is well-typed if it does not introduce cyclic dependencies; a dynamic type is
    a set of static types, one for each state. Static and dynamic types, however,
    cannot capture many important digital circuits, such as gated clocks, bidirectional
    buses, and random-access memory. We therefore introduce more general type systems,
    so-called dependent and bidirectional types, for modeling these situations, and
    we solve the corresponding control problems.\r\nIn a system with a dependent type,
    the dependencies between inputs and outputs are determined gradually through a
    game of the system against the controller. In a system with a bidirectional type,
    also the distinction between inputs and outputs is resolved dynamically by such
    a game. The game proceeds in several rounds. In each round the system and the
    controller choose to update some variables dependent on variables that have already
    been updated. The solution of the control problem for dependent and bidirectional
    types is based on algorithms for solving these games."
acknowledgement: This research was supported in part by the SRC contract 99-TJ-683.003,
  the DARPA SEC grant F33615-C-98-3614, the MARCO GSRC grant 98-DT-660, the AFOSR
  MURI grant F49620-00-1-0327, and the NSF Theory grant CCR-9988172.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Luca
  full_name: De Alfaro, Luca
  last_name: De Alfaro
- first_name: Thomas A
  full_name: Henzinger, Thomas A
  id: 40876CD8-F248-11E8-B48F-1D18A9856A87
  last_name: Henzinger
  orcid: 0000−0002−2985−7724
- first_name: Freddy
  full_name: Mang, Freddy
  last_name: Mang
citation:
  ama: 'De Alfaro L, Henzinger TA, Mang F. The control of synchronous systems, Part
    II. In: <i>Proceedings of the 12th International Conference on on Concurrency
    Theory</i>. Vol 2154. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2001:566-581.
    doi:<a href="https://doi.org/10.1007/3-540-44685-0_38">10.1007/3-540-44685-0_38</a>'
  apa: 'De Alfaro, L., Henzinger, T. A., &#38; Mang, F. (2001). The control of synchronous
    systems, Part II. In <i>Proceedings of the 12th International Conference on on
    Concurrency Theory</i> (Vol. 2154, pp. 566–581). Aalborg, Denmark: Schloss Dagstuhl
    - Leibniz-Zentrum für Informatik. <a href="https://doi.org/10.1007/3-540-44685-0_38">https://doi.org/10.1007/3-540-44685-0_38</a>'
  chicago: De Alfaro, Luca, Thomas A Henzinger, and Freddy Mang. “The Control of Synchronous
    Systems, Part II.” In <i>Proceedings of the 12th International Conference on on
    Concurrency Theory</i>, 2154:566–81. Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
    2001. <a href="https://doi.org/10.1007/3-540-44685-0_38">https://doi.org/10.1007/3-540-44685-0_38</a>.
  ieee: L. De Alfaro, T. A. Henzinger, and F. Mang, “The control of synchronous systems,
    Part II,” in <i>Proceedings of the 12th International Conference on on Concurrency
    Theory</i>, Aalborg, Denmark, 2001, vol. 2154, pp. 566–581.
  ista: 'De Alfaro L, Henzinger TA, Mang F. 2001. The control of synchronous systems,
    Part II. Proceedings of the 12th International Conference on on Concurrency Theory.
    CONCUR: Concurrency Theory, LNCS, vol. 2154, 566–581.'
  mla: De Alfaro, Luca, et al. “The Control of Synchronous Systems, Part II.” <i>Proceedings
    of the 12th International Conference on on Concurrency Theory</i>, vol. 2154,
    Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2001, pp. 566–81, doi:<a href="https://doi.org/10.1007/3-540-44685-0_38">10.1007/3-540-44685-0_38</a>.
  short: L. De Alfaro, T.A. Henzinger, F. Mang, in:, Proceedings of the 12th International
    Conference on on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
    2001, pp. 566–581.
conference:
  end_date: 2001-08-25
  location: Aalborg, Denmark
  name: 'CONCUR: Concurrency Theory'
  start_date: 2001-08-20
date_created: 2018-12-11T12:09:52Z
date_published: 2001-08-13T00:00:00Z
date_updated: 2023-05-08T10:20:19Z
day: '13'
doi: 10.1007/3-540-44685-0_38
extern: '1'
intvolume: '      2154'
language:
- iso: eng
month: '08'
oa_version: None
page: 566 - 581
publication: Proceedings of the 12th International Conference on on Concurrency Theory
publication_identifier:
  isbn:
  - '9783540424970'
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '74'
quality_controlled: '1'
scopus_import: '1'
status: public
title: The control of synchronous systems, Part II
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 2154
year: '2001'
...
---
_id: '4635'
abstract:
- lang: eng
  text: We show how model checking techniques can be applied to the analysis of connectivity
    and cost-of-traversal properties of Web sites.
article_processing_charge: No
author:
- first_name: Luca
  full_name: De Alfaro, Luca
  last_name: De Alfaro
- first_name: Thomas A
  full_name: Henzinger, Thomas A
  id: 40876CD8-F248-11E8-B48F-1D18A9856A87
  last_name: Henzinger
  orcid: 0000−0002−2985−7724
- first_name: Freddy
  full_name: Mang, Freddy
  last_name: Mang
citation:
  ama: 'De Alfaro L, Henzinger TA, Mang F. MCWEB: A model-checking tool for web-site
    debugging. In: <i>Proceedings of the 10th International Conference on World Wide
    Web</i>. ACM; 2001:86-87.'
  apa: 'De Alfaro, L., Henzinger, T. A., &#38; Mang, F. (2001). MCWEB: A model-checking
    tool for web-site debugging. In <i>Proceedings of the 10th international conference
    on World Wide Web</i> (pp. 86–87). Hong Kong, Hong Kong: ACM.'
  chicago: 'De Alfaro, Luca, Thomas A Henzinger, and Freddy Mang. “MCWEB: A Model-Checking
    Tool for Web-Site Debugging.” In <i>Proceedings of the 10th International Conference
    on World Wide Web</i>, 86–87. ACM, 2001.'
  ieee: 'L. De Alfaro, T. A. Henzinger, and F. Mang, “MCWEB: A model-checking tool
    for web-site debugging,” in <i>Proceedings of the 10th international conference
    on World Wide Web</i>, Hong Kong, Hong Kong, 2001, pp. 86–87.'
  ista: 'De Alfaro L, Henzinger TA, Mang F. 2001. MCWEB: A model-checking tool for
    web-site debugging. Proceedings of the 10th international conference on World
    Wide Web. WWW: World Wide Web Conference, 86–87.'
  mla: 'De Alfaro, Luca, et al. “MCWEB: A Model-Checking Tool for Web-Site Debugging.”
    <i>Proceedings of the 10th International Conference on World Wide Web</i>, ACM,
    2001, pp. 86–87.'
  short: L. De Alfaro, T.A. Henzinger, F. Mang, in:, Proceedings of the 10th International
    Conference on World Wide Web, ACM, 2001, pp. 86–87.
conference:
  end_date: 2000-05-05
  location: Hong Kong, Hong Kong
  name: 'WWW: World Wide Web Conference'
  start_date: 2001-05-01
date_created: 2018-12-11T12:09:52Z
date_published: 2001-05-01T00:00:00Z
date_updated: 2023-05-08T09:39:02Z
day: '01'
extern: '1'
language:
- iso: eng
main_file_link:
- url: https://ir.webis.de/anthology/2001.wwwconf_conference-2001p.57/
month: '05'
oa_version: None
page: 86 - 87
publication: Proceedings of the 10th international conference on World Wide Web
publication_identifier:
  isbn:
  - '9781581133486'
publication_status: published
publisher: ACM
publist_id: '71'
quality_controlled: '1'
status: public
title: 'MCWEB: A model-checking tool for web-site debugging'
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
year: '2001'
...
---
_id: '4636'
abstract:
- lang: eng
  text: 'Abstract. Dynamic programs, or fixpoint iteration schemes, are useful for
    solving many problems on state spaces, including model checking on Kripke structures
    (“verification”), computing shortest paths on weighted graphs (“optimization”),
    computing the value of games played on game graphs (“control”). For Kripke structures,
    a rich fixpoint theory is available in the form of the µ-calculus. Yet few connections
    have been made between different interpretations of fixpoint algorithms. We study
    the question of when a particular fixpoint iteration scheme ϕ for verifying an
    ω-regular property Ψ on a Kripke structure can be used also for solving a two-player
    game on a game graph with winning objective Ψ. We provide a sufficient and necessary
    criterion for the answer to be affirmative in the form of an extremal-model theorem
    for games: under a game interpretation, the dynamic program ϕ solves the game
    with objective Ψ if and only if both (1) under an existential interpretation on
    Kripke structures, ϕ is equivalent to ∃Ψ, and (2) under a universal interpretation
    on Kripke structures, ϕ is equivalent to ∀Ψ. In other words, ϕ is correct on all
    two-player game graphs iff it is correct on all extremal game graphs, where one
    or the other player has no choice of moves. The theorem generalizes to quantitative
    interpretations, where it connects two-player games with costs to weighted graphs.
    While the standard translations from ω-regular properties to the µ-calculus violate
    (1) or (2), we give a translation that satisfies both conditions. Our construction,
    therefore, yields fixpoint iteration schemes that can be uniformly applied on
    Kripke structures, weighted graphs, game graphs, and game graphs with costs, in
    order to meet or optimize a given ω-regular objective.'
article_processing_charge: No
author:
- first_name: Luca
  full_name: De Alfaro, Luca
  last_name: De Alfaro
- first_name: Thomas A
  full_name: Henzinger, Thomas A
  id: 40876CD8-F248-11E8-B48F-1D18A9856A87
  last_name: Henzinger
  orcid: 0000−0002−2985−7724
- first_name: Ritankar
  full_name: Majumdar, Ritankar
  last_name: Majumdar
citation:
  ama: 'De Alfaro L, Henzinger TA, Majumdar R. From verification to control: dynamic
    programs for omega-regular objectives. In: <i>Proceedings of the 16th Annual IEEE
    Symposium on Logic in Computer Science</i>. IEEE; 2001:279-290. doi:<a href="https://doi.org/10.1109/LICS.2001.932504">10.1109/LICS.2001.932504</a>'
  apa: 'De Alfaro, L., Henzinger, T. A., &#38; Majumdar, R. (2001). From verification
    to control: dynamic programs for omega-regular objectives. In <i>Proceedings of
    the 16th Annual IEEE Symposium on Logic in Computer Science</i> (pp. 279–290).
    Boston, MA, USA: IEEE. <a href="https://doi.org/10.1109/LICS.2001.932504">https://doi.org/10.1109/LICS.2001.932504</a>'
  chicago: 'De Alfaro, Luca, Thomas A Henzinger, and Ritankar Majumdar. “From Verification
    to Control: Dynamic Programs for Omega-Regular Objectives.” In <i>Proceedings
    of the 16th Annual IEEE Symposium on Logic in Computer Science</i>, 279–90. IEEE,
    2001. <a href="https://doi.org/10.1109/LICS.2001.932504">https://doi.org/10.1109/LICS.2001.932504</a>.'
  ieee: 'L. De Alfaro, T. A. Henzinger, and R. Majumdar, “From verification to control:
    dynamic programs for omega-regular objectives,” in <i>Proceedings of the 16th
    Annual IEEE Symposium on Logic in Computer Science</i>, Boston, MA, USA, 2001,
    pp. 279–290.'
  ista: 'De Alfaro L, Henzinger TA, Majumdar R. 2001. From verification to control:
    dynamic programs for omega-regular objectives. Proceedings of the 16th Annual
    IEEE Symposium on Logic in Computer Science. LICS: Logic in Computer Science,
    279–290.'
  mla: 'De Alfaro, Luca, et al. “From Verification to Control: Dynamic Programs for
    Omega-Regular Objectives.” <i>Proceedings of the 16th Annual IEEE Symposium on
    Logic in Computer Science</i>, IEEE, 2001, pp. 279–90, doi:<a href="https://doi.org/10.1109/LICS.2001.932504">10.1109/LICS.2001.932504</a>.'
  short: L. De Alfaro, T.A. Henzinger, R. Majumdar, in:, Proceedings of the 16th Annual
    IEEE Symposium on Logic in Computer Science, IEEE, 2001, pp. 279–290.
conference:
  end_date: 2001-06-19
  location: Boston, MA, USA
  name: 'LICS: Logic in Computer Science'
  start_date: 2001-06-16
date_created: 2018-12-11T12:09:52Z
date_published: 2001-08-07T00:00:00Z
date_updated: 2023-05-08T09:48:06Z
day: '07'
doi: 10.1109/LICS.2001.932504
extern: '1'
language:
- iso: eng
month: '08'
oa_version: None
page: 279 - 290
publication: Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
publication_identifier:
  isbn:
  - 076951281X
publication_status: published
publisher: IEEE
publist_id: '72'
quality_controlled: '1'
status: public
title: 'From verification to control: dynamic programs for omega-regular objectives'
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
year: '2001'
...
---
_id: '1452'
abstract:
- lang: eng
  text: 'In this Note we present pairs of hyperkähler orbifolds which satisfy two
    different versions of mirror symmetry. On the one hand, we show that their Hodge
    numbers (or more precisely, stringy E-polynomials) are equal. On the other hand,
    we show that they satisfy the prescription of Strominger, Yau, and Zaslow (which
    in the present case goes back to Bershadsky, Johansen, Sadov and Vafa): that a
    Calabi-Yau and its mirror should fiber over the same real manifold, with special
    Lagrangian fibers which are tori dual to each other. Our examples arise as moduli
    spaces of local systems on a curve with structure group SL(n); the mirror is the
    corresponding space with structure group PGL(n). The special Lagrangian tori come
    from an algebraically completely integrable Hamiltonian system: the Hitchin system.'
acknowledgement: The authors are grateful for Nigel Hitchin for suggesting the similarity
  between [4] and [12] in 1996 and for Pierre Deligne for numerous useful comments
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Tamas
  full_name: Hausel, Tamas
  id: 4A0666D8-F248-11E8-B48F-1D18A9856A87
  last_name: Hausel
- first_name: Michael
  full_name: Thaddeus, Michael
  last_name: Thaddeus
citation:
  ama: 'Hausel T, Thaddeus M. Examples of mirror partners arising from integrable
    systems. <i>Comptes Rendus de l’Academie des Sciences - Series I: Mathematics</i>.
    2001;333(4):313-318. doi:<a href="https://doi.org/10.1016/S0764-4442(01)02057-2">10.1016/S0764-4442(01)02057-2</a>'
  apa: 'Hausel, T., &#38; Thaddeus, M. (2001). Examples of mirror partners arising
    from integrable systems. <i>Comptes Rendus de l’Academie Des Sciences - Series
    I: Mathematics</i>. Elsevier. <a href="https://doi.org/10.1016/S0764-4442(01)02057-2">https://doi.org/10.1016/S0764-4442(01)02057-2</a>'
  chicago: 'Hausel, Tamás, and Michael Thaddeus. “Examples of Mirror Partners Arising
    from Integrable Systems.” <i>Comptes Rendus de l’Academie Des Sciences - Series
    I: Mathematics</i>. Elsevier, 2001. <a href="https://doi.org/10.1016/S0764-4442(01)02057-2">https://doi.org/10.1016/S0764-4442(01)02057-2</a>.'
  ieee: 'T. Hausel and M. Thaddeus, “Examples of mirror partners arising from integrable
    systems,” <i>Comptes Rendus de l’Academie des Sciences - Series I: Mathematics</i>,
    vol. 333, no. 4. Elsevier, pp. 313–318, 2001.'
  ista: 'Hausel T, Thaddeus M. 2001. Examples of mirror partners arising from integrable
    systems. Comptes Rendus de l’Academie des Sciences - Series I: Mathematics. 333(4),
    313–318.'
  mla: 'Hausel, Tamás, and Michael Thaddeus. “Examples of Mirror Partners Arising
    from Integrable Systems.” <i>Comptes Rendus de l’Academie Des Sciences - Series
    I: Mathematics</i>, vol. 333, no. 4, Elsevier, 2001, pp. 313–18, doi:<a href="https://doi.org/10.1016/S0764-4442(01)02057-2">10.1016/S0764-4442(01)02057-2</a>.'
  short: 'T. Hausel, M. Thaddeus, Comptes Rendus de l’Academie Des Sciences - Series
    I: Mathematics 333 (2001) 313–318.'
date_created: 2018-12-11T11:52:06Z
date_published: 2001-08-15T00:00:00Z
date_updated: 2023-05-31T09:57:48Z
day: '15'
doi: 10.1016/S0764-4442(01)02057-2
extern: '1'
external_id:
  arxiv:
  - math/0106140
intvolume: '       333'
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: http://arxiv.org/abs/math/0106140
month: '08'
oa: 1
oa_version: Preprint
page: 313 - 318
publication: 'Comptes Rendus de l''Academie des Sciences - Series I: Mathematics'
publication_identifier:
  issn:
  - 0764-4442
publication_status: published
publisher: Elsevier
publist_id: '5742'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Examples of mirror partners arising from integrable systems
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 333
year: '2001'
...
---
_id: '1453'
abstract:
- lang: eng
  text: In this Letter we exhibit a one-parameter family of new Taub-NUT instantons
    parameterized by a half-line. The endpoint of the half-line will be the reducible
    Yang-Mills instanton corresponding to the Eguchi-Hanson-Gibbons L2 harmonic 2-form,
    while at an inner point we recover the Pope-Yuille instanton constructed as a
    projection of the Levi-Civitá connection onto the positive su(2)+ ⊂ so(4) subalgebra.
    Our method imitates the Jackiw-Nohl-Rebbi construction originally designed for
    flat R4. That is we find a one-parameter family of harmonic functions on the Taub-NUT
    space with a point singularity, rescale the metric and project the obtained Levi-Civitá
    connection onto the other negative su(2)- ⊂ so(4) part. Our solutions will possess
    the full U(2) symmetry, and thus provide more solutions to the recently proposed
    U(2) symmetric ansatz of Kim and Yoon.
acknowledgement: We would like to acknowledge the financial support provided by the
  Miller Institute of Basic Research in Science, the Japan Society for the Promotion
  of Science, grant No. P99736 and the partial support by OTKA grant No. T032478.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Gábor
  full_name: Etesi, Gábor
  last_name: Etesi
- first_name: Tamas
  full_name: Hausel, Tamas
  id: 4A0666D8-F248-11E8-B48F-1D18A9856A87
  last_name: Hausel
citation:
  ama: 'Etesi G, Hausel T. Geometric construction of new Yang-Mills instantons over
    Taub-NUT space. <i>Physics Letters, Section B: Nuclear, Elementary Particle and
    High-Energy Physics</i>. 2001;514(1-2):189-199. doi:<a href="https://doi.org/10.1016/S0370-2693(01)00821-8">10.1016/S0370-2693(01)00821-8</a>'
  apa: 'Etesi, G., &#38; Hausel, T. (2001). Geometric construction of new Yang-Mills
    instantons over Taub-NUT space. <i>Physics Letters, Section B: Nuclear, Elementary
    Particle and High-Energy Physics</i>. Elsevier. <a href="https://doi.org/10.1016/S0370-2693(01)00821-8">https://doi.org/10.1016/S0370-2693(01)00821-8</a>'
  chicago: 'Etesi, Gábor, and Tamás Hausel. “Geometric Construction of New Yang-Mills
    Instantons over Taub-NUT Space.” <i>Physics Letters, Section B: Nuclear, Elementary
    Particle and High-Energy Physics</i>. Elsevier, 2001. <a href="https://doi.org/10.1016/S0370-2693(01)00821-8">https://doi.org/10.1016/S0370-2693(01)00821-8</a>.'
  ieee: 'G. Etesi and T. Hausel, “Geometric construction of new Yang-Mills instantons
    over Taub-NUT space,” <i>Physics Letters, Section B: Nuclear, Elementary Particle
    and High-Energy Physics</i>, vol. 514, no. 1–2. Elsevier, pp. 189–199, 2001.'
  ista: 'Etesi G, Hausel T. 2001. Geometric construction of new Yang-Mills instantons
    over Taub-NUT space. Physics Letters, Section B: Nuclear, Elementary Particle
    and High-Energy Physics. 514(1–2), 189–199.'
  mla: 'Etesi, Gábor, and Tamás Hausel. “Geometric Construction of New Yang-Mills
    Instantons over Taub-NUT Space.” <i>Physics Letters, Section B: Nuclear, Elementary
    Particle and High-Energy Physics</i>, vol. 514, no. 1–2, Elsevier, 2001, pp. 189–99,
    doi:<a href="https://doi.org/10.1016/S0370-2693(01)00821-8">10.1016/S0370-2693(01)00821-8</a>.'
  short: 'G. Etesi, T. Hausel, Physics Letters, Section B: Nuclear, Elementary Particle
    and High-Energy Physics 514 (2001) 189–199.'
date_created: 2018-12-11T11:52:07Z
date_published: 2001-08-09T00:00:00Z
date_updated: 2023-05-31T11:51:37Z
day: '09'
doi: 10.1016/S0370-2693(01)00821-8
extern: '1'
external_id:
  arxiv:
  - hep-th/0105118
intvolume: '       514'
issue: 1-2
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: http://arxiv.org/abs/hep-th/0105118
month: '08'
oa: 1
oa_version: Preprint
page: 189 - 199
publication: 'Physics Letters, Section B: Nuclear, Elementary Particle and High-Energy
  Physics'
publication_identifier:
  issn:
  - 0370-2693
publication_status: published
publisher: Elsevier
publist_id: '5743'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Geometric construction of new Yang-Mills instantons over Taub-NUT space
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 514
year: '2001'
...
---
_id: '1454'
abstract:
- lang: eng
  text: We address the problem of finding Abelian instantons of finite energy on the
    Euclidean Schwarzschild manifold. This amounts to construct self-dual L2 harmonic
    2-forms on the space. Gibbons found a non-topological L2 harmonic form in the
    Taub-NUT metric, leading to Abelian instantons with continuous energy. We imitate
    his construction in the case of the Euclidean Schwarzschild manifold and find
    a non-topological self-dual L2 harmonic 2-form on it. We show how this gives rise
    to Abelian instantons and identify them with SU(2)-instantons of Pontryagin number
    2n2 found by Charap and Duff in 1977. Using results of Dodziuk and Hitchin we
    also calculate the full L2 harmonic space for the Euclidean Schwarzschild manifold.
acknowledgement: The work in this paper was done when Tamás Hausel visited the Yukawa
  Institute of Kyoto University in February 2000. We are grateful for Prof. G.W. Gibbons
  for insightful discussions and Prof. H. Kodama and the Yukawa Institute for the
  invitation and hospitality.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Gábor
  full_name: Etesi, Gábor
  last_name: Etesi
- first_name: Tamas
  full_name: Hausel, Tamas
  id: 4A0666D8-F248-11E8-B48F-1D18A9856A87
  last_name: Hausel
citation:
  ama: Etesi G, Hausel T. Geometric interpretation of Schwarzschild instantons. <i>Journal
    of Geometry and Physics</i>. 2001;37(1-2):126-136. doi:<a href="https://doi.org/10.1016/S0393-0440(00)00040-1">10.1016/S0393-0440(00)00040-1</a>
  apa: Etesi, G., &#38; Hausel, T. (2001). Geometric interpretation of Schwarzschild
    instantons. <i>Journal of Geometry and Physics</i>. Elsevier. <a href="https://doi.org/10.1016/S0393-0440(00)00040-1">https://doi.org/10.1016/S0393-0440(00)00040-1</a>
  chicago: Etesi, Gábor, and Tamás Hausel. “Geometric Interpretation of Schwarzschild
    Instantons.” <i>Journal of Geometry and Physics</i>. Elsevier, 2001. <a href="https://doi.org/10.1016/S0393-0440(00)00040-1">https://doi.org/10.1016/S0393-0440(00)00040-1</a>.
  ieee: G. Etesi and T. Hausel, “Geometric interpretation of Schwarzschild instantons,”
    <i>Journal of Geometry and Physics</i>, vol. 37, no. 1–2. Elsevier, pp. 126–136,
    2001.
  ista: Etesi G, Hausel T. 2001. Geometric interpretation of Schwarzschild instantons.
    Journal of Geometry and Physics. 37(1–2), 126–136.
  mla: Etesi, Gábor, and Tamás Hausel. “Geometric Interpretation of Schwarzschild
    Instantons.” <i>Journal of Geometry and Physics</i>, vol. 37, no. 1–2, Elsevier,
    2001, pp. 126–36, doi:<a href="https://doi.org/10.1016/S0393-0440(00)00040-1">10.1016/S0393-0440(00)00040-1</a>.
  short: G. Etesi, T. Hausel, Journal of Geometry and Physics 37 (2001) 126–136.
date_created: 2018-12-11T11:52:07Z
date_published: 2001-01-01T00:00:00Z
date_updated: 2023-05-31T12:08:45Z
day: '01'
doi: 10.1016/S0393-0440(00)00040-1
extern: '1'
external_id:
  arxiv:
  - hep-th/0003239
intvolume: '        37'
issue: 1-2
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: http://arxiv.org/abs/hep-th/0003239
month: '01'
oa: 1
oa_version: Preprint
page: 126 - 136
publication: Journal of Geometry and Physics
publication_identifier:
  issn:
  - 0393-0440
publication_status: published
publisher: Elsevier
publist_id: '5744'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Geometric interpretation of Schwarzschild instantons
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 37
year: '2001'
...
---
_id: '9444'
abstract:
- lang: eng
  text: Epigenetic silenced alleles of the Arabidopsis SUPERMANlocus (the clark kent
    alleles) are associated with dense hypermethylation at noncanonical cytosines
    (CpXpG and asymmetric sites, where X = A, T, C, or G). A genetic screen for suppressors
    of a hypermethylated clark kent mutant identified nine loss-of-function alleles
    of CHROMOMETHYLASE3(CMT3), a novel cytosine methyltransferase homolog. These cmt3
    mutants display a wild-type morphology but exhibit decreased CpXpG methylation
    of the SUP gene and of other sequences throughout the genome. They also show reactivated
    expression of endogenous retrotransposon sequences. These results show that a
    non-CpG DNA methyltransferase is responsible for maintaining epigenetic gene silencing.
article_processing_charge: No
article_type: original
author:
- first_name: A. M.
  full_name: Lindroth, A. M.
  last_name: Lindroth
- first_name: Xiaofeng
  full_name: Cao, Xiaofeng
  last_name: Cao
- first_name: James P.
  full_name: Jackson, James P.
  last_name: Jackson
- first_name: Daniel
  full_name: Zilberman, Daniel
  id: 6973db13-dd5f-11ea-814e-b3e5455e9ed1
  last_name: Zilberman
  orcid: 0000-0002-0123-8649
- first_name: Claire M.
  full_name: McCallum, Claire M.
  last_name: McCallum
- first_name: Steven
  full_name: Henikoff, Steven
  last_name: Henikoff
- first_name: Steven E.
  full_name: Jacobsen, Steven E.
  last_name: Jacobsen
citation:
  ama: Lindroth AM, Cao X, Jackson JP, et al. Requirement of CHROMOMETHYLASE3 for
    maintenance of CpXpG methylation. <i>Science</i>. 2001;292(5524):2077-2080. doi:<a
    href="https://doi.org/10.1126/science.1059745">10.1126/science.1059745</a>
  apa: Lindroth, A. M., Cao, X., Jackson, J. P., Zilberman, D., McCallum, C. M., Henikoff,
    S., &#38; Jacobsen, S. E. (2001). Requirement of CHROMOMETHYLASE3 for maintenance
    of CpXpG methylation. <i>Science</i>. American Association for the Advancement
    of Science. <a href="https://doi.org/10.1126/science.1059745">https://doi.org/10.1126/science.1059745</a>
  chicago: Lindroth, A. M., Xiaofeng Cao, James P. Jackson, Daniel Zilberman, Claire
    M. McCallum, Steven Henikoff, and Steven E. Jacobsen. “Requirement of CHROMOMETHYLASE3
    for Maintenance of CpXpG Methylation.” <i>Science</i>. American Association for
    the Advancement of Science, 2001. <a href="https://doi.org/10.1126/science.1059745">https://doi.org/10.1126/science.1059745</a>.
  ieee: A. M. Lindroth <i>et al.</i>, “Requirement of CHROMOMETHYLASE3 for maintenance
    of CpXpG methylation,” <i>Science</i>, vol. 292, no. 5524. American Association
    for the Advancement of Science, pp. 2077–2080, 2001.
  ista: Lindroth AM, Cao X, Jackson JP, Zilberman D, McCallum CM, Henikoff S, Jacobsen
    SE. 2001. Requirement of CHROMOMETHYLASE3 for maintenance of CpXpG methylation.
    Science. 292(5524), 2077–2080.
  mla: Lindroth, A. M., et al. “Requirement of CHROMOMETHYLASE3 for Maintenance of
    CpXpG Methylation.” <i>Science</i>, vol. 292, no. 5524, American Association for
    the Advancement of Science, 2001, pp. 2077–80, doi:<a href="https://doi.org/10.1126/science.1059745">10.1126/science.1059745</a>.
  short: A.M. Lindroth, X. Cao, J.P. Jackson, D. Zilberman, C.M. McCallum, S. Henikoff,
    S.E. Jacobsen, Science 292 (2001) 2077–2080.
date_created: 2021-06-02T13:35:16Z
date_published: 2001-06-15T00:00:00Z
date_updated: 2021-12-14T08:40:32Z
day: '15'
department:
- _id: DaZi
doi: 10.1126/science.1059745
extern: '1'
external_id:
  pmid:
  - '11349138'
intvolume: '       292'
issue: '5524'
keyword:
- Multidisciplinary
language:
- iso: eng
month: '06'
oa_version: None
page: 2077-2080
pmid: 1
publication: Science
publication_identifier:
  eissn:
  - 1095-9203
  issn:
  - 0036-8075
publication_status: published
publisher: American Association for the Advancement of Science
quality_controlled: '1'
scopus_import: '1'
status: public
title: Requirement of CHROMOMETHYLASE3 for maintenance of CpXpG methylation
type: journal_article
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 292
year: '2001'
...
---
_id: '11892'
abstract:
- lang: eng
  text: "We present the first fully dynamic algorithm for maintaining a minimum spanning
    forest in time \U0001D45C(\U0001D45B√) per operation. To be precise, the algorithm
    uses O(n1/3 log n) amortized time per update operation. The algorithm is fairly
    simple and deterministic. An immediate consequence is the first fully dynamic
    deterministic algorithm for maintaining connectivity and bipartiteness in amortized
    time O(n1/3 log n) per update, with O(1) worst case time per query."
article_processing_charge: No
article_type: original
author:
- first_name: Monika H
  full_name: Henzinger, Monika H
  id: 540c9bbd-f2de-11ec-812d-d04a5be85630
  last_name: Henzinger
  orcid: 0000-0002-5008-6530
- first_name: Valerie
  full_name: King, Valerie
  last_name: King
citation:
  ama: Henzinger MH, King V. Maintaining minimum spanning forests in dynamic graphs.
    <i>SIAM Journal on Computing</i>. 2001;31(2):364-374. doi:<a href="https://doi.org/10.1137/s0097539797327209">10.1137/s0097539797327209</a>
  apa: Henzinger, M. H., &#38; King, V. (2001). Maintaining minimum spanning forests
    in dynamic graphs. <i>SIAM Journal on Computing</i>. Society for Industrial &#38;
    Applied Mathematics. <a href="https://doi.org/10.1137/s0097539797327209">https://doi.org/10.1137/s0097539797327209</a>
  chicago: Henzinger, Monika H, and Valerie King. “Maintaining Minimum Spanning Forests
    in Dynamic Graphs.” <i>SIAM Journal on Computing</i>. Society for Industrial &#38;
    Applied Mathematics, 2001. <a href="https://doi.org/10.1137/s0097539797327209">https://doi.org/10.1137/s0097539797327209</a>.
  ieee: M. H. Henzinger and V. King, “Maintaining minimum spanning forests in dynamic
    graphs,” <i>SIAM Journal on Computing</i>, vol. 31, no. 2. Society for Industrial
    &#38; Applied Mathematics, pp. 364–374, 2001.
  ista: Henzinger MH, King V. 2001. Maintaining minimum spanning forests in dynamic
    graphs. SIAM Journal on Computing. 31(2), 364–374.
  mla: Henzinger, Monika H., and Valerie King. “Maintaining Minimum Spanning Forests
    in Dynamic Graphs.” <i>SIAM Journal on Computing</i>, vol. 31, no. 2, Society
    for Industrial &#38; Applied Mathematics, 2001, pp. 364–74, doi:<a href="https://doi.org/10.1137/s0097539797327209">10.1137/s0097539797327209</a>.
  short: M.H. Henzinger, V. King, SIAM Journal on Computing 31 (2001) 364–374.
date_created: 2022-08-17T08:43:43Z
date_published: 2001-03-01T00:00:00Z
date_updated: 2023-02-17T14:24:55Z
day: '01'
doi: 10.1137/s0097539797327209
extern: '1'
intvolume: '        31'
issue: '2'
language:
- iso: eng
month: '03'
oa_version: None
page: 364-374
publication: SIAM Journal on Computing
publication_identifier:
  eissn:
  - 1095-7111
  issn:
  - 0097-5397
publication_status: published
publisher: Society for Industrial & Applied Mathematics
quality_controlled: '1'
scopus_import: '1'
status: public
title: Maintaining minimum spanning forests in dynamic graphs
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 31
year: '2001'
...
---
_id: '11914'
abstract:
- lang: eng
  text: 'Previous studies of the Web graph structure have focused on the graph structure
    at the level of individual pages. In actuality the Web is a hierarchically nested
    graph, with domains, hosts and Web sites introducing intermediate levels of affiliation
    and administrative control. To better understand the growth of the Web we need
    to understand its macro-structure, in terms of the linkage between Web sites.
    We approximate this by studying the graph of the linkage between hosts on the
    Web. This was done based on snapshots of the Web taken by Google in Oct 1999,
    Aug 2000 and Jun 2001. The connectivity between hosts is represented by a directed
    graph, with hosts as nodes and weighted edges representing the count of hyperlinks
    between pages on the corresponding hosts. We demonstrate how such a "hostgraph"
    can be used to study connectivity properties of hosts and domains over time, and
    discuss a modified "copy model" to explain observed link weight distributions
    as a function of subgraph size. We discuss changes in the Web over time in the
    size and connectivity of Web sites and country domains. We also describe a data
    mining application of the hostgraph: a related host finding algorithm which achieves
    a precision of 0.65 at rank 3.'
article_processing_charge: No
author:
- first_name: K.
  full_name: Bharat, K.
  last_name: Bharat
- first_name: Bay-Wei
  full_name: Chang, Bay-Wei
  last_name: Chang
- first_name: Monika H
  full_name: Henzinger, Monika H
  id: 540c9bbd-f2de-11ec-812d-d04a5be85630
  last_name: Henzinger
  orcid: 0000-0002-5008-6530
- first_name: M.
  full_name: Ruhl, M.
  last_name: Ruhl
citation:
  ama: 'Bharat K, Chang B-W, Henzinger MH, Ruhl M. Who links to whom: Mining linkage
    between Web sites. In: <i>1st IEEE International Conference on Data Mining</i>.
    Institute of Electrical and Electronics Engineers; 2001:51-58. doi:<a href="https://doi.org/10.1109/ICDM.2001.989500">10.1109/ICDM.2001.989500</a>'
  apa: 'Bharat, K., Chang, B.-W., Henzinger, M. H., &#38; Ruhl, M. (2001). Who links
    to whom: Mining linkage between Web sites. In <i>1st IEEE International Conference
    on Data Mining</i> (pp. 51–58). San Jose, CA, United States: Institute of Electrical
    and Electronics Engineers. <a href="https://doi.org/10.1109/ICDM.2001.989500">https://doi.org/10.1109/ICDM.2001.989500</a>'
  chicago: 'Bharat, K., Bay-Wei Chang, Monika H Henzinger, and M. Ruhl. “Who Links
    to Whom: Mining Linkage between Web Sites.” In <i>1st IEEE International Conference
    on Data Mining</i>, 51–58. Institute of Electrical and Electronics Engineers,
    2001. <a href="https://doi.org/10.1109/ICDM.2001.989500">https://doi.org/10.1109/ICDM.2001.989500</a>.'
  ieee: 'K. Bharat, B.-W. Chang, M. H. Henzinger, and M. Ruhl, “Who links to whom:
    Mining linkage between Web sites,” in <i>1st IEEE International Conference on
    Data Mining</i>, San Jose, CA, United States, 2001, pp. 51–58.'
  ista: 'Bharat K, Chang B-W, Henzinger MH, Ruhl M. 2001. Who links to whom: Mining
    linkage between Web sites. 1st IEEE International Conference on Data Mining. ICMD:
    International Conference on Data Mining, 51–58.'
  mla: 'Bharat, K., et al. “Who Links to Whom: Mining Linkage between Web Sites.”
    <i>1st IEEE International Conference on Data Mining</i>, Institute of Electrical
    and Electronics Engineers, 2001, pp. 51–58, doi:<a href="https://doi.org/10.1109/ICDM.2001.989500">10.1109/ICDM.2001.989500</a>.'
  short: K. Bharat, B.-W. Chang, M.H. Henzinger, M. Ruhl, in:, 1st IEEE International
    Conference on Data Mining, Institute of Electrical and Electronics Engineers,
    2001, pp. 51–58.
conference:
  end_date: 2001-12-02
  location: San Jose, CA, United States
  name: 'ICMD: International Conference on Data Mining'
  start_date: 2001-11-29
date_created: 2022-08-18T07:12:46Z
date_published: 2001-12-01T00:00:00Z
date_updated: 2023-02-17T09:59:47Z
day: '01'
doi: 10.1109/ICDM.2001.989500
extern: '1'
language:
- iso: eng
month: '12'
oa_version: None
page: 51-58
publication: 1st IEEE International Conference on Data Mining
publication_identifier:
  isbn:
  - 0-7695-1119-8
  issn:
  - '15504786'
publication_status: published
publisher: Institute of Electrical and Electronics Engineers
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Who links to whom: Mining linkage between Web sites'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2001'
...
---
_id: '3434'
abstract:
- lang: eng
  text: "This chapter contains sections titled:\r\n\r\nIntroduction\r\n\r\n- History\r\n\r\n-
    Developing an Intuition of Likelihood\r\n\r\n- Method of Maximum Likelihood\r\n\r\n-
    Bayesian Inference\r\n\r\n- Markov Chain Monte Carlo\r\n\r\n- Assessing Uncertainty
    of Phylogenies\r\n\r\n- Hypothesis Testing and Model Choice\r\n\r\n- Comparative
    Analysis\r\n\r\n- Conclusions\r\n\r\n- References"
article_processing_charge: No
author:
- first_name: John
  full_name: Huelsenbeck, John
  last_name: Huelsenbeck
- first_name: Jonathan P
  full_name: Bollback, Jonathan P
  id: 2C6FA9CC-F248-11E8-B48F-1D18A9856A87
  last_name: Bollback
  orcid: 0000-0002-4624-4612
citation:
  ama: 'Huelsenbeck J, Bollback JP. Application of the likelihood function in phylogenetic
    analysis. In: Balding D, Bishop M, Cannings C, eds. <i>Handbook of Statistical
    Genetics</i>. Wiley-Blackwell; 2001:415-439. doi:<a href="https://doi.org/10.1002/9780470061619.ch15">10.1002/9780470061619.ch15</a>'
  apa: Huelsenbeck, J., &#38; Bollback, J. P. (2001). Application of the likelihood
    function in phylogenetic analysis. In D. Balding, M. Bishop, &#38; C. Cannings
    (Eds.), <i>Handbook of Statistical Genetics</i> (pp. 415–439). Wiley-Blackwell.
    <a href="https://doi.org/10.1002/9780470061619.ch15">https://doi.org/10.1002/9780470061619.ch15</a>
  chicago: Huelsenbeck, John, and Jonathan P Bollback. “Application of the Likelihood
    Function in Phylogenetic Analysis.” In <i>Handbook of Statistical Genetics</i>,
    edited by David Balding, Martin Bishop, and Chriss Cannings, 415–39. Wiley-Blackwell,
    2001. <a href="https://doi.org/10.1002/9780470061619.ch15">https://doi.org/10.1002/9780470061619.ch15</a>.
  ieee: J. Huelsenbeck and J. P. Bollback, “Application of the likelihood function
    in phylogenetic analysis,” in <i>Handbook of Statistical Genetics</i>, D. Balding,
    M. Bishop, and C. Cannings, Eds. Wiley-Blackwell, 2001, pp. 415–439.
  ista: 'Huelsenbeck J, Bollback JP. 2001.Application of the likelihood function in
    phylogenetic analysis. In: Handbook of Statistical Genetics. , 415–439.'
  mla: Huelsenbeck, John, and Jonathan P. Bollback. “Application of the Likelihood
    Function in Phylogenetic Analysis.” <i>Handbook of Statistical Genetics</i>, edited
    by David Balding et al., Wiley-Blackwell, 2001, pp. 415–39, doi:<a href="https://doi.org/10.1002/9780470061619.ch15">10.1002/9780470061619.ch15</a>.
  short: J. Huelsenbeck, J.P. Bollback, in:, D. Balding, M. Bishop, C. Cannings (Eds.),
    Handbook of Statistical Genetics, Wiley-Blackwell, 2001, pp. 415–439.
date_created: 2018-12-11T12:03:19Z
date_published: 2001-01-01T00:00:00Z
date_updated: 2023-05-15T14:43:39Z
day: '01'
doi: 10.1002/9780470061619.ch15
editor:
- first_name: David
  full_name: Balding, David
  last_name: Balding
- first_name: Martin
  full_name: Bishop, Martin
  last_name: Bishop
- first_name: Chriss
  full_name: Cannings, Chriss
  last_name: Cannings
extern: '1'
language:
- iso: eng
month: '01'
oa_version: None
page: 415 - 439
publication: Handbook of Statistical Genetics
publication_identifier:
  isbn:
  - '9781119429142 '
publication_status: published
publisher: Wiley-Blackwell
publist_id: '2966'
quality_controlled: '1'
status: public
title: Application of the likelihood function in phylogenetic analysis
type: book_chapter
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
year: '2001'
...
---
_id: '3438'
abstract:
- lang: eng
  text: As a discipline, phylogenetics is becoming transformed by a flood of molecular
    data. These data allow broad questions to be asked about the history of life,
    but also present difficult statistical and computational problems. Bayesian inference
    of phylogeny brings a new perspective to a number of outstanding issues in evolutionary
    biology, including the analysis of large phylogenetic trees and complex evolutionary
    models and the detection of the footprint of natural selection in DNA sequences.
article_processing_charge: No
author:
- first_name: John
  full_name: Huelsenbeck, John
  last_name: Huelsenbeck
- first_name: Fredrik
  full_name: Ronquist, Fredrik
  last_name: Ronquist
- first_name: Rasmus
  full_name: Nielsen, Rasmus
  last_name: Nielsen
- first_name: Jonathan P
  full_name: Bollback, Jonathan P
  id: 2C6FA9CC-F248-11E8-B48F-1D18A9856A87
  last_name: Bollback
  orcid: 0000-0002-4624-4612
citation:
  ama: Huelsenbeck J, Ronquist F, Nielsen R, Bollback JP. Bayesian inference of phylogeny
    and its impact on evolutionary biology. <i>Science</i>. 2001;294(5550):2310-2314.
    doi:<a href="https://doi.org/10.1126/science.1065889">10.1126/science.1065889</a>
  apa: Huelsenbeck, J., Ronquist, F., Nielsen, R., &#38; Bollback, J. P. (2001). Bayesian
    inference of phylogeny and its impact on evolutionary biology. <i>Science</i>.
    American Association for the Advancement of Science. <a href="https://doi.org/10.1126/science.1065889">https://doi.org/10.1126/science.1065889</a>
  chicago: Huelsenbeck, John, Fredrik Ronquist, Rasmus Nielsen, and Jonathan P Bollback.
    “Bayesian Inference of Phylogeny and Its Impact on Evolutionary Biology.” <i>Science</i>.
    American Association for the Advancement of Science, 2001. <a href="https://doi.org/10.1126/science.1065889">https://doi.org/10.1126/science.1065889</a>.
  ieee: J. Huelsenbeck, F. Ronquist, R. Nielsen, and J. P. Bollback, “Bayesian inference
    of phylogeny and its impact on evolutionary biology,” <i>Science</i>, vol. 294,
    no. 5550. American Association for the Advancement of Science, pp. 2310–2314,
    2001.
  ista: Huelsenbeck J, Ronquist F, Nielsen R, Bollback JP. 2001. Bayesian inference
    of phylogeny and its impact on evolutionary biology. Science. 294(5550), 2310–2314.
  mla: Huelsenbeck, John, et al. “Bayesian Inference of Phylogeny and Its Impact on
    Evolutionary Biology.” <i>Science</i>, vol. 294, no. 5550, American Association
    for the Advancement of Science, 2001, pp. 2310–14, doi:<a href="https://doi.org/10.1126/science.1065889">10.1126/science.1065889</a>.
  short: J. Huelsenbeck, F. Ronquist, R. Nielsen, J.P. Bollback, Science 294 (2001)
    2310–2314.
date_created: 2018-12-11T12:03:20Z
date_published: 2001-12-14T00:00:00Z
date_updated: 2023-05-15T14:10:13Z
day: '14'
doi: 10.1126/science.1065889
extern: '1'
external_id:
  pmid:
  - '11743192 '
intvolume: '       294'
issue: '5550'
language:
- iso: eng
month: '12'
oa_version: None
page: 2310 - 2314
pmid: 1
publication: Science
publication_identifier:
  issn:
  - 0036-8075
publication_status: published
publisher: American Association for the Advancement of Science
publist_id: '2962'
quality_controlled: '1'
status: public
title: Bayesian inference of phylogeny and its impact on evolutionary biology
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 294
year: '2001'
...
---
_id: '3439'
abstract:
- lang: eng
  text: High molecular weight DNA was extracted from the primary Neotropical malaria
    vector, Anopheles darlingi from Capanema, Pará, Brazil, to create a small insert
    genomic library, and then a phagemid library. Enriched sublibraries were constructed
    from the phagemid library using a microsatellite oligo primed second strand synthesis
    protocol. The resulting 242 760 individual clones were screened. The mean clone
    size of the positive clones was 302 bp. Flanking primers were designed for each
    suitable microsatellite sequence. Eight polymorphic loci were optimized and characterized.
    The allele size ranges are based on 253 samples of A. darlingi from eastern Amazonian
    and central Brazil.
acknowledgement: For  support  in  Brazil  we  thank  D.  Galiza,  R.N.L.  Lacerda,E.P.
  Santa Rosa, M.N.O. Segura, and R.T.L. de Souza. We also thankM.J.  Braun  for  allowing  work  on  the  library  construction  at  theLaboratory
  of Molecular Systematics, Washington. Supported byNIH AI 40116 to JEC and Instituto
  Evandro Chagas, Belém, Brazil.
article_processing_charge: No
article_type: original
author:
- first_name: Jan
  full_name: Conn, Jan
  last_name: Conn
- first_name: Jonathan P
  full_name: Bollback, Jonathan P
  id: 2C6FA9CC-F248-11E8-B48F-1D18A9856A87
  last_name: Bollback
  orcid: 0000-0002-4624-4612
- first_name: David
  full_name: Onyabe, David
  last_name: Onyabe
- first_name: Tessa
  full_name: Robinson, Tessa
  last_name: Robinson
- first_name: Richard
  full_name: Wilkerson, Richard
  last_name: Wilkerson
- first_name: Marinete
  full_name: Povoa, Marinete
  last_name: Povoa
citation:
  ama: Conn J, Bollback JP, Onyabe D, Robinson T, Wilkerson R, Povoa M. Isolation
    of polymorphic microsatellite markers from the malaria vector Anopheles darlingi.
    <i>Molecular Ecology Notes</i>. 2001;1(4):223-225. doi:<a href="https://doi.org/
    10.1046/j.1471-8278.2001.00078.x"> 10.1046/j.1471-8278.2001.00078.x</a>
  apa: Conn, J., Bollback, J. P., Onyabe, D., Robinson, T., Wilkerson, R., &#38; Povoa,
    M. (2001). Isolation of polymorphic microsatellite markers from the malaria vector
    Anopheles darlingi. <i>Molecular Ecology Notes</i>. Wiley-Blackwell. <a href="https://doi.org/
    10.1046/j.1471-8278.2001.00078.x">https://doi.org/ 10.1046/j.1471-8278.2001.00078.x</a>
  chicago: Conn, Jan, Jonathan P Bollback, David Onyabe, Tessa Robinson, Richard Wilkerson,
    and Marinete Povoa. “Isolation of Polymorphic Microsatellite Markers from the
    Malaria Vector Anopheles Darlingi.” <i>Molecular Ecology Notes</i>. Wiley-Blackwell,
    2001. <a href="https://doi.org/ 10.1046/j.1471-8278.2001.00078.x">https://doi.org/
    10.1046/j.1471-8278.2001.00078.x</a>.
  ieee: J. Conn, J. P. Bollback, D. Onyabe, T. Robinson, R. Wilkerson, and M. Povoa,
    “Isolation of polymorphic microsatellite markers from the malaria vector Anopheles
    darlingi,” <i>Molecular Ecology Notes</i>, vol. 1, no. 4. Wiley-Blackwell, pp.
    223–225, 2001.
  ista: Conn J, Bollback JP, Onyabe D, Robinson T, Wilkerson R, Povoa M. 2001. Isolation
    of polymorphic microsatellite markers from the malaria vector Anopheles darlingi.
    Molecular Ecology Notes. 1(4), 223–225.
  mla: Conn, Jan, et al. “Isolation of Polymorphic Microsatellite Markers from the
    Malaria Vector Anopheles Darlingi.” <i>Molecular Ecology Notes</i>, vol. 1, no.
    4, Wiley-Blackwell, 2001, pp. 223–25, doi:<a href="https://doi.org/ 10.1046/j.1471-8278.2001.00078.x">
    10.1046/j.1471-8278.2001.00078.x</a>.
  short: J. Conn, J.P. Bollback, D. Onyabe, T. Robinson, R. Wilkerson, M. Povoa, Molecular
    Ecology Notes 1 (2001) 223–225.
date_created: 2018-12-11T12:03:20Z
date_published: 2001-12-01T00:00:00Z
date_updated: 2023-05-15T13:58:49Z
day: '01'
doi: ' 10.1046/j.1471-8278.2001.00078.x'
extern: '1'
intvolume: '         1'
issue: '4'
language:
- iso: eng
month: '12'
oa_version: None
page: 223 - 225
publication: Molecular Ecology Notes
publication_identifier:
  issn:
  - 1471-8278
publication_status: published
publisher: Wiley-Blackwell
publist_id: '2961'
quality_controlled: '1'
status: public
title: Isolation of polymorphic microsatellite markers from the malaria vector Anopheles
  darlingi
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 1
year: '2001'
...
---
_id: '3440'
abstract:
- lang: eng
  text: "Several methods have been proposed to infer the states at the ancestral nodes
    on a phylogeny. These methods assume a specific tree and set of branch lengths
    when estimating the ancestral character state. Inferences of the ancestral states,
    then, are conditioned on the tree and branch lengths being true. We develop a
    hierarchical Bayes method for inferring the ancestral states on a tree. The method
    integrates over uncertainty in the tree, branch lengths, and substitution model
    parameters by using Markov chain Monte Carlo. We compare the hierarchical Bayes
    inferences of ancestral states with inferences of ancestral states made under
    the assumption that a specific tree is correct. We find that the methods are correlated,
    but that accommodating uncertainty in parameters of the phylogenetic model can
    make inferences of ancestral states even more uncertain than they would be in
    an empirical Bayes analysis.\r\n"
article_processing_charge: No
article_type: original
author:
- first_name: John
  full_name: Huelsenbeck, John
  last_name: Huelsenbeck
- first_name: Jonathan P
  full_name: Bollback, Jonathan P
  id: 2C6FA9CC-F248-11E8-B48F-1D18A9856A87
  last_name: Bollback
  orcid: 0000-0002-4624-4612
citation:
  ama: Huelsenbeck J, Bollback JP. Empirical and hierarchical Bayesian estimation
    of ancestral states. <i>Systematic Biology</i>. 2001;50(3):351-366. doi:<a href="https://doi.org/10.1080/10635150119871">10.1080/10635150119871</a>
  apa: Huelsenbeck, J., &#38; Bollback, J. P. (2001). Empirical and hierarchical Bayesian
    estimation of ancestral states. <i>Systematic Biology</i>. Oxford University Press.
    <a href="https://doi.org/10.1080/10635150119871">https://doi.org/10.1080/10635150119871</a>
  chicago: Huelsenbeck, John, and Jonathan P Bollback. “Empirical and Hierarchical
    Bayesian Estimation of Ancestral States.” <i>Systematic Biology</i>. Oxford University
    Press, 2001. <a href="https://doi.org/10.1080/10635150119871">https://doi.org/10.1080/10635150119871</a>.
  ieee: J. Huelsenbeck and J. P. Bollback, “Empirical and hierarchical Bayesian estimation
    of ancestral states,” <i>Systematic Biology</i>, vol. 50, no. 3. Oxford University
    Press, pp. 351–366, 2001.
  ista: Huelsenbeck J, Bollback JP. 2001. Empirical and hierarchical Bayesian estimation
    of ancestral states. Systematic Biology. 50(3), 351–366.
  mla: Huelsenbeck, John, and Jonathan P. Bollback. “Empirical and Hierarchical Bayesian
    Estimation of Ancestral States.” <i>Systematic Biology</i>, vol. 50, no. 3, Oxford
    University Press, 2001, pp. 351–66, doi:<a href="https://doi.org/10.1080/10635150119871">10.1080/10635150119871</a>.
  short: J. Huelsenbeck, J.P. Bollback, Systematic Biology 50 (2001) 351–366.
date_created: 2018-12-11T12:03:20Z
date_published: 2001-05-01T00:00:00Z
date_updated: 2023-05-15T13:54:01Z
day: '01'
doi: 10.1080/10635150119871
extern: '1'
external_id:
  pmid:
  - '12116580'
intvolume: '        50'
issue: '3'
language:
- iso: eng
month: '05'
oa_version: None
page: 351 - 366
pmid: 1
publication: Systematic Biology
publication_identifier:
  issn:
  - 0039-7989
publication_status: published
publisher: Oxford University Press
publist_id: '2960'
quality_controlled: '1'
status: public
title: Empirical and hierarchical Bayesian estimation of ancestral states
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 50
year: '2001'
...
---
_id: '3447'
author:
- first_name: Krishnendu
  full_name: Krishnendu Chatterjee
  id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
  last_name: Chatterjee
  orcid: 0000-0002-4561-241X
- first_name: Pallab
  full_name: Dasgupta, Pallab
  last_name: Dasgupta
- first_name: Partha
  full_name: Chakrabarti, Partha P
  last_name: Chakrabarti
citation:
  ama: 'Chatterjee K, Dasgupta P, Chakrabarti P. Weighted quantified computation tree
    logic. In: Elsevier; 2001.'
  apa: 'Chatterjee, K., Dasgupta, P., &#38; Chakrabarti, P. (2001). Weighted quantified
    computation tree logic. Presented at the CIT: Conference on Information Technology,
    Elsevier.'
  chicago: Chatterjee, Krishnendu, Pallab Dasgupta, and Partha Chakrabarti. “Weighted
    Quantified Computation Tree Logic.” Elsevier, 2001.
  ieee: 'K. Chatterjee, P. Dasgupta, and P. Chakrabarti, “Weighted quantified computation
    tree logic,” presented at the CIT: Conference on Information Technology, 2001.'
  ista: 'Chatterjee K, Dasgupta P, Chakrabarti P. 2001. Weighted quantified computation
    tree logic. CIT: Conference on Information Technology.'
  mla: Chatterjee, Krishnendu, et al. <i>Weighted Quantified Computation Tree Logic</i>.
    Elsevier, 2001.
  short: K. Chatterjee, P. Dasgupta, P. Chakrabarti, in:, Elsevier, 2001.
conference:
  name: 'CIT: Conference on Information Technology'
date_created: 2018-12-11T12:03:23Z
date_published: 2001-11-14T00:00:00Z
date_updated: 2021-01-12T07:43:31Z
day: '14'
extern: 1
month: '11'
publication_status: published
publisher: Elsevier
publist_id: '2940'
quality_controlled: 0
status: public
title: Weighted quantified computation tree logic
type: conference
year: '2001'
...
---
_id: '3493'
abstract:
- lang: eng
  text: Although agonists and competitive antagonists presumably occupy overlapping
    binding sites on ligand-gated channels, these interactions cannot be identical
    because agonists cause channel opening whereas antagonists do not. One explanation
    is that only agonist binding performs enough work on the receptor to cause the
    conformational changes that lead to gating. This idea is supported by agonist
    binding rates at GABAA and nicotinic acetylcholine receptors that are slower than
    expected for a diffusion-limited process, suggesting that agonist binding involves
    an energy-requiring event. This hypothesis predicts that competitive antagonist
    binding should require less activation energy than agonist binding. To test this
    idea, we developed a novel deconvolution-based method to compare binding and unbinding
    kinetics of GABAA receptor agonists and antagonists in outside-out patches from
    rat hippocampal neurons. Agonist and antagonist unbinding rates were steeply correlated
    with affinity. Unlike the agonists, three of the four antagonists tested had binding
    rates that were fast, independent of affinity, and could be accounted for by diffusion-
    and dehydration-limited processes. In contrast, agonist binding involved additional
    energy-requiring steps, consistent with the idea that channel gating is initiated
    by agonist-triggered movements within the ligand binding site. Antagonist binding
    does not appear to produce such movements, and may in fact prevent them.
article_processing_charge: No
article_type: original
author:
- first_name: M.V
  full_name: Jones, M.V
  last_name: Jones
- first_name: Peter M
  full_name: Jonas, Peter M
  id: 353C1B58-F248-11E8-B48F-1D18A9856A87
  last_name: Jonas
  orcid: 0000-0001-5001-4804
- first_name: Y.
  full_name: Sahara, Y.
  last_name: Sahara
- first_name: G.
  full_name: Westbrook, G.
  last_name: Westbrook
citation:
  ama: Jones M., Jonas PM, Sahara Y, Westbrook G. Microscopic kinetics and energetics
    distinguish GABAA receptor agonists from antagonists. <i>Biophysical Journal</i>.
    2001;81(5):2660-2670. doi:<a href="https://doi.org/10.1016/S0006-3495(01)75909-7
    ">10.1016/S0006-3495(01)75909-7 </a>
  apa: Jones, M. ., Jonas, P. M., Sahara, Y., &#38; Westbrook, G. (2001). Microscopic
    kinetics and energetics distinguish GABAA receptor agonists from antagonists.
    <i>Biophysical Journal</i>. Biophysical Society. <a href="https://doi.org/10.1016/S0006-3495(01)75909-7
    ">https://doi.org/10.1016/S0006-3495(01)75909-7 </a>
  chicago: Jones, M.V, Peter M Jonas, Y. Sahara, and G. Westbrook. “Microscopic Kinetics
    and Energetics Distinguish GABAA Receptor Agonists from Antagonists.” <i>Biophysical
    Journal</i>. Biophysical Society, 2001. <a href="https://doi.org/10.1016/S0006-3495(01)75909-7
    ">https://doi.org/10.1016/S0006-3495(01)75909-7 </a>.
  ieee: M. . Jones, P. M. Jonas, Y. Sahara, and G. Westbrook, “Microscopic kinetics
    and energetics distinguish GABAA receptor agonists from antagonists,” <i>Biophysical
    Journal</i>, vol. 81, no. 5. Biophysical Society, pp. 2660–2670, 2001.
  ista: Jones M., Jonas PM, Sahara Y, Westbrook G. 2001. Microscopic kinetics and
    energetics distinguish GABAA receptor agonists from antagonists. Biophysical Journal.
    81(5), 2660–2670.
  mla: Jones, M. .., et al. “Microscopic Kinetics and Energetics Distinguish GABAA
    Receptor Agonists from Antagonists.” <i>Biophysical Journal</i>, vol. 81, no.
    5, Biophysical Society, 2001, pp. 2660–70, doi:<a href="https://doi.org/10.1016/S0006-3495(01)75909-7
    ">10.1016/S0006-3495(01)75909-7 </a>.
  short: M.. Jones, P.M. Jonas, Y. Sahara, G. Westbrook, Biophysical Journal 81 (2001)
    2660–2670.
date_created: 2018-12-11T12:03:37Z
date_published: 2001-11-01T00:00:00Z
date_updated: 2023-05-15T13:50:21Z
day: '01'
doi: '10.1016/S0006-3495(01)75909-7 '
extern: '1'
external_id:
  pmid:
  - '11606279'
intvolume: '        81'
issue: '5'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC1301733/
month: '11'
oa: 1
oa_version: Published Version
page: 2660 - 2670
pmid: 1
publication: Biophysical Journal
publication_identifier:
  issn:
  - 0006-3495
publication_status: published
publisher: Biophysical Society
publist_id: '2894'
quality_controlled: '1'
status: public
title: Microscopic kinetics and energetics distinguish GABAA receptor agonists from
  antagonists
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 81
year: '2001'
...
---
_id: '3494'
abstract:
- lang: eng
  text: 'Mutual synaptic interactions between GABAergic interneurons are thought to
    be of critical importance for the generation of network oscillations and for temporal
    encoding of information in the hippocampus. However, the functional properties
    of synaptic transmission between hippocampal interneurons are largely unknown.
    We have made paired recordings from basket cells (BCs) in the dentate gyrus of
    rat hippocampal slices, followed by correlated light and electron microscopical
    analysis. Unitary GABAAreceptor-mediated IPSCs at BC–BC synapses recorded at the
    soma showed a fast rise and decay, with a mean decay time constant of 2.5 ± 0.2
    msec (32°C). Synaptic transmission at BC–BC synapses showed paired-pulse depression
    (PPD) (32 ± 5% for 10 msec interpulse intervals) and multiple-pulse depression
    during repetitive stimulation. Detailed passive cable model simulations based
    on somatodendritic morphology and localization of synaptic contacts further indicated
    that the conductance change at the postsynaptic site was even faster, decaying
    with a mean time constant of 1.8 ± 0.6 msec. Sequential triple recordings revealed
    that the decay time course of IPSCs at BC–BC synapses was approximately twofold
    faster than that at BC–granule cell synapses, whereas the extent of PPD was comparable.
    To examine the consequences of the fast postsynaptic conductance change for the
    generation of oscillatory activity, we developed a computational model of an interneuron
    network. The model showed robust oscillations at frequencies &gt;60 Hz if the
    excitatory drive was sufficiently large. Thus the fast conductance change at interneuron–interneuron
    synapses may promote the generation of high-frequency oscillations observed in
    the dentate gyrusin vivo. '
acknowledgement: This work was supported by grants of the Deutsche Forschungsgemeinschaft
  (SFB 505/C6) and the Human Frontiers Science Program Organization (RG0017/1998-B).
  We thank Drs. M. V. Jones, J. Bischofberger, and U. Kraushaar for critically reading
  this manuscript. We also thank B. Taskin and A. Roth for advice in the use of reconstruction
  and modeling software, and S. Nestel, M. Winter, and A. Blomenkamp for technical
  assistance.
article_processing_charge: No
article_type: original
author:
- first_name: Marlene
  full_name: Bartos, Marlene
  last_name: Bartos
- first_name: Imre
  full_name: Vida, Imre
  last_name: Vida
- first_name: Michael
  full_name: Frotscher, Michael
  last_name: Frotscher
- first_name: Jörg
  full_name: Geiger, Jörg
  last_name: Geiger
- first_name: Peter M
  full_name: Jonas, Peter M
  id: 353C1B58-F248-11E8-B48F-1D18A9856A87
  last_name: Jonas
  orcid: 0000-0001-5001-4804
citation:
  ama: Bartos M, Vida I, Frotscher M, Geiger J, Jonas PM. Rapid signaling at inhibitory
    synapses in a dentate gyrus interneuron network. <i>Journal of Neuroscience</i>.
    2001;21(8):2687-2698. doi:<a href="https://doi.org/10.1523/JNEUROSCI.21-08-02687.2001">10.1523/JNEUROSCI.21-08-02687.2001</a>
  apa: Bartos, M., Vida, I., Frotscher, M., Geiger, J., &#38; Jonas, P. M. (2001).
    Rapid signaling at inhibitory synapses in a dentate gyrus interneuron network.
    <i>Journal of Neuroscience</i>. Society for Neuroscience. <a href="https://doi.org/10.1523/JNEUROSCI.21-08-02687.2001">https://doi.org/10.1523/JNEUROSCI.21-08-02687.2001</a>
  chicago: Bartos, Marlene, Imre Vida, Michael Frotscher, Jörg Geiger, and Peter M
    Jonas. “Rapid Signaling at Inhibitory Synapses in a Dentate Gyrus Interneuron
    Network.” <i>Journal of Neuroscience</i>. Society for Neuroscience, 2001. <a href="https://doi.org/10.1523/JNEUROSCI.21-08-02687.2001">https://doi.org/10.1523/JNEUROSCI.21-08-02687.2001</a>.
  ieee: M. Bartos, I. Vida, M. Frotscher, J. Geiger, and P. M. Jonas, “Rapid signaling
    at inhibitory synapses in a dentate gyrus interneuron network.,” <i>Journal of
    Neuroscience</i>, vol. 21, no. 8. Society for Neuroscience, pp. 2687–2698, 2001.
  ista: Bartos M, Vida I, Frotscher M, Geiger J, Jonas PM. 2001. Rapid signaling at
    inhibitory synapses in a dentate gyrus interneuron network. Journal of Neuroscience.
    21(8), 2687–2698.
  mla: Bartos, Marlene, et al. “Rapid Signaling at Inhibitory Synapses in a Dentate
    Gyrus Interneuron Network.” <i>Journal of Neuroscience</i>, vol. 21, no. 8, Society
    for Neuroscience, 2001, pp. 2687–98, doi:<a href="https://doi.org/10.1523/JNEUROSCI.21-08-02687.2001">10.1523/JNEUROSCI.21-08-02687.2001</a>.
  short: M. Bartos, I. Vida, M. Frotscher, J. Geiger, P.M. Jonas, Journal of Neuroscience
    21 (2001) 2687–2698.
date_created: 2018-12-11T12:03:37Z
date_published: 2001-04-15T00:00:00Z
date_updated: 2023-05-15T13:47:04Z
day: '15'
doi: 10.1523/JNEUROSCI.21-08-02687.2001
extern: '1'
external_id:
  pmid:
  - '11306622'
intvolume: '        21'
issue: '8'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: ncbi.nlm.nih.gov/pmc/articles/PMC6762544/
month: '04'
oa: 1
oa_version: Published Version
page: 2687 - 2698
pmid: 1
publication: Journal of Neuroscience
publication_identifier:
  issn:
  - 0270-6474
publication_status: published
publisher: Society for Neuroscience
publist_id: '2893'
quality_controlled: '1'
status: public
title: Rapid signaling at inhibitory synapses in a dentate gyrus interneuron network.
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 21
year: '2001'
...
---
_id: '3495'
abstract:
- lang: eng
  text: High Ca2+ permeability and its control by voltage-dependent Mg2+ block are
    defining features of NMDA receptors. These features are lost if the principal
    NR1 subunit carries an asparagine (N) to arginine (R) substitution in a critical
    channel site at NR1 position 598. NR1(R) expression from a single allele in gene-targeted
    NR1+/R mice is lethal soon after birth, precluding analysis of altered synaptic
    functions later in life. We therefore employed the forebrain specific αCaMKII
    promoter to drive tTA-mediated tetracyclin sensitive transcription of transgenes
    for NR1(R) and for lacZ as reporter. Transgene expression was observed in cortex,
    striatum, hippocampus, amygdala and olfactory bulb and was mosaic in all these
    forebrain regions. It was highest in olfactory bulb granule cells, in most of
    which Ca2+ permeability and voltage-dependent Mg2+ block of NMDA receptors were
    reduced to different extents. This indicates significant impairment of NMDA receptor
    function by NR1(R) in presence of the wild-type NR1 complement. Indeed, even though
    NR1(R) mRNA constituted only 18% of the entire NR1 mRNA population in forebrain,
    the transgenic mice died during adolescence unless transgene expression was suppressed
    by doxycycline. Thus, glutamate receptor function can be altered in the mouse
    by regulated NR1(R) transgene expression.
acknowledgement: 'This work was supported in part by grants from the 358 (1992) 36–41.Deutsche
  Forschungsgemeinschaft (Bi 642 / 1-2) and the Volkswagen foundation. '
article_processing_charge: No
article_type: original
author:
- first_name: Jasna
  full_name: Jerecic, Jasna
  last_name: Jerecic
- first_name: Christian
  full_name: Schulze, Christian
  last_name: Schulze
- first_name: Peter M
  full_name: Jonas, Peter M
  id: 353C1B58-F248-11E8-B48F-1D18A9856A87
  last_name: Jonas
  orcid: 0000-0001-5001-4804
- first_name: Rolf
  full_name: Sprengel, Rolf
  last_name: Sprengel
- first_name: Peter
  full_name: Seeburg, Peter
  last_name: Seeburg
- first_name: Joseph
  full_name: Bischofberger, Joseph
  last_name: Bischofberger
citation:
  ama: Jerecic J, Schulze C, Jonas PM, Sprengel R, Seeburg P, Bischofberger J. Impaired
    NMDA receptor function in mouse olfactory bulb neurons by tetracycline-sensitive
    NR1 (N598R) expression. <i>Molecular Brain Research</i>. 2001;94(1-2):96-104.
    doi:<a href="https://doi.org/10.1016/S0169-328X(01)00221-2">10.1016/S0169-328X(01)00221-2</a>
  apa: Jerecic, J., Schulze, C., Jonas, P. M., Sprengel, R., Seeburg, P., &#38; Bischofberger,
    J. (2001). Impaired NMDA receptor function in mouse olfactory bulb neurons by
    tetracycline-sensitive NR1 (N598R) expression. <i>Molecular Brain Research</i>.
    Elsevier. <a href="https://doi.org/10.1016/S0169-328X(01)00221-2">https://doi.org/10.1016/S0169-328X(01)00221-2</a>
  chicago: Jerecic, Jasna, Christian Schulze, Peter M Jonas, Rolf Sprengel, Peter
    Seeburg, and Joseph Bischofberger. “Impaired NMDA Receptor Function in Mouse Olfactory
    Bulb Neurons by Tetracycline-Sensitive NR1 (N598R) Expression.” <i>Molecular Brain
    Research</i>. Elsevier, 2001. <a href="https://doi.org/10.1016/S0169-328X(01)00221-2">https://doi.org/10.1016/S0169-328X(01)00221-2</a>.
  ieee: J. Jerecic, C. Schulze, P. M. Jonas, R. Sprengel, P. Seeburg, and J. Bischofberger,
    “Impaired NMDA receptor function in mouse olfactory bulb neurons by tetracycline-sensitive
    NR1 (N598R) expression,” <i>Molecular Brain Research</i>, vol. 94, no. 1–2. Elsevier,
    pp. 96–104, 2001.
  ista: Jerecic J, Schulze C, Jonas PM, Sprengel R, Seeburg P, Bischofberger J. 2001.
    Impaired NMDA receptor function in mouse olfactory bulb neurons by tetracycline-sensitive
    NR1 (N598R) expression. Molecular Brain Research. 94(1–2), 96–104.
  mla: Jerecic, Jasna, et al. “Impaired NMDA Receptor Function in Mouse Olfactory
    Bulb Neurons by Tetracycline-Sensitive NR1 (N598R) Expression.” <i>Molecular Brain
    Research</i>, vol. 94, no. 1–2, Elsevier, 2001, pp. 96–104, doi:<a href="https://doi.org/10.1016/S0169-328X(01)00221-2">10.1016/S0169-328X(01)00221-2</a>.
  short: J. Jerecic, C. Schulze, P.M. Jonas, R. Sprengel, P. Seeburg, J. Bischofberger,
    Molecular Brain Research 94 (2001) 96–104.
date_created: 2018-12-11T12:03:38Z
date_published: 2001-10-19T00:00:00Z
date_updated: 2023-05-15T13:42:32Z
day: '19'
doi: 10.1016/S0169-328X(01)00221-2
extern: '1'
external_id:
  pmid:
  - '11597769'
intvolume: '        94'
issue: 1-2
language:
- iso: eng
month: '10'
oa_version: None
page: 96 - 104
pmid: 1
publication: Molecular Brain Research
publication_identifier:
  issn:
  - 0169-328X
publication_status: published
publisher: Elsevier
publist_id: '2892'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Impaired NMDA receptor function in mouse olfactory bulb neurons by tetracycline-sensitive
  NR1 (N598R) expression
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 94
year: '2001'
...
---
_id: '3496'
abstract:
- lang: eng
  text: 'The mossy fiber-CA3 pyramidal neuron synapse is a main component of the hippocampal
    trisynaptic circuitry. Recent studies, however, suggested that inhibitory interneurons
    are the major targets of the mossy fiber system. To study the regulation of mossy
    fiber-interneuron excitation, we examined unitary and compound excitatory postsynaptic
    currents in dentate gyrus basket cells, evoked by paired recording between granule
    and basket cells or extracellular stimulation of mossy fiber collaterals. The
    application of an associative high-frequency stimulation paradigm induced posttetanic
    potentiation (PTP) followed by homosynaptic long-term potentiation (LTP). Analysis
    of numbers of failures, coefficient of variation, and paired-pulse modulation
    indicated that both PTP and LTP were expressed presynaptically. The Ca2+ chelator
    1,2-bis(2-aminophenoxy)ethane-N,N,N′,N′-tetraacetic acid (BAPTA) did not affect
    PTP or LTP at a concentration of 10 mM but attenuated LTP at a concentration of
    30 mM. Both forskolin, an adenylyl cyclase activator, and phorbolester diacetate,
    a protein kinase C stimulator, lead to a long-lasting increase in excitatory postsynaptic
    current amplitude. H-89, a protein kinase A inhibitor, and bisindolylmaleimide,
    a protein kinase C antagonist, reduced PTP, whereas only bisindolylmaleimide reduced
    LTP. These results may suggest a differential contribution of protein kinase A
    and C pathways to mossy fiber-interneuron plasticity. Interneuron PTP and LTP
    may provide mechanisms to maintain the balance between synaptic excitation of
    interneurons and that of principal neurons in the dentate gyrus-CA3 network. '
acknowledgement: We thank Drs. J. Bischofberger and M. Martina for critically reading
  an earlier version of the manuscript and A. Blomenkamp for excellent technical assistance.
  Supported by the Deutsche Forschungsgemeinschaft Sonderforschungsbereich 505/C5
  and Human Frontiers Science Program Organization Grant RG0017/98.
article_processing_charge: No
article_type: original
author:
- first_name: Henrik
  full_name: Alle, Henrik
  last_name: Alle
- first_name: Peter M
  full_name: Jonas, Peter M
  id: 353C1B58-F248-11E8-B48F-1D18A9856A87
  last_name: Jonas
  orcid: 0000-0001-5001-4804
- first_name: Jörg
  full_name: Geiger, Jörg
  last_name: Geiger
citation:
  ama: Alle H, Jonas PM, Geiger J. PTP and LTP at a hippocampal mossy fiber-interneuron
    synapse. <i>PNAS</i>. 2001;98(25):14708-14713. doi:<a href="https://doi.org/10.1073/pnas.251610898
    ">10.1073/pnas.251610898 </a>
  apa: Alle, H., Jonas, P. M., &#38; Geiger, J. (2001). PTP and LTP at a hippocampal
    mossy fiber-interneuron synapse. <i>PNAS</i>. National Academy of Sciences. <a
    href="https://doi.org/10.1073/pnas.251610898 ">https://doi.org/10.1073/pnas.251610898
    </a>
  chicago: Alle, Henrik, Peter M Jonas, and Jörg Geiger. “PTP and LTP at a Hippocampal
    Mossy Fiber-Interneuron Synapse.” <i>PNAS</i>. National Academy of Sciences, 2001.
    <a href="https://doi.org/10.1073/pnas.251610898 ">https://doi.org/10.1073/pnas.251610898
    </a>.
  ieee: H. Alle, P. M. Jonas, and J. Geiger, “PTP and LTP at a hippocampal mossy fiber-interneuron
    synapse,” <i>PNAS</i>, vol. 98, no. 25. National Academy of Sciences, pp. 14708–14713,
    2001.
  ista: Alle H, Jonas PM, Geiger J. 2001. PTP and LTP at a hippocampal mossy fiber-interneuron
    synapse. PNAS. 98(25), 14708–14713.
  mla: Alle, Henrik, et al. “PTP and LTP at a Hippocampal Mossy Fiber-Interneuron
    Synapse.” <i>PNAS</i>, vol. 98, no. 25, National Academy of Sciences, 2001, pp.
    14708–13, doi:<a href="https://doi.org/10.1073/pnas.251610898 ">10.1073/pnas.251610898
    </a>.
  short: H. Alle, P.M. Jonas, J. Geiger, PNAS 98 (2001) 14708–14713.
date_created: 2018-12-11T12:03:38Z
date_published: 2001-12-04T00:00:00Z
date_updated: 2023-05-15T11:08:08Z
day: '04'
doi: '10.1073/pnas.251610898 '
extern: '1'
external_id:
  pmid:
  - '11734656'
intvolume: '        98'
issue: '25'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC64746/
month: '12'
oa: 1
oa_version: None
page: 14708 - 14713
pmid: 1
publication: PNAS
publication_identifier:
  issn:
  - 0027-8424
publication_status: published
publisher: National Academy of Sciences
publist_id: '2891'
quality_controlled: '1'
scopus_import: '1'
status: public
title: PTP and LTP at a hippocampal mossy fiber-interneuron synapse
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 98
year: '2001'
...
---
_id: '3507'
abstract:
- lang: eng
  text: A molecular classification method is based on a space filling description
    of a molecule. The three dimensional body corresponding to the space filling molecular
    structure is divided into Voronoi regions to provide a basis for efficiently processing
    local structural information. A Delaunay triangulation provides a basis for systematically
    processing information relating to the Voronoi regions into shape descriptors
    in the form of topological elements. Preferably, additional shape and/or property
    descriptors are included in the classification method. The classification methods
    generally are used to identify similarities between molecules that can be used
    as property predictors for a variety of applications. Generally, the property
    predictions are the basis for selection of compounds for incorporation into efficacy
    evaluations.
applicant:
- Jie Liang, Herbert Edelsbrunner
article_processing_charge: No
author:
- first_name: Jie
  full_name: Liang, Jie
  last_name: Liang
- first_name: Herbert
  full_name: Edelsbrunner, Herbert
  id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
  last_name: Edelsbrunner
  orcid: 0000-0002-9823-6833
citation:
  ama: Liang J, Edelsbrunner H. Molecular classification for property prediction.
    2001.
  apa: Liang, J., &#38; Edelsbrunner, H. (2001). Molecular classification for property
    prediction.
  chicago: Liang, Jie, and Herbert Edelsbrunner. “Molecular Classification for Property
    Prediction,” 2001.
  ieee: J. Liang and H. Edelsbrunner, “Molecular classification for property prediction.”
    2001.
  ista: Liang J, Edelsbrunner H. 2001. Molecular classification for property prediction.
  mla: Liang, Jie, and Herbert Edelsbrunner. <i>Molecular Classification for Property
    Prediction</i>. 2001.
  short: J. Liang, H. Edelsbrunner, (2001).
date_created: 2018-12-11T12:03:41Z
date_published: 2001-01-30T00:00:00Z
date_updated: 2022-01-05T15:12:42Z
day: '30'
extern: '1'
ipc: G16C20/70 ; G16B15/00
ipn: US6182016B1
main_file_link:
- open_access: '1'
  url: https://patents.google.com/patent/US6182016B1
month: '01'
oa: 1
oa_version: Published Version
publication_date: 2001-01-30
publist_id: '2880'
status: public
title: Molecular classification for property prediction
type: patent
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
year: '2001'
...
---
_id: '3517'
abstract:
- lang: eng
  text: 'A modular multichannel microdrive (''hyperdrive'') is described. The microdrive
    uses printed circuit board technology and flexible fused silica capillaries. The
    modular design allows for the fabrication of 4-32 independently movable electrodes
    or `tetrodes''. The drives are re-usable and re-loading the drive with electrodes
    is simple. '
article_processing_charge: No
article_type: original
author:
- first_name: Imre
  full_name: Szabo, Imre
  last_name: Szabo
- first_name: András
  full_name: Czurkó, András
  last_name: Czurkó
- first_name: Jozsef L
  full_name: Csicsvari, Jozsef L
  id: 3FA14672-F248-11E8-B48F-1D18A9856A87
  last_name: Csicsvari
  orcid: 0000-0002-5193-4036
- first_name: Hajima
  full_name: Hirase, Hajima
  last_name: Hirase
- first_name: Xavier
  full_name: Leinekugel, Xavier
  last_name: Leinekugel
- first_name: György
  full_name: Buzsáki, György
  last_name: Buzsáki
citation:
  ama: Szabo I, Czurkó A, Csicsvari JL, Hirase H, Leinekugel X, Buzsáki G. The application
    of printed circuit board technology for fabrication of multi-channel micro-drives.
    <i>Journal of Neuroscience Methods</i>. 2001;105(1):105-110. doi:<a href="https://doi.org/10.1016/S0165-0270(00)00362-9">10.1016/S0165-0270(00)00362-9</a>
  apa: Szabo, I., Czurkó, A., Csicsvari, J. L., Hirase, H., Leinekugel, X., &#38;
    Buzsáki, G. (2001). The application of printed circuit board technology for fabrication
    of multi-channel micro-drives. <i>Journal of Neuroscience Methods</i>. Elsevier.
    <a href="https://doi.org/10.1016/S0165-0270(00)00362-9">https://doi.org/10.1016/S0165-0270(00)00362-9</a>
  chicago: Szabo, Imre, András Czurkó, Jozsef L Csicsvari, Hajima Hirase, Xavier Leinekugel,
    and György Buzsáki. “The Application of Printed Circuit Board Technology for Fabrication
    of Multi-Channel Micro-Drives.” <i>Journal of Neuroscience Methods</i>. Elsevier,
    2001. <a href="https://doi.org/10.1016/S0165-0270(00)00362-9">https://doi.org/10.1016/S0165-0270(00)00362-9</a>.
  ieee: I. Szabo, A. Czurkó, J. L. Csicsvari, H. Hirase, X. Leinekugel, and G. Buzsáki,
    “The application of printed circuit board technology for fabrication of multi-channel
    micro-drives,” <i>Journal of Neuroscience Methods</i>, vol. 105, no. 1. Elsevier,
    pp. 105–110, 2001.
  ista: Szabo I, Czurkó A, Csicsvari JL, Hirase H, Leinekugel X, Buzsáki G. 2001.
    The application of printed circuit board technology for fabrication of multi-channel
    micro-drives. Journal of Neuroscience Methods. 105(1), 105–110.
  mla: Szabo, Imre, et al. “The Application of Printed Circuit Board Technology for
    Fabrication of Multi-Channel Micro-Drives.” <i>Journal of Neuroscience Methods</i>,
    vol. 105, no. 1, Elsevier, 2001, pp. 105–10, doi:<a href="https://doi.org/10.1016/S0165-0270(00)00362-9">10.1016/S0165-0270(00)00362-9</a>.
  short: I. Szabo, A. Czurkó, J.L. Csicsvari, H. Hirase, X. Leinekugel, G. Buzsáki,
    Journal of Neuroscience Methods 105 (2001) 105–110.
date_created: 2018-12-11T12:03:45Z
date_published: 2001-01-30T00:00:00Z
date_updated: 2023-05-15T10:50:39Z
day: '30'
doi: 10.1016/S0165-0270(00)00362-9
extern: '1'
external_id:
  pmid:
  - '11166371'
intvolume: '       105'
issue: '1'
language:
- iso: eng
month: '01'
oa_version: None
page: 105 - 110
pmid: 1
publication: Journal of Neuroscience Methods
publication_identifier:
  issn:
  - 0165-0270
publication_status: published
publisher: Elsevier
publist_id: '2868'
quality_controlled: '1'
scopus_import: '1'
status: public
title: The application of printed circuit board technology for fabrication of multi-channel
  micro-drives
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 105
year: '2001'
...
