---
_id: '2563'
abstract:
- lang: eng
  text: By means of substance P receptor (SPR) immunofluorescence histochemistry combined
    with Fluoro-Gold fluorescent retrograde labeling, SPR-like immunoreactive neurons
    in the caudal subnucleus of the spinal trigeminal nucleus of the rat were observed
    to send their axons to the nucleus of Kolliker-Fuse and ventrolateral part of
    the lateral parabrachial nucleus bilaterally with a clear ipsilateral dominance.
    These neurons were distributed mainly in lamina I, and additionally in lamina
    III.
acknowledgement: 'The authors are grateful for photographic help of Ms. Miao-Li Zhang
  and Mr. Akira Uesugi. This work was supported in part by Grants-in-Aid for Special
  Research on Priority Areas 05267104, Scientific Research (B) 05454658, and Scientific
  Research (C) 06680735 from the Ministry of Education, Science and Culture of Japan. '
article_processing_charge: No
article_type: original
author:
- first_name: Yu
  full_name: Ding, Yu
  last_name: Ding
- first_name: Masahiko
  full_name: Takada, Masahiko
  last_name: Takada
- first_name: Ryuichi
  full_name: Shigemoto, Ryuichi
  id: 499F3ABC-F248-11E8-B48F-1D18A9856A87
  last_name: Shigemoto
  orcid: 0000-0001-8761-9444
- first_name: Noboru
  full_name: Mizuno, Noboru
  last_name: Mizuno
citation:
  ama: Ding Y, Takada M, Shigemoto R, Mizuno N. Trigeminoparabrachial projection neurons
    showing substance P receptor-like immunoreactivity in the rat. <i>Neuroscience
    Research</i>. 1995;23(4):415-418. doi:<a href="https://doi.org/10.1016/0168-0102(95)00961-R">10.1016/0168-0102(95)00961-R</a>
  apa: Ding, Y., Takada, M., Shigemoto, R., &#38; Mizuno, N. (1995). Trigeminoparabrachial
    projection neurons showing substance P receptor-like immunoreactivity in the rat.
    <i>Neuroscience Research</i>. Elsevier. <a href="https://doi.org/10.1016/0168-0102(95)00961-R">https://doi.org/10.1016/0168-0102(95)00961-R</a>
  chicago: Ding, Yu, Masahiko Takada, Ryuichi Shigemoto, and Noboru Mizuno. “Trigeminoparabrachial
    Projection Neurons Showing Substance P Receptor-like Immunoreactivity in the Rat.”
    <i>Neuroscience Research</i>. Elsevier, 1995. <a href="https://doi.org/10.1016/0168-0102(95)00961-R">https://doi.org/10.1016/0168-0102(95)00961-R</a>.
  ieee: Y. Ding, M. Takada, R. Shigemoto, and N. Mizuno, “Trigeminoparabrachial projection
    neurons showing substance P receptor-like immunoreactivity in the rat,” <i>Neuroscience
    Research</i>, vol. 23, no. 4. Elsevier, pp. 415–418, 1995.
  ista: Ding Y, Takada M, Shigemoto R, Mizuno N. 1995. Trigeminoparabrachial projection
    neurons showing substance P receptor-like immunoreactivity in the rat. Neuroscience
    Research. 23(4), 415–418.
  mla: Ding, Yu, et al. “Trigeminoparabrachial Projection Neurons Showing Substance
    P Receptor-like Immunoreactivity in the Rat.” <i>Neuroscience Research</i>, vol.
    23, no. 4, Elsevier, 1995, pp. 415–18, doi:<a href="https://doi.org/10.1016/0168-0102(95)00961-R">10.1016/0168-0102(95)00961-R</a>.
  short: Y. Ding, M. Takada, R. Shigemoto, N. Mizuno, Neuroscience Research 23 (1995)
    415–418.
date_created: 2018-12-11T11:58:24Z
date_published: 1995-11-01T00:00:00Z
date_updated: 2022-06-28T09:50:42Z
day: '01'
doi: 10.1016/0168-0102(95)00961-R
extern: '1'
external_id:
  pmid:
  - '8602281'
intvolume: '        23'
issue: '4'
language:
- iso: eng
main_file_link:
- url: https://www.sciencedirect.com/science/article/pii/016801029500961R?via%3Dihub
month: '11'
oa_version: None
page: 415 - 418
pmid: 1
publication: Neuroscience Research
publication_identifier:
  issn:
  - 0168-0102
publication_status: published
publisher: Elsevier
publist_id: '4336'
quality_controlled: '1'
status: public
title: Trigeminoparabrachial projection neurons showing substance P receptor-like
  immunoreactivity in the rat
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 23
year: '1995'
...
---
_id: '2712'
abstract:
- lang: eng
  text: We study the generalizations of the well-known Lieb-Thirring inequality for
    the magnetic Schrödinger operator with a nonconstant magnetic field. We use stochastic
    methods to prove estimates on the moments of the negative eigenvalues.
acknowledgement: Work supported by the NSF grant PHY90-19433 A02, by the Alfred Sloan
  Foundation dissertation Fellowship and by the Erwin Schrödinger Institute for Mathematical
  Physics in Vienna.
alternative_title:
- 'Operator Theory: Advances and Applications'
article_processing_charge: No
author:
- first_name: László
  full_name: Erdös, László
  id: 4DBD5372-F248-11E8-B48F-1D18A9856A87
  last_name: Erdös
  orcid: 0000-0001-5366-9603
citation:
  ama: 'Erdös L. Magnetic Lieb-Thirring inequalities and stochastic oscillatory integrals.
    In: Vol 78. Birkhäuser; 1995:127-132. doi:<a href="https://doi.org/10.1007/978-3-0348-9092-2_13">10.1007/978-3-0348-9092-2_13</a>'
  apa: 'Erdös, L. (1995). Magnetic Lieb-Thirring inequalities and stochastic oscillatory
    integrals (Vol. 78, pp. 127–132). Presented at the International Conference on
    Partial Differential Operators and Mathematical Physics, Holzhau, Germany: Birkhäuser.
    <a href="https://doi.org/10.1007/978-3-0348-9092-2_13">https://doi.org/10.1007/978-3-0348-9092-2_13</a>'
  chicago: Erdös, László. “Magnetic Lieb-Thirring Inequalities and Stochastic Oscillatory
    Integrals,” 78:127–32. Birkhäuser, 1995. <a href="https://doi.org/10.1007/978-3-0348-9092-2_13">https://doi.org/10.1007/978-3-0348-9092-2_13</a>.
  ieee: L. Erdös, “Magnetic Lieb-Thirring inequalities and stochastic oscillatory
    integrals,” presented at the International Conference on Partial Differential
    Operators and Mathematical Physics, Holzhau, Germany, 1995, vol. 78, pp. 127–132.
  ista: 'Erdös L. 1995. Magnetic Lieb-Thirring inequalities and stochastic oscillatory
    integrals. International Conference on Partial Differential Operators and Mathematical
    Physics, Operator Theory: Advances and Applications, vol. 78, 127–132.'
  mla: Erdös, László. <i>Magnetic Lieb-Thirring Inequalities and Stochastic Oscillatory
    Integrals</i>. Vol. 78, Birkhäuser, 1995, pp. 127–32, doi:<a href="https://doi.org/10.1007/978-3-0348-9092-2_13">10.1007/978-3-0348-9092-2_13</a>.
  short: L. Erdös, in:, Birkhäuser, 1995, pp. 127–132.
conference:
  end_date: 1995-07-09
  location: Holzhau, Germany
  name: International Conference on Partial Differential Operators and Mathematical
    Physics
  start_date: 1995-07-03
date_created: 2018-12-11T11:59:12Z
date_published: 1995-01-01T00:00:00Z
date_updated: 2022-06-28T09:31:20Z
day: '01'
doi: 10.1007/978-3-0348-9092-2_13
extern: '1'
intvolume: '        78'
language:
- iso: eng
main_file_link:
- url: https://link.springer.com/chapter/10.1007/978-3-0348-9092-2_13
month: '01'
oa_version: None
page: 127 - 132
publication_status: published
publisher: Birkhäuser
publist_id: '4184'
quality_controlled: '1'
status: public
title: Magnetic Lieb-Thirring inequalities and stochastic oscillatory integrals
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 78
year: '1995'
...
---
_id: '2724'
abstract:
- lang: eng
  text: We study the generalizations of the well-known Lieb-Thirring inequality for
    the magnetic Schrödinger operator with nonconstant magnetic field. Our main result
    is the naturally expected magnetic Lieb-Thirring estimate on the moments of the
    negative eigenvalues for a certain class of magnetic fields (including even some
    unbounded ones). We develop a localization technique in path space of the stochastic
    Feynman-Kac representation of the heat kernel which effectively estimates the
    oscillatory effect due to the magnetic phase factor.
article_processing_charge: No
article_type: original
author:
- first_name: László
  full_name: Erdös, László
  id: 4DBD5372-F248-11E8-B48F-1D18A9856A87
  last_name: Erdös
  orcid: 0000-0001-5366-9603
citation:
  ama: Erdös L. Magnetic Lieb-Thirring inequalities. <i>Communications in Mathematical
    Physics</i>. 1995;170(3):629-668. doi:<a href="https://doi.org/10.1007/BF02099152">10.1007/BF02099152</a>
  apa: Erdös, L. (1995). Magnetic Lieb-Thirring inequalities. <i>Communications in
    Mathematical Physics</i>. Springer. <a href="https://doi.org/10.1007/BF02099152">https://doi.org/10.1007/BF02099152</a>
  chicago: Erdös, László. “Magnetic Lieb-Thirring Inequalities.” <i>Communications
    in Mathematical Physics</i>. Springer, 1995. <a href="https://doi.org/10.1007/BF02099152">https://doi.org/10.1007/BF02099152</a>.
  ieee: L. Erdös, “Magnetic Lieb-Thirring inequalities,” <i>Communications in Mathematical
    Physics</i>, vol. 170, no. 3. Springer, pp. 629–668, 1995.
  ista: Erdös L. 1995. Magnetic Lieb-Thirring inequalities. Communications in Mathematical
    Physics. 170(3), 629–668.
  mla: Erdös, László. “Magnetic Lieb-Thirring Inequalities.” <i>Communications in
    Mathematical Physics</i>, vol. 170, no. 3, Springer, 1995, pp. 629–68, doi:<a
    href="https://doi.org/10.1007/BF02099152">10.1007/BF02099152</a>.
  short: L. Erdös, Communications in Mathematical Physics 170 (1995) 629–668.
date_created: 2018-12-11T11:59:16Z
date_published: 1995-06-01T00:00:00Z
date_updated: 2022-06-28T09:19:36Z
day: '01'
doi: 10.1007/BF02099152
extern: '1'
intvolume: '       170'
issue: '3'
language:
- iso: eng
main_file_link:
- url: https://link.springer.com/article/10.1007/BF02099152
month: '06'
oa_version: None
page: 629 - 668
publication: Communications in Mathematical Physics
publication_identifier:
  issn:
  - 0010-3616
publication_status: published
publisher: Springer
publist_id: '4168'
quality_controlled: '1'
status: public
title: Magnetic Lieb-Thirring inequalities
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 170
year: '1995'
...
---
_id: '11677'
abstract:
- lang: eng
  text: "We present an algorithm for maintaining the biconnected components of a graph
    during a sequence of edge insertions and deletions. It requires linear storage
    and preprocessing time. The amortized running time for insertions and for deletions
    isO(m 2/3 ), wherem is the number of edges in the graph. Any query of the form
    ‘Are the verticesu andv biconnected?’ can be answered in timeO(1). This is the
    first sublinear algorithm for this problem. We can also output all articulation
    points separating any two vertices efficiently.\r\n\r\nIf the input is a plane
    graph, the amortized running time for insertions and deletions drops toO(√n logn)
    and the query time isO(log2 n), wheren is the number of vertices in the graph.
    The best previously known solution takes timeO(n 2/3 ) per update or 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
citation:
  ama: Henzinger MH. Fully dynamic biconnectivity in graphs. <i>Algorithmica</i>.
    1995;13(6):503-538. doi:<a href="https://doi.org/10.1007/bf01189067">10.1007/bf01189067</a>
  apa: Henzinger, M. H. (1995). Fully dynamic biconnectivity in graphs. <i>Algorithmica</i>.
    Springer Nature. <a href="https://doi.org/10.1007/bf01189067">https://doi.org/10.1007/bf01189067</a>
  chicago: Henzinger, Monika H. “Fully Dynamic Biconnectivity in Graphs.” <i>Algorithmica</i>.
    Springer Nature, 1995. <a href="https://doi.org/10.1007/bf01189067">https://doi.org/10.1007/bf01189067</a>.
  ieee: M. H. Henzinger, “Fully dynamic biconnectivity in graphs,” <i>Algorithmica</i>,
    vol. 13, no. 6. Springer Nature, pp. 503–538, 1995.
  ista: Henzinger MH. 1995. Fully dynamic biconnectivity in graphs. Algorithmica.
    13(6), 503–538.
  mla: Henzinger, Monika H. “Fully Dynamic Biconnectivity in Graphs.” <i>Algorithmica</i>,
    vol. 13, no. 6, Springer Nature, 1995, pp. 503–38, doi:<a href="https://doi.org/10.1007/bf01189067">10.1007/bf01189067</a>.
  short: M.H. Henzinger, Algorithmica 13 (1995) 503–538.
date_created: 2022-07-27T14:50:46Z
date_published: 1995-06-01T00:00:00Z
date_updated: 2022-09-12T09:00:14Z
day: '01'
doi: 10.1007/bf01189067
extern: '1'
intvolume: '        13'
issue: '6'
language:
- iso: eng
month: '06'
oa_version: None
page: 503-538
publication: Algorithmica
publication_identifier:
  eissn:
  - 1432-0541
  issn:
  - 0178-4617
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Fully dynamic biconnectivity in graphs
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 13
year: '1995'
...
---
_id: '11684'
abstract:
- lang: eng
  text: 'This paper presents an algorithm for the fully dynamic biconnectivity problem
    whose running time is exponentially faster than all previously known solutions.
    It is the first dynamic algorithm that answers biconnectivity queries in time
    O(log/sup 2/n) in a n-node graph and can be updated after an edge insertion or
    deletion in polylogarithmic time. Our algorithm is a Las-Vegas style randomized
    algorithm with the update time amortized update time O(log/sup 4/n). Only recently
    the best deterministic result for this problem was improved to O(/spl radic/nlog/sup
    2/n). We also give the first fully dynamic and a novel deletions-only transitive
    closure (i.e. directed connectivity) algorithms. These are randomized Monte Carlo
    algorithms. Let n be the number of nodes in the graph and let m/spl circ/ be the
    average number of edges in the graph during the whole update sequence: The fully
    dynamic algorithms achieve (1) query time O(n/logn) and update time O(m/spl circ//spl
    radic/nlog/sup 2/n+n); or (2) query time O(n/logn) and update time O(nm/spl circ//sup
    /spl mu/-1/)log/sup 2/n=O(nm/spl circ//sup 0.58/log/sup 2/n), where /spl mu/ is
    the exponent for boolean matrix multiplication (currently /spl mu/=2.38). The
    deletions-only algorithm answers queries in time O(n/logn). Its amortized update
    time is O(nlog/sup 2/n).'
article_processing_charge: No
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: V.
  full_name: King, V.
  last_name: King
citation:
  ama: 'Henzinger MH, King V. Fully dynamic biconnectivity and transitive closure.
    In: <i>Proceedings of IEEE 36th Annual Foundations of Computer Science</i>. Institute
    of Electrical and Electronics Engineers; 1995:664-672. doi:<a href="https://doi.org/10.1109/SFCS.1995.492668">10.1109/SFCS.1995.492668</a>'
  apa: 'Henzinger, M. H., &#38; King, V. (1995). Fully dynamic biconnectivity and
    transitive closure. In <i>Proceedings of IEEE 36th Annual Foundations of Computer
    Science</i> (pp. 664–672). Milwaukee, WI, United States: Institute of Electrical
    and Electronics Engineers. <a href="https://doi.org/10.1109/SFCS.1995.492668">https://doi.org/10.1109/SFCS.1995.492668</a>'
  chicago: Henzinger, Monika H, and V. King. “Fully Dynamic Biconnectivity and Transitive
    Closure.” In <i>Proceedings of IEEE 36th Annual Foundations of Computer Science</i>,
    664–72. Institute of Electrical and Electronics Engineers, 1995. <a href="https://doi.org/10.1109/SFCS.1995.492668">https://doi.org/10.1109/SFCS.1995.492668</a>.
  ieee: M. H. Henzinger and V. King, “Fully dynamic biconnectivity and transitive
    closure,” in <i>Proceedings of IEEE 36th Annual Foundations of Computer Science</i>,
    Milwaukee, WI, United States, 1995, pp. 664–672.
  ista: Henzinger MH, King V. 1995. Fully dynamic biconnectivity and transitive closure.
    Proceedings of IEEE 36th Annual Foundations of Computer Science. Foundations of
    Computer Science, 664–672.
  mla: Henzinger, Monika H., and V. King. “Fully Dynamic Biconnectivity and Transitive
    Closure.” <i>Proceedings of IEEE 36th Annual Foundations of Computer Science</i>,
    Institute of Electrical and Electronics Engineers, 1995, pp. 664–72, doi:<a href="https://doi.org/10.1109/SFCS.1995.492668">10.1109/SFCS.1995.492668</a>.
  short: M.H. Henzinger, V. King, in:, Proceedings of IEEE 36th Annual Foundations
    of Computer Science, Institute of Electrical and Electronics Engineers, 1995,
    pp. 664–672.
conference:
  end_date: 1995-10-25
  location: Milwaukee, WI, United States
  name: Foundations of Computer Science
  start_date: 1995-10-23
date_created: 2022-07-28T11:28:13Z
date_published: 1995-11-01T00:00:00Z
date_updated: 2023-02-09T11:35:17Z
day: '01'
doi: 10.1109/SFCS.1995.492668
extern: '1'
language:
- iso: eng
month: '11'
oa_version: None
page: 664-672
publication: Proceedings of IEEE 36th Annual Foundations of Computer Science
publication_identifier:
  isbn:
  - 0-8186-7183-1
  issn:
  - 0272-5428
publication_status: published
publisher: Institute of Electrical and Electronics Engineers
quality_controlled: '1'
scopus_import: '1'
status: public
title: Fully dynamic biconnectivity and transitive closure
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '1995'
...
---
_id: '11805'
abstract:
- lang: eng
  text: In this paper, we present sparse certificates for biconnectivity together
    with algorithms for updating these certificates. We thus obtain fully-dynamic
    algorithms for biconnectivity in graphs that run in O(√n log n log⌈m/n⌉) amortized
    time per operation, where m is the number of edges and n is the number of nodes
    in the graph. This improves upon the results in [11], in which algorithms were
    presented running in O(√m) amortized time, and solves the open problem to find
    certificates to speed up biconnectivity, as stated in [2].
alternative_title:
- LNCS
article_processing_charge: No
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: Han
  full_name: Poutré, Han
  last_name: Poutré
citation:
  ama: 'Henzinger MH, Poutré H. Certificates and fast algorithms for biconnectivity
    in fully-dynamic graphs. In: <i>3rd Annual European Symposium on Algorithms</i>.
    Vol 979. Springer Nature; 1995:171–184. doi:<a href="https://doi.org/10.1007/3-540-60313-1_142">10.1007/3-540-60313-1_142</a>'
  apa: 'Henzinger, M. H., &#38; Poutré, H. (1995). Certificates and fast algorithms
    for biconnectivity in fully-dynamic graphs. In <i>3rd Annual European Symposium
    on Algorithms</i> (Vol. 979, pp. 171–184). Corfu, Greece: Springer Nature. <a
    href="https://doi.org/10.1007/3-540-60313-1_142">https://doi.org/10.1007/3-540-60313-1_142</a>'
  chicago: Henzinger, Monika H, and Han Poutré. “Certificates and Fast Algorithms
    for Biconnectivity in Fully-Dynamic Graphs.” In <i>3rd Annual European Symposium
    on Algorithms</i>, 979:171–184. Springer Nature, 1995. <a href="https://doi.org/10.1007/3-540-60313-1_142">https://doi.org/10.1007/3-540-60313-1_142</a>.
  ieee: M. H. Henzinger and H. Poutré, “Certificates and fast algorithms for biconnectivity
    in fully-dynamic graphs,” in <i>3rd Annual European Symposium on Algorithms</i>,
    Corfu, Greece, 1995, vol. 979, pp. 171–184.
  ista: 'Henzinger MH, Poutré H. 1995. Certificates and fast algorithms for biconnectivity
    in fully-dynamic graphs. 3rd Annual European Symposium on Algorithms. ESA: European
    Symposium on Algorithms, LNCS, vol. 979, 171–184.'
  mla: Henzinger, Monika H., and Han Poutré. “Certificates and Fast Algorithms for
    Biconnectivity in Fully-Dynamic Graphs.” <i>3rd Annual European Symposium on Algorithms</i>,
    vol. 979, Springer Nature, 1995, pp. 171–184, doi:<a href="https://doi.org/10.1007/3-540-60313-1_142">10.1007/3-540-60313-1_142</a>.
  short: M.H. Henzinger, H. Poutré, in:, 3rd Annual European Symposium on Algorithms,
    Springer Nature, 1995, pp. 171–184.
conference:
  end_date: 1995-09-27
  location: Corfu, Greece
  name: 'ESA: European Symposium on Algorithms'
  start_date: 1995-09-25
date_created: 2022-08-11T14:09:52Z
date_published: 1995-09-01T00:00:00Z
date_updated: 2023-02-14T08:02:03Z
day: '01'
doi: 10.1007/3-540-60313-1_142
extern: '1'
intvolume: '       979'
language:
- iso: eng
month: '09'
oa_version: None
page: 171–184
publication: 3rd Annual European Symposium on Algorithms
publication_identifier:
  eisbn:
  - '9783540449133'
  eissn:
  - 1611-3349
  isbn:
  - '9783540603139'
  issn:
  - 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Certificates and fast algorithms for biconnectivity in fully-dynamic graphs
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 979
year: '1995'
...
---
_id: '11806'
abstract:
- lang: eng
  text: This paper presents insertions-only algorithms for maintaining the exact and
    approximate size of the minimum edge cut and the minimum vertex cut of a graph.
    The algorithms output the approximate or exact size k in time O(1) or O(log n)
    and a cut of size k in time linear in its size. The amortized time per insertion
    is O(1/ε 2) for a (2+ε)-approximation, O((log λ)((log n)/ε)2) for a (1+ε)-approximation,
    and O(λ log n) for the exact size of the minimum edge cut, where n is the number
    of nodes in the graph, λ is the size of the minimum cut and ε>0. The (2+ε)-approximation
    algorithm and the exact algorithm are deterministic, the (1+ε)-approximation algorithm
    is randomized. The algorithms are optimal in the sense that the time needed for
    m insertions matches the time needed by the best static algorithm on a m-edge
    graph. We also present a static 2-approximation algorithm for the size κ of the
    minimum vertex cut in a graph, which takes time O(n 2 min(√n,κ)). This is a factor
    of κ faster than the best algorithm for computing the exact size, which takes
    time O(κ 2 n 2 +κ 3 n 1.5). We give an insertionsonly algorithm for maintaining
    a (2+ε)-approximation of the minimum vertex cut with amortized insertion time
    O(n(logκk)/ε).
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Monika H
  full_name: Henzinger, Monika H
  id: 540c9bbd-f2de-11ec-812d-d04a5be85630
  last_name: Henzinger
  orcid: 0000-0002-5008-6530
citation:
  ama: 'Henzinger MH. Approximating minimum cuts under insertions. In: <i>22nd International
    Colloquium on Automata, Languages and Programming</i>. Vol 944. Springer Nature;
    1995:280–291. doi:<a href="https://doi.org/10.1007/3-540-60084-1_81">10.1007/3-540-60084-1_81</a>'
  apa: 'Henzinger, M. H. (1995). Approximating minimum cuts under insertions. In <i>22nd
    International Colloquium on Automata, Languages and Programming</i> (Vol. 944,
    pp. 280–291). Szeged, Hungary: Springer Nature. <a href="https://doi.org/10.1007/3-540-60084-1_81">https://doi.org/10.1007/3-540-60084-1_81</a>'
  chicago: Henzinger, Monika H. “Approximating Minimum Cuts under Insertions.” In
    <i>22nd International Colloquium on Automata, Languages and Programming</i>, 944:280–291.
    Springer Nature, 1995. <a href="https://doi.org/10.1007/3-540-60084-1_81">https://doi.org/10.1007/3-540-60084-1_81</a>.
  ieee: M. H. Henzinger, “Approximating minimum cuts under insertions,” in <i>22nd
    International Colloquium on Automata, Languages and Programming</i>, Szeged, Hungary,
    1995, vol. 944, pp. 280–291.
  ista: 'Henzinger MH. 1995. Approximating minimum cuts under insertions. 22nd International
    Colloquium on Automata, Languages and Programming. ICALP: International Colloquium
    on Automata, Languages, and Programming, LNCS, vol. 944, 280–291.'
  mla: Henzinger, Monika H. “Approximating Minimum Cuts under Insertions.” <i>22nd
    International Colloquium on Automata, Languages and Programming</i>, vol. 944,
    Springer Nature, 1995, pp. 280–291, doi:<a href="https://doi.org/10.1007/3-540-60084-1_81">10.1007/3-540-60084-1_81</a>.
  short: M.H. Henzinger, in:, 22nd International Colloquium on Automata, Languages
    and Programming, Springer Nature, 1995, pp. 280–291.
conference:
  end_date: 1995-07-14
  location: Szeged, Hungary
  name: 'ICALP: International Colloquium on Automata, Languages, and Programming'
  start_date: 1995-07-10
date_created: 2022-08-11T14:17:33Z
date_published: 1995-07-01T00:00:00Z
date_updated: 2023-02-14T08:09:08Z
day: '01'
doi: 10.1007/3-540-60084-1_81
extern: '1'
intvolume: '       944'
language:
- iso: eng
month: '07'
oa_version: None
page: 280–291
publication: 22nd International Colloquium on Automata, Languages and Programming
publication_identifier:
  eisbn:
  - '9783540600848'
  eissn:
  - 1611-3349
  isbn:
  - '9783540494256'
  issn:
  - 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Approximating minimum cuts under insertions
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 944
year: '1995'
...
---
_id: '11928'
abstract:
- lang: eng
  text: "We present a model with restricted randomness for edge updates in dynamic
    graph algorithms and a general technique\r\nfor analyzing the expected running
    time of an update operation. This model is able to capture the average case in
    many applications, since (1) it allows restrictions on the set of edges which
    can be used for insertions and (2) the type (insertion or deletion) of each update
    operation is arbitrary, i.e., not random. We use our technique to analyze existing
    and new dynamic algorithms for maximum cardinality matching, minimum spanning
    forest, connectivity, 2-edge connectivity,\r\nk-edge connectivity, k-vertex connectivity,
    and bipartiteness. Given a random graph G with mo edges and n vertices and\r\na
    sequence of 1 update operations such that the graph contains rni edges after operation
    i, the expected time for performing the updates for any 1 is O(1 logn + n xi=,
    l/fii) in the case of minimum spanning forests, connectivity, 2-\r\nedge connectivity,
    and bipartiteness. The expected time per update operation is O(n) in the case
    of maximum matching. For k-edge and k-vertex connectivity we also give improved
    bounds. Additionally we give an insertions-only algorithm for maximum cardinality
    matching with worst-case O(n) amortized time per insertion. "
article_processing_charge: No
author:
- first_name: David
  full_name: Alberts, David
  last_name: Alberts
- first_name: Monika H
  full_name: Henzinger, Monika H
  id: 540c9bbd-f2de-11ec-812d-d04a5be85630
  last_name: Henzinger
  orcid: 0000-0002-5008-6530
citation:
  ama: 'Alberts D, Henzinger MH. Average case analysis of dynamic graph algorithms.
    In: <i>6th Annual ACM-SIAM Symposium on Discrete Algorithms</i>. Society for Industrial
    and Applied Mathematics; 1995:312-321.'
  apa: 'Alberts, D., &#38; Henzinger, M. H. (1995). Average case analysis of dynamic
    graph algorithms. In <i>6th Annual ACM-SIAM Symposium on Discrete Algorithms</i>
    (pp. 312–321). San Francisco, CA, United States: Society for Industrial and Applied
    Mathematics.'
  chicago: Alberts, David, and Monika H Henzinger. “Average Case Analysis of Dynamic
    Graph Algorithms.” In <i>6th Annual ACM-SIAM Symposium on Discrete Algorithms</i>,
    312–21. Society for Industrial and Applied Mathematics, 1995.
  ieee: D. Alberts and M. H. Henzinger, “Average case analysis of dynamic graph algorithms,”
    in <i>6th Annual ACM-SIAM Symposium on Discrete Algorithms</i>, San Francisco,
    CA, United States, 1995, pp. 312–321.
  ista: 'Alberts D, Henzinger MH. 1995. Average case analysis of dynamic graph algorithms.
    6th Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete
    Algorithms, 312–321.'
  mla: Alberts, David, and Monika H. Henzinger. “Average Case Analysis of Dynamic
    Graph Algorithms.” <i>6th Annual ACM-SIAM Symposium on Discrete Algorithms</i>,
    Society for Industrial and Applied Mathematics, 1995, pp. 312–21.
  short: D. Alberts, M.H. Henzinger, in:, 6th Annual ACM-SIAM Symposium on Discrete
    Algorithms, Society for Industrial and Applied Mathematics, 1995, pp. 312–321.
conference:
  end_date: 1995-01-24
  location: San Francisco, CA, United States
  name: 'SODA: Symposium on Discrete Algorithms'
  start_date: 1995-01-22
date_created: 2022-08-19T07:10:23Z
date_published: 1995-01-01T00:00:00Z
date_updated: 2023-02-21T16:24:58Z
day: '01'
extern: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://dl.acm.org/doi/10.5555/313651.313712
month: '01'
oa: 1
oa_version: Published Version
page: 312-321
publication: 6th Annual ACM-SIAM Symposium on Discrete Algorithms
publication_identifier:
  isbn:
  - '0898713498'
publication_status: published
publisher: Society for Industrial and Applied Mathematics
quality_controlled: '1'
related_material:
  record:
  - id: '11680'
    relation: later_version
    status: public
scopus_import: '1'
status: public
title: Average case analysis of dynamic graph algorithms
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '1995'
...
---
_id: '1949'
abstract:
- lang: eng
  text: H+-transhydrogenase (H+-Thase) and NADP-linked isocitrate dehydrogenase (NADP-ICDH)
    are very active in animal mitochondria but their physiological function is only
    poorly understood. This is especially so in the case of the heart and muscle,
    where there are no major consumers of NADPH. We propose here that H+-Thase and
    NADP-ICDH have a combined function in the fine regulation of the activity of the
    tricarboxylic acid (TCA) cycle, providing enhanced sensitivy to changes in energy
    demand. This is achieved through cycling of substrates by NAD-linked ICDH, NADP-linked
    ICDH and H+-Thase. It is proposed that NAD-ICDH operates in the forward direction
    of the TCA cycle, but NADP-ICDH is driven in reverse by elevated levels of NADPH
    resulting from the action of the transmembrane proton electrochemical potential
    gradient (Δp) on H+-Thase. This has the effect of increasing the sensitivity to
    allosteric modifiers of NAD-ICDH (NADH, ADP, ATP, Ca2+ etc), potentially giving
    rise to large changes in the net flux from iso-citrate to α-ketoglutarate. Furthermore,
    changes in the level of Δp resulting from changes in the demand for ATP would,
    via H+-Thase, shift the redox state of the NADP pool and this, in turn, would
    lead to a change in the rate of the reaction catalysed by NADP-ICDH and hence
    to an additional and complementary effect on the net metabolic flux from isocitrate
    to α-ketoglutarate. Other consequences of this substrate cycle are, (i) the production
    of heat at the expense of Δp, which may contribute to thermoregulation in the
    animal, and (ii) an increased rate of dissipation of Δp (leak).
acknowledgement: LAS is grateful to the Wellcome Trust for a fellowship. We should
  like to thank Prof. R.M. Denton for discussion.
article_processing_charge: No
article_type: original
author:
- first_name: Leonid A
  full_name: Sazanov, Leonid A
  id: 338D39FE-F248-11E8-B48F-1D18A9856A87
  last_name: Sazanov
  orcid: 0000-0002-0977-7989
- first_name: Julie
  full_name: Jackson, Julie
  last_name: Jackson
citation:
  ama: Sazanov LA, Jackson J. Proton translocating transhydrogenase and NAD- and NADP-linked
    isocitrate dehydrogenases operate in a substrate cycle which contributes to fine
    regulation of the tricarboxylic acid cycle activity in mitochondria. <i>FEBS Letters</i>.
    1994;344(2-3):109-116. doi:<a href="https://doi.org/10.1016/0014-5793(94)00370-X">10.1016/0014-5793(94)00370-X</a>
  apa: Sazanov, L. A., &#38; Jackson, J. (1994). Proton translocating transhydrogenase
    and NAD- and NADP-linked isocitrate dehydrogenases operate in a substrate cycle
    which contributes to fine regulation of the tricarboxylic acid cycle activity
    in mitochondria. <i>FEBS Letters</i>. Elsevier. <a href="https://doi.org/10.1016/0014-5793(94)00370-X">https://doi.org/10.1016/0014-5793(94)00370-X</a>
  chicago: Sazanov, Leonid A, and Julie Jackson. “Proton Translocating Transhydrogenase
    and NAD- and NADP-Linked Isocitrate Dehydrogenases Operate in a Substrate Cycle
    Which Contributes to Fine Regulation of the Tricarboxylic Acid Cycle Activity
    in Mitochondria.” <i>FEBS Letters</i>. Elsevier, 1994. <a href="https://doi.org/10.1016/0014-5793(94)00370-X">https://doi.org/10.1016/0014-5793(94)00370-X</a>.
  ieee: L. A. Sazanov and J. Jackson, “Proton translocating transhydrogenase and NAD-
    and NADP-linked isocitrate dehydrogenases operate in a substrate cycle which contributes
    to fine regulation of the tricarboxylic acid cycle activity in mitochondria,”
    <i>FEBS Letters</i>, vol. 344, no. 2–3. Elsevier, pp. 109–116, 1994.
  ista: Sazanov LA, Jackson J. 1994. Proton translocating transhydrogenase and NAD-
    and NADP-linked isocitrate dehydrogenases operate in a substrate cycle which contributes
    to fine regulation of the tricarboxylic acid cycle activity in mitochondria. FEBS
    Letters. 344(2–3), 109–116.
  mla: Sazanov, Leonid A., and Julie Jackson. “Proton Translocating Transhydrogenase
    and NAD- and NADP-Linked Isocitrate Dehydrogenases Operate in a Substrate Cycle
    Which Contributes to Fine Regulation of the Tricarboxylic Acid Cycle Activity
    in Mitochondria.” <i>FEBS Letters</i>, vol. 344, no. 2–3, Elsevier, 1994, pp.
    109–16, doi:<a href="https://doi.org/10.1016/0014-5793(94)00370-X">10.1016/0014-5793(94)00370-X</a>.
  short: L.A. Sazanov, J. Jackson, FEBS Letters 344 (1994) 109–116.
date_created: 2018-12-11T11:54:52Z
date_published: 1994-05-16T00:00:00Z
date_updated: 2022-06-09T13:21:50Z
day: '16'
doi: 10.1016/0014-5793(94)00370-X
extern: '1'
external_id:
  pmid:
  - '8187868'
intvolume: '       344'
issue: 2-3
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://febs.onlinelibrary.wiley.com/doi/abs/10.1016/0014-5793%2894%2900370-X
month: '05'
oa: 1
oa_version: Published Version
page: 109 - 116
pmid: 1
publication: FEBS Letters
publication_identifier:
  issn:
  - 0014-5793
publication_status: published
publisher: Elsevier
publist_id: '5134'
quality_controlled: '1'
status: public
title: Proton translocating transhydrogenase and NAD- and NADP-linked isocitrate dehydrogenases
  operate in a substrate cycle which contributes to fine regulation of the tricarboxylic
  acid cycle activity in mitochondria
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 344
year: '1994'
...
---
_id: '1953'
abstract:
- lang: eng
  text: The respiratory burst induced by phorbol myristate acetate in mouse macrophages
    was inhibited by ultra-low doses (10-15 -10-13 M) of an opioid peptide [d-Ala2]
    methionine enkephalinamide. The effect disappeared at concentrations above and
    below this range. The inhibition approached 50% and was statistically significant
    (P &lt; 0.001). Increasing the time of the opioid incubation with cells brought
    about a shift in the maximal effect to lower concentrations of the opioid (from
    10-13 to 5 · 10-15 M) and led to a decrease in the value of the effect, fully
    in accord with the previously proposed adaptation mechanism of the action of ultra-low
    doses.
article_processing_charge: No
article_type: original
author:
- first_name: Alexander
  full_name: Efanov, Alexander
  last_name: Efanov
- first_name: Aleksei
  full_name: Koshkin, Aleksei
  last_name: Koshkin
- first_name: Leonid A
  full_name: Sazanov, Leonid A
  id: 338D39FE-F248-11E8-B48F-1D18A9856A87
  last_name: Sazanov
  orcid: 0000-0002-0977-7989
- first_name: O I
  full_name: Borodulina, O I
  last_name: Borodulina
- first_name: Sergei
  full_name: Varfolomeev, Sergei
  last_name: Varfolomeev
- first_name: Sergei
  full_name: Zaǐtsev, Sergei
  last_name: Zaǐtsev
citation:
  ama: Efanov A, Koshkin A, Sazanov LA, Borodulina OI, Varfolomeev S, Zaǐtsev S. Inhibition
    of the respiratory burst in mouse macrophages by ultra-low doses of an opioid
    peptide is consistent with a possible adaptation mechanism. <i>FEBS Letters</i>.
    1994;355(2):114-116. doi:<a href="https://doi.org/10.1016/0014-5793(94)01109-5">10.1016/0014-5793(94)01109-5</a>
  apa: Efanov, A., Koshkin, A., Sazanov, L. A., Borodulina, O. I., Varfolomeev, S.,
    &#38; Zaǐtsev, S. (1994). Inhibition of the respiratory burst in mouse macrophages
    by ultra-low doses of an opioid peptide is consistent with a possible adaptation
    mechanism. <i>FEBS Letters</i>. Elsevier. <a href="https://doi.org/10.1016/0014-5793(94)01109-5">https://doi.org/10.1016/0014-5793(94)01109-5</a>
  chicago: Efanov, Alexander, Aleksei Koshkin, Leonid A Sazanov, O I Borodulina, Sergei
    Varfolomeev, and Sergei Zaǐtsev. “Inhibition of the Respiratory Burst in Mouse
    Macrophages by Ultra-Low Doses of an Opioid Peptide Is Consistent with a Possible
    Adaptation Mechanism.” <i>FEBS Letters</i>. Elsevier, 1994. <a href="https://doi.org/10.1016/0014-5793(94)01109-5">https://doi.org/10.1016/0014-5793(94)01109-5</a>.
  ieee: A. Efanov, A. Koshkin, L. A. Sazanov, O. I. Borodulina, S. Varfolomeev, and
    S. Zaǐtsev, “Inhibition of the respiratory burst in mouse macrophages by ultra-low
    doses of an opioid peptide is consistent with a possible adaptation mechanism,”
    <i>FEBS Letters</i>, vol. 355, no. 2. Elsevier, pp. 114–116, 1994.
  ista: Efanov A, Koshkin A, Sazanov LA, Borodulina OI, Varfolomeev S, Zaǐtsev S.
    1994. Inhibition of the respiratory burst in mouse macrophages by ultra-low doses
    of an opioid peptide is consistent with a possible adaptation mechanism. FEBS
    Letters. 355(2), 114–116.
  mla: Efanov, Alexander, et al. “Inhibition of the Respiratory Burst in Mouse Macrophages
    by Ultra-Low Doses of an Opioid Peptide Is Consistent with a Possible Adaptation
    Mechanism.” <i>FEBS Letters</i>, vol. 355, no. 2, Elsevier, 1994, pp. 114–16,
    doi:<a href="https://doi.org/10.1016/0014-5793(94)01109-5">10.1016/0014-5793(94)01109-5</a>.
  short: A. Efanov, A. Koshkin, L.A. Sazanov, O.I. Borodulina, S. Varfolomeev, S.
    Zaǐtsev, FEBS Letters 355 (1994) 114–116.
date_created: 2018-12-11T11:54:53Z
date_published: 1994-11-28T00:00:00Z
date_updated: 2022-06-09T12:58:57Z
day: '28'
doi: 10.1016/0014-5793(94)01109-5
extern: '1'
external_id:
  pmid:
  - '7982481'
intvolume: '       355'
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://febs.onlinelibrary.wiley.com/doi/abs/10.1016/0014-5793%2894%2901109-5
month: '11'
oa: 1
oa_version: Published Version
page: 114 - 116
pmid: 1
publication: FEBS Letters
publication_identifier:
  issn:
  - 0014-5793
publication_status: published
publisher: Elsevier
publist_id: '5133'
quality_controlled: '1'
status: public
title: Inhibition of the respiratory burst in mouse macrophages by ultra-low doses
  of an opioid peptide is consistent with a possible adaptation mechanism
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 355
year: '1994'
...
---
_id: '6167'
abstract:
- lang: eng
  text: The tra-1 gene is the terminal regulator in the sex determination pathway
    in C. elegans, directing all aspects of somatic sexual differentiation. Recessive
    loss-of-function (lf) mutations in tra-1 masculinize XX animals (normally somatically
    female), while dominant gain-of-function mutations feminize XO animals (normally
    male). Most tra-1 (lf) mutations can be fitted into a simple allelic series of
    somatic masculinization, but a small number of lf alleles do not fit into this
    series. Here we show that three of these mutations are associated with DNA rearrangements
    5' to the coding region. One allele is an inversion that may be subject to a position
    effect. We also report the isolation of a new class of tra-1 alleles that are
    responsive to mutations in the smg system of RNA surveillance. We show that two
    of these express RNAs of aberrant size. We suggest that the smg-sensitive mutations
    may identify a carboxy-terminal domain required for negative regulation of tra-1
    activity.
author:
- first_name: David
  full_name: Zarkower, David
  last_name: Zarkower
- first_name: Mario
  full_name: de Bono, Mario
  id: 4E3FF80E-F248-11E8-B48F-1D18A9856A87
  last_name: de Bono
  orcid: 0000-0001-8347-0443
- first_name: Rachel
  full_name: Aronoff, Rachel
  last_name: Aronoff
- first_name: Jonathan
  full_name: Hodgkin, Jonathan
  last_name: Hodgkin
citation:
  ama: Zarkower D, de Bono M, Aronoff R, Hodgkin J. Regulatory rearrangements and
    smg-sensitive allels of the C. elegans sex-determining gene tra-1. <i>Developmental
    Genetics</i>. 1994;15(3):240-250. doi:<a href="https://doi.org/10.1002/dvg.1020150306">10.1002/dvg.1020150306</a>
  apa: Zarkower, D., de Bono, M., Aronoff, R., &#38; Hodgkin, J. (1994). Regulatory
    rearrangements and smg-sensitive allels of the C. elegans sex-determining gene
    tra-1. <i>Developmental Genetics</i>. Wiley. <a href="https://doi.org/10.1002/dvg.1020150306">https://doi.org/10.1002/dvg.1020150306</a>
  chicago: Zarkower, David, Mario de Bono, Rachel Aronoff, and Jonathan Hodgkin. “Regulatory
    Rearrangements and Smg-Sensitive Allels of the C. Elegans Sex-Determining Gene
    Tra-1.” <i>Developmental Genetics</i>. Wiley, 1994. <a href="https://doi.org/10.1002/dvg.1020150306">https://doi.org/10.1002/dvg.1020150306</a>.
  ieee: D. Zarkower, M. de Bono, R. Aronoff, and J. Hodgkin, “Regulatory rearrangements
    and smg-sensitive allels of the C. elegans sex-determining gene tra-1,” <i>Developmental
    Genetics</i>, vol. 15, no. 3. Wiley, pp. 240–250, 1994.
  ista: Zarkower D, de Bono M, Aronoff R, Hodgkin J. 1994. Regulatory rearrangements
    and smg-sensitive allels of the C. elegans sex-determining gene tra-1. Developmental
    Genetics. 15(3), 240–250.
  mla: Zarkower, David, et al. “Regulatory Rearrangements and Smg-Sensitive Allels
    of the C. Elegans Sex-Determining Gene Tra-1.” <i>Developmental Genetics</i>,
    vol. 15, no. 3, Wiley, 1994, pp. 240–50, doi:<a href="https://doi.org/10.1002/dvg.1020150306">10.1002/dvg.1020150306</a>.
  short: D. Zarkower, M. de Bono, R. Aronoff, J. Hodgkin, Developmental Genetics 15
    (1994) 240–250.
date_created: 2019-03-22T08:38:41Z
date_published: 1994-01-13T00:00:00Z
date_updated: 2021-01-12T08:06:30Z
day: '13'
doi: 10.1002/dvg.1020150306
extern: '1'
external_id:
  pmid:
  - '7520378'
intvolume: '        15'
issue: '3'
language:
- iso: eng
month: '01'
oa_version: None
page: 240-250
pmid: 1
publication: Developmental Genetics
publication_identifier:
  issn:
  - 0192-253X
  - 1520-6408
publication_status: published
publisher: Wiley
quality_controlled: '1'
status: public
title: Regulatory rearrangements and smg-sensitive allels of the C. elegans sex-determining
  gene tra-1
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 15
year: '1994'
...
---
_id: '3453'
alternative_title:
- Advances in second messenger and phosphoprotein research
article_processing_charge: No
author:
- first_name: Eberhard
  full_name: Von Kitzing, Eberhard
  last_name: Von Kitzing
- 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: Bert
  full_name: Sakmann, Bert
  last_name: Sakmann
citation:
  ama: Von Kitzing E, Jonas PM, Sakmann B. Quantal analysis of excitatory postsynaptic
    currents at the hippocampal mossy fiber-CA3 pyramidal cell synapse. <i>Molecular
    and cellular mechanisms of neurotransmitter release</i>. 1994;29:235-260. doi:<a
    href="https://doi.org/10.1016/0166-2236(95)90088-8">10.1016/0166-2236(95)90088-8</a>
  apa: Von Kitzing, E., Jonas, P. M., &#38; Sakmann, B. (1994). Quantal analysis of
    excitatory postsynaptic currents at the hippocampal mossy fiber-CA3 pyramidal
    cell synapse. <i>Molecular and Cellular Mechanisms of Neurotransmitter Release</i>.
    Raven Press. <a href="https://doi.org/10.1016/0166-2236(95)90088-8">https://doi.org/10.1016/0166-2236(95)90088-8</a>
  chicago: Von Kitzing, Eberhard, Peter M Jonas, and Bert Sakmann. “Quantal Analysis
    of Excitatory Postsynaptic Currents at the Hippocampal Mossy Fiber-CA3 Pyramidal
    Cell Synapse.” <i>Molecular and Cellular Mechanisms of Neurotransmitter Release</i>.
    Raven Press, 1994. <a href="https://doi.org/10.1016/0166-2236(95)90088-8">https://doi.org/10.1016/0166-2236(95)90088-8</a>.
  ieee: E. Von Kitzing, P. M. Jonas, and B. Sakmann, “Quantal analysis of excitatory
    postsynaptic currents at the hippocampal mossy fiber-CA3 pyramidal cell synapse,”
    <i>Molecular and cellular mechanisms of neurotransmitter release</i>, vol. 29.
    Raven Press, pp. 235–260, 1994.
  ista: Von Kitzing E, Jonas PM, Sakmann B. 1994. Quantal analysis of excitatory postsynaptic
    currents at the hippocampal mossy fiber-CA3 pyramidal cell synapse. Molecular
    and cellular mechanisms of neurotransmitter release. 29, 235–260.
  mla: Von Kitzing, Eberhard, et al. “Quantal Analysis of Excitatory Postsynaptic
    Currents at the Hippocampal Mossy Fiber-CA3 Pyramidal Cell Synapse.” <i>Molecular
    and Cellular Mechanisms of Neurotransmitter Release</i>, vol. 29, Raven Press,
    1994, pp. 235–60, doi:<a href="https://doi.org/10.1016/0166-2236(95)90088-8">10.1016/0166-2236(95)90088-8</a>.
  short: E. Von Kitzing, P.M. Jonas, B. Sakmann, Molecular and Cellular Mechanisms
    of Neurotransmitter Release 29 (1994) 235–260.
date_created: 2018-12-11T12:03:24Z
date_published: 1994-01-01T00:00:00Z
date_updated: 2022-06-03T11:46:09Z
day: '01'
doi: 10.1016/0166-2236(95)90088-8
extern: '1'
external_id:
  pmid:
  - '7848714 '
intvolume: '        29'
language:
- iso: eng
main_file_link:
- url: https://www.sciencedirect.com/science/article/pii/0166223695900888?via%3Dihub
month: '01'
oa_version: None
page: 235 - 260
pmid: 1
publication: Molecular and cellular mechanisms of neurotransmitter release
publication_identifier:
  isbn:
  - '0781702208'
publication_status: published
publisher: Raven Press
publist_id: '2934'
quality_controlled: '1'
status: public
title: Quantal analysis of excitatory postsynaptic currents at the hippocampal mossy
  fiber-CA3 pyramidal cell synapse
type: review
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 29
year: '1994'
...
---
_id: '3460'
abstract:
- lang: eng
  text: Excitatory postsynaptic currents in neurones of the central nervous system
    have a dual-component time course that results from the co-activation of AMPA/kainate-type
    and NMDA-type glutamate receptors. New approaches in electrophysiology and molecular
    biology have provided a better understanding of the factors that determine the
    kinectics of excitatory postsynaptic currents. Recent studies suggest that the
    time course of neurotransmitter concentration in the synaptic cleft, the gating
    properties of the native channels, and the glutamate receptor subunit composition
    all appear to be important factors.
acknowledgement: 'We thank JGG Borst, N Burnashev, M Häusser, G Stuart and A Viilarroel
  for critically reading the manuscript and E von Kitzing and A Roth for doing the
  simulations and for many helpful discussions. Supported by the Deutsche Forschungsgemeinschaft
  (SFB 317-B14) and the Alexander von Humboldt Foundation. '
article_processing_charge: No
article_type: original
author:
- 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: Nelson
  full_name: Spruston, Nelson
  last_name: Spruston
citation:
  ama: Jonas PM, Spruston N. Mechanisms shaping glutamate-mediated excitatory postsynaptic
    currents in the CNS. <i>Current Opinion in Neurobiology</i>. 1994;4(3):366-372.
    doi:<a href="https://doi.org/10.1016/0959-4388(94)90098-1">10.1016/0959-4388(94)90098-1</a>
  apa: Jonas, P. M., &#38; Spruston, N. (1994). Mechanisms shaping glutamate-mediated
    excitatory postsynaptic currents in the CNS. <i>Current Opinion in Neurobiology</i>.
    Elsevier. <a href="https://doi.org/10.1016/0959-4388(94)90098-1">https://doi.org/10.1016/0959-4388(94)90098-1</a>
  chicago: Jonas, Peter M, and Nelson Spruston. “Mechanisms Shaping Glutamate-Mediated
    Excitatory Postsynaptic Currents in the CNS.” <i>Current Opinion in Neurobiology</i>.
    Elsevier, 1994. <a href="https://doi.org/10.1016/0959-4388(94)90098-1">https://doi.org/10.1016/0959-4388(94)90098-1</a>.
  ieee: P. M. Jonas and N. Spruston, “Mechanisms shaping glutamate-mediated excitatory
    postsynaptic currents in the CNS,” <i>Current Opinion in Neurobiology</i>, vol.
    4, no. 3. Elsevier, pp. 366–372, 1994.
  ista: Jonas PM, Spruston N. 1994. Mechanisms shaping glutamate-mediated excitatory
    postsynaptic currents in the CNS. Current Opinion in Neurobiology. 4(3), 366–372.
  mla: Jonas, Peter M., and Nelson Spruston. “Mechanisms Shaping Glutamate-Mediated
    Excitatory Postsynaptic Currents in the CNS.” <i>Current Opinion in Neurobiology</i>,
    vol. 4, no. 3, Elsevier, 1994, pp. 366–72, doi:<a href="https://doi.org/10.1016/0959-4388(94)90098-1">10.1016/0959-4388(94)90098-1</a>.
  short: P.M. Jonas, N. Spruston, Current Opinion in Neurobiology 4 (1994) 366–372.
date_created: 2018-12-11T12:03:27Z
date_published: 1994-06-01T00:00:00Z
date_updated: 2022-06-03T11:26:52Z
day: '01'
doi: 10.1016/0959-4388(94)90098-1
extern: '1'
external_id:
  pmid:
  - '7522678 '
intvolume: '         4'
issue: '3'
language:
- iso: eng
main_file_link:
- url: https://www.sciencedirect.com/science/article/pii/0959438894900981?via%3Dihub
month: '06'
oa_version: None
page: 366 - 372
pmid: 1
publication: Current Opinion in Neurobiology
publication_identifier:
  issn:
  - 0959-4388
publication_status: published
publisher: Elsevier
publist_id: '2927'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Mechanisms shaping glutamate-mediated excitatory postsynaptic currents in the
  CNS
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 4
year: '1994'
...
---
_id: '3475'
abstract:
- lang: eng
  text: '1. A potassium channel activated by internal Na+ ions (K+Na channel) was
    identified in peripheral myelinated axons of Xenopus laevis using the cell-attached
    and excised configurations of the patch clamp technique. 2. The single-channel
    conductance for the main open state was 88 pS with [K+]o = 105 mM and pS with
    [K+]o = 2.5 mM ([K+]i = 105 mM). The channel was selectively permeable to K+ over
    Na+ ions. A characteristic feature of the K+Na channel was the frequent occurrence
    of subconductance states. 3. The open probability of the channel was strongly
    dependent on the concentration of Na+ ions at the inner side of the membrane.
    The half-maximal activating Na+ concentration and the Hill coefficient were 33
    mM and 2.9, respectively. The open probability of the channel showed only weak
    potential dependence. 4. The K+Na channel was relatively insensitive to external
    tetraethylammonium (TEA+) in comparison with voltage-dependent axonal K+ channels;
    the half-maximal inhibitory concentration (IC50) was 21.3 mM (at -90 mV). In contrast,
    the channel was blocked by low concentrations of external Ba2+ and Cs+ ions, with
    IC50 values of 0.7 and 1.1 mM, respectively (at -90 mV). The block by Ba2+ and
    Cs+ was more pronounced at negative than at positive membrane potentials. 5. A
    comparison of the number of K+Na channels in nodal and paranodal patches from
    the same axon revealed that the channel density was about 10-fold higher at the
    node of Ranvier than at the paranode. Moreover, a correlation between the number
    of K+Na channels and voltage-dependent Na+ channels in the same patches was found,
    suggesting co-localization of both channel types. 6. As weakly potential-dependent
    (''leakage'') channels, axonal K+Na channels may be involved in setting the resting
    potential of vertebrate axons. Simulations of Na+ ion diffusion suggest two possible
    mechanisms of activation of K+Na channels: the local increase of Na+ concentration
    in a cluster of Na+ channels during a single action potential or the accumulation
    in the intracellular axonal compartment during a train of action potentials.'
acknowledgement: 'We thank Drs M.Häusser and A. Villarroel for critically reading
  the manuscript, Dr E. v. Kitzing and A. Roth for many helpful discussions. This
  work was supported by the Deutsche Forschungsgemeinschaft (Vo188/13-2). '
article_processing_charge: No
article_type: original
author:
- first_name: Duk
  full_name: Koh, Duk
  last_name: Koh
- 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: Werner
  full_name: Vogel, Werner
  last_name: Vogel
citation:
  ama: Koh D, Jonas PM, Vogel W. Na+-activated K+ channels localized in the nodal
    region of myelinated axons of Xenopus. <i>Journal of Physiology</i>. 1994;479:183-197.
    doi:<a href="https://doi.org/10.1113/jphysiol.1994.sp020287">10.1113/jphysiol.1994.sp020287</a>
  apa: Koh, D., Jonas, P. M., &#38; Vogel, W. (1994). Na+-activated K+ channels localized
    in the nodal region of myelinated axons of Xenopus. <i>Journal of Physiology</i>.
    Wiley-Blackwell. <a href="https://doi.org/10.1113/jphysiol.1994.sp020287">https://doi.org/10.1113/jphysiol.1994.sp020287</a>
  chicago: Koh, Duk, Peter M Jonas, and Werner Vogel. “Na+-Activated K+ Channels Localized
    in the Nodal Region of Myelinated Axons of Xenopus.” <i>Journal of Physiology</i>.
    Wiley-Blackwell, 1994. <a href="https://doi.org/10.1113/jphysiol.1994.sp020287">https://doi.org/10.1113/jphysiol.1994.sp020287</a>.
  ieee: D. Koh, P. M. Jonas, and W. Vogel, “Na+-activated K+ channels localized in
    the nodal region of myelinated axons of Xenopus,” <i>Journal of Physiology</i>,
    vol. 479. Wiley-Blackwell, pp. 183–197, 1994.
  ista: Koh D, Jonas PM, Vogel W. 1994. Na+-activated K+ channels localized in the
    nodal region of myelinated axons of Xenopus. Journal of Physiology. 479, 183–197.
  mla: Koh, Duk, et al. “Na+-Activated K+ Channels Localized in the Nodal Region of
    Myelinated Axons of Xenopus.” <i>Journal of Physiology</i>, vol. 479, Wiley-Blackwell,
    1994, pp. 183–97, doi:<a href="https://doi.org/10.1113/jphysiol.1994.sp020287">10.1113/jphysiol.1994.sp020287</a>.
  short: D. Koh, P.M. Jonas, W. Vogel, Journal of Physiology 479 (1994) 183–197.
date_created: 2018-12-11T12:03:31Z
date_published: 1994-01-01T00:00:00Z
date_updated: 2022-06-03T11:09:21Z
day: '01'
doi: 10.1113/jphysiol.1994.sp020287
extern: '1'
external_id:
  pmid:
  - '7799220 '
intvolume: '       479'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC1155738/
month: '01'
oa: 1
oa_version: Published Version
page: 183 - 197
pmid: 1
publication: Journal of Physiology
publication_identifier:
  issn:
  - 0022-3751
publication_status: published
publisher: Wiley-Blackwell
publist_id: '2912'
quality_controlled: '1'
status: public
title: Na+-activated K+ channels localized in the nodal region of myelinated axons
  of Xenopus
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 479
year: '1994'
...
---
_id: '3476'
abstract:
- lang: eng
  text: Tight-seal whole-cell recordings were made from cleaned somata of CA3 pyramidal
    cells deep in hippocampal slices from 19–21-d-old rats. The cells were filled
    with biocytin, and their voltage responses to short current pulses were recorded.
    After washout of initial sag, responses scaled linearly with injected current
    and were stable over time. The dendritic and axonal arbors of four cells were
    reconstructed and measured using light microscopy. Dendritic spines and axonal
    boutons were counted and the additional membrane area was incorporated into the
    relevant segments. The morphology of each neuron was converted into a detailed
    branching cable model by assuming values for specific membrane capacitance Cm
    and resistance Rm, and cytoplasmic resistivity Ri. These parameters were optimized
    for each cell by directly matching the model's response to that of the real cell
    by means of a modified weighted least-squares fitting procedure. By comparing
    the deviations between model and experimental responses to control noise recordings,
    approximate 95% confidence intervals were established for each parameter. If a
    somatic shunt was allowed, a wide range of possible Rm values produced acceptable
    fits. With zero shunt, Cm was 0.7–0.8 microFcm-2, Ri was 170–340 omega cm, and
    Rm ranged between 120 and 200 k omega cm2. The electrotonic lengths of the basal
    and oblique dendrites were 0.2–0.3 space constants, and those of the apical tufts
    were 0.4–0.7 space constants. The steady-state electrical geometry of these cells
    was therefore compact; average dendritic tip/soma relative synaptic efficacies
    were &gt; 93% for the basal and oblique dendrites, and &gt; 81% for the tufts.
    With fast transient synaptic inputs, however, the models produced a wide range
    of postsynaptic potential shapes and marked filtering of voltage-clamp currents.
acknowledgement: 'logy Training Fellowship. A.L. was supported by a Royal Society
  Fellowship. The Oxford part of the collaboration was funded by a Wellcome Trust
  Programme Grant, the Heidelberg part by the Max-Planck Gesellschaft. We are grateful
  to Sir David Cox for his comments on the statistics, to K. Stratford, M. Hausser,
  D. Flitney, M. O’Neill, S. Gough, G. Stuart, N. Spruston, P. Stem, and K. Bauer
  for their help and useful discussions, and to M. Kaiser for technical assistance. '
article_processing_charge: No
article_type: original
author:
- first_name: Guy
  full_name: Major, Guy
  last_name: Major
- first_name: Alan
  full_name: Larkman, Alan
  last_name: Larkman
- 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: Bert
  full_name: Sakmann, Bert
  last_name: Sakmann
- first_name: Julian
  full_name: Jack, Julian
  last_name: Jack
citation:
  ama: Major G, Larkman A, Jonas PM, Sakmann B, Jack J. Detailed passive cable models
    of whole-cell recorded CA3 pyramidal neurons in rat hippocampal slices. <i>Journal
    of Neuroscience</i>. 1994;14(8):4613-4638. doi:<a href="https://doi.org/10.1523/JNEUROSCI.14-08-04613.1994">10.1523/JNEUROSCI.14-08-04613.1994</a>
  apa: Major, G., Larkman, A., Jonas, P. M., Sakmann, B., &#38; Jack, J. (1994). Detailed
    passive cable models of whole-cell recorded CA3 pyramidal neurons in rat hippocampal
    slices. <i>Journal of Neuroscience</i>. Society for Neuroscience. <a href="https://doi.org/10.1523/JNEUROSCI.14-08-04613.1994">https://doi.org/10.1523/JNEUROSCI.14-08-04613.1994</a>
  chicago: Major, Guy, Alan Larkman, Peter M Jonas, Bert Sakmann, and Julian Jack.
    “Detailed Passive Cable Models of Whole-Cell Recorded CA3 Pyramidal Neurons in
    Rat Hippocampal Slices.” <i>Journal of Neuroscience</i>. Society for Neuroscience,
    1994. <a href="https://doi.org/10.1523/JNEUROSCI.14-08-04613.1994">https://doi.org/10.1523/JNEUROSCI.14-08-04613.1994</a>.
  ieee: G. Major, A. Larkman, P. M. Jonas, B. Sakmann, and J. Jack, “Detailed passive
    cable models of whole-cell recorded CA3 pyramidal neurons in rat hippocampal slices,”
    <i>Journal of Neuroscience</i>, vol. 14, no. 8. Society for Neuroscience, pp.
    4613–4638, 1994.
  ista: Major G, Larkman A, Jonas PM, Sakmann B, Jack J. 1994. Detailed passive cable
    models of whole-cell recorded CA3 pyramidal neurons in rat hippocampal slices.
    Journal of Neuroscience. 14(8), 4613–4638.
  mla: Major, Guy, et al. “Detailed Passive Cable Models of Whole-Cell Recorded CA3
    Pyramidal Neurons in Rat Hippocampal Slices.” <i>Journal of Neuroscience</i>,
    vol. 14, no. 8, Society for Neuroscience, 1994, pp. 4613–38, doi:<a href="https://doi.org/10.1523/JNEUROSCI.14-08-04613.1994">10.1523/JNEUROSCI.14-08-04613.1994</a>.
  short: G. Major, A. Larkman, P.M. Jonas, B. Sakmann, J. Jack, Journal of Neuroscience
    14 (1994) 4613–4638.
date_created: 2018-12-11T12:03:32Z
date_published: 1994-08-01T00:00:00Z
date_updated: 2022-06-03T09:36:43Z
day: '01'
doi: 10.1523/JNEUROSCI.14-08-04613.1994
extern: '1'
external_id:
  pmid:
  - '8046439 '
intvolume: '        14'
issue: '8'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://europepmc.org/article/med/8046439
month: '08'
oa: 1
oa_version: Published Version
page: 4613 - 4638
pmid: 1
publication: Journal of Neuroscience
publication_identifier:
  issn:
  - 0270-6474
publication_status: published
publisher: Society for Neuroscience
publist_id: '2911'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Detailed passive cable models of whole-cell recorded CA3 pyramidal neurons
  in rat hippocampal slices
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 14
year: '1994'
...
---
_id: '3477'
abstract:
- lang: eng
  text: Fast excitatory synaptic transmission in the CNS is mediated by AMPA-type
    glutamate receptor (GluR) channels. Heterologous expression suggested that the
    Ca2+ permeability of these receptors critically depends on the subunit composition.
    Using patch-clamp techniques in brain slices, we found that the Ca2+ permeability
    of native AMPA-type GluRs was markedly higher in nonpyramidal (P(Ca)/P(K) ≃ 0.63)
    than in pyramidal (P(Ca)/P(K) ≃ 0.05) neurons of rat neocortex. Analysis of mRNA
    in single cells indicated that the relative abundance of GluR-B-specific mRNA
    was significantly lower in nonpyramidal (GluR-B/GluR-non-B ≃ 0.3) than in pyramidal
    (GluR-B/GluR-non-B ≃ 3) cells. This suggests that differences in relative abundance
    of GluR-B- specific mRNA generate functional diversity of AMPA-type GluRs in neurons
    with respect to Ca2+ permeability.
acknowledgement: We thank Drs. B. Lambolez and J. Rossier for helping to establish
  the method of single-cell PCR, Dr. M. Frotscher for help with cell identification,
  Dr. N. Spruston for critically reading the manuscript, and M. Kaiser and U. Keller
  for technical assistance. This work was supported in part by BMFT grant BCT 364
  AZ 3211 7291 (P. H. S.) and by DFG grant SFB-317/B14 (P. J.). The costs of publication
  of this article were defrayed in part by the payment of page charges. This article
  must therefore be hereby marked “advertisement” in accordance with 18 USC Section
  1734 solely to indicate this fact.
article_processing_charge: No
article_type: original
author:
- 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: Claudia
  full_name: Racca, Claudia
  last_name: Racca
- first_name: Bert
  full_name: Sakmann, Bert
  last_name: Sakmann
- first_name: Peter
  full_name: Seeburg, Peter
  last_name: Seeburg
- first_name: Hannah
  full_name: Monyer, Hannah
  last_name: Monyer
citation:
  ama: Jonas PM, Racca C, Sakmann B, Seeburg P, Monyer H. Differences in Ca(2+) permeability
    of AMPA-type glutamate receptor channels in neocortical neurons caused by differential
    GluR-B subunit expression. <i>Neuron</i>. 1994;12(6):1281-1289. doi:<a href="https://doi.org/10.1016/0896-6273(94)90444-8">10.1016/0896-6273(94)90444-8</a>
  apa: Jonas, P. M., Racca, C., Sakmann, B., Seeburg, P., &#38; Monyer, H. (1994).
    Differences in Ca(2+) permeability of AMPA-type glutamate receptor channels in
    neocortical neurons caused by differential GluR-B subunit expression. <i>Neuron</i>.
    Elsevier. <a href="https://doi.org/10.1016/0896-6273(94)90444-8">https://doi.org/10.1016/0896-6273(94)90444-8</a>
  chicago: Jonas, Peter M, Claudia Racca, Bert Sakmann, Peter Seeburg, and Hannah
    Monyer. “Differences in Ca(2+) Permeability of AMPA-Type Glutamate Receptor Channels
    in Neocortical Neurons Caused by Differential GluR-B Subunit Expression.” <i>Neuron</i>.
    Elsevier, 1994. <a href="https://doi.org/10.1016/0896-6273(94)90444-8">https://doi.org/10.1016/0896-6273(94)90444-8</a>.
  ieee: P. M. Jonas, C. Racca, B. Sakmann, P. Seeburg, and H. Monyer, “Differences
    in Ca(2+) permeability of AMPA-type glutamate receptor channels in neocortical
    neurons caused by differential GluR-B subunit expression,” <i>Neuron</i>, vol.
    12, no. 6. Elsevier, pp. 1281–1289, 1994.
  ista: Jonas PM, Racca C, Sakmann B, Seeburg P, Monyer H. 1994. Differences in Ca(2+)
    permeability of AMPA-type glutamate receptor channels in neocortical neurons caused
    by differential GluR-B subunit expression. Neuron. 12(6), 1281–1289.
  mla: Jonas, Peter M., et al. “Differences in Ca(2+) Permeability of AMPA-Type Glutamate
    Receptor Channels in Neocortical Neurons Caused by Differential GluR-B Subunit
    Expression.” <i>Neuron</i>, vol. 12, no. 6, Elsevier, 1994, pp. 1281–89, doi:<a
    href="https://doi.org/10.1016/0896-6273(94)90444-8">10.1016/0896-6273(94)90444-8</a>.
  short: P.M. Jonas, C. Racca, B. Sakmann, P. Seeburg, H. Monyer, Neuron 12 (1994)
    1281–1289.
date_created: 2018-12-11T12:03:32Z
date_published: 1994-06-01T00:00:00Z
date_updated: 2022-06-03T09:29:36Z
day: '01'
doi: 10.1016/0896-6273(94)90444-8
extern: '1'
external_id:
  pmid:
  - '8011338 '
intvolume: '        12'
issue: '6'
language:
- iso: eng
main_file_link:
- url: https://www.sciencedirect.com/science/article/pii/0896627394904448?via%3Dihub
month: '06'
oa_version: None
page: 1281 - 1289
pmid: 1
publication: Neuron
publication_identifier:
  issn:
  - 0896-6273
publication_status: published
publisher: Elsevier
publist_id: '2910'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Differences in Ca(2+) permeability of AMPA-type glutamate receptor channels
  in neocortical neurons caused by differential GluR-B subunit expression
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 12
year: '1994'
...
---
_id: '3550'
acknowledgement: This work is partially supported by the National Science Foundation,
  under grant ASC-9200301 and the Alan T. Waterman award, grant CCR-9118874
article_processing_charge: No
author:
- first_name: Herbert
  full_name: Edelsbrunner, Herbert
  id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
  last_name: Edelsbrunner
  orcid: 0000-0002-9823-6833
citation:
  ama: 'Edelsbrunner H. Modeling with simplicial complexes (topology, geometry and
    algorithms). In: <i>Proceedings of the 6th Canadian Conference on Computational
    Geometry</i>. ; 1994:36-44.'
  apa: Edelsbrunner, H. (1994). Modeling with simplicial complexes (topology, geometry
    and algorithms). In <i>Proceedings of the 6th Canadian Conference on Computational
    Geometry</i> (pp. 36–44). Saskatoon, Canada.
  chicago: Edelsbrunner, Herbert. “Modeling with Simplicial Complexes (Topology, Geometry
    and Algorithms).” In <i>Proceedings of the 6th Canadian Conference on Computational
    Geometry</i>, 36–44, 1994.
  ieee: H. Edelsbrunner, “Modeling with simplicial complexes (topology, geometry and
    algorithms),” in <i>Proceedings of the 6th Canadian Conference on Computational
    Geometry</i>, Saskatoon, Canada, 1994, pp. 36–44.
  ista: 'Edelsbrunner H. 1994. Modeling with simplicial complexes (topology, geometry
    and algorithms). Proceedings of the 6th Canadian Conference on Computational Geometry.
    CCCG: Canadian Conference on Computational Geometry, 36–44.'
  mla: Edelsbrunner, Herbert. “Modeling with Simplicial Complexes (Topology, Geometry
    and Algorithms).” <i>Proceedings of the 6th Canadian Conference on Computational
    Geometry</i>, 1994, pp. 36–44.
  short: H. Edelsbrunner, in:, Proceedings of the 6th Canadian Conference on Computational
    Geometry, 1994, pp. 36–44.
conference:
  location: Saskatoon, Canada
  name: 'CCCG: Canadian Conference on Computational Geometry'
date_created: 2018-12-11T12:03:55Z
date_published: 1994-08-01T00:00:00Z
date_updated: 2022-06-03T08:50:45Z
day: '01'
extern: '1'
language:
- iso: eng
month: '08'
oa_version: None
page: 36 - 44
publication: Proceedings of the 6th Canadian Conference on Computational Geometry
publication_status: published
publist_id: '2835'
quality_controlled: '1'
status: public
title: Modeling with simplicial complexes (topology, geometry and algorithms)
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
year: '1994'
...
---
_id: '3641'
abstract:
- lang: eng
  text: The probability of fixation of a mutation with selective advantage s will
    be reduced by substitutions at other loci. The effect of a single substitution,
    with selective advantage S0016672300032857inline1, can be approximated as a sudden
    reduction in the frequency of the favourable allele, by a fraction w = 1 −(s/S)r/s
    (where r is the recombination rate). An expression for the effect of a given sequence
    of such catastrophes is derived. This also applies to the ecological prxoblem
    of finding the probability that a small population will survive, despite occasional
    disasters. It is shown that if substitutions occur at a rate Δ, and are scattered
    randomly over a genetic map of length R, then an allele is unlikely to be fixed
    if its advantage is less than a critical value, Scrit = (π2/6)(2ΔS/(Rlog(S/s))).
    This threshold depends primarily on the variance in fitness per unit map length
    dueto substitutions, var(W)/R = 2ΔS/R. With no recombination, the fixation probability
    can be calculated for a finite population. If Δ &gt; s, it is of the same order
    as for a neutral allele ( ≈ Δ/(2N(Δ−s))), whilst if S0016672300032857inline2,
    fixation probability is much higher than for a neutral allele, but much lower
    than in the absence of hitch-hiking S0016672300032857inline3. These results suggest
    that hitch-hiking may substantially impede the accumulation of weakly favoured
    adaptations.
article_processing_charge: No
article_type: original
author:
- first_name: Nicholas H
  full_name: Barton, Nicholas H
  id: 4880FE40-F248-11E8-B48F-1D18A9856A87
  last_name: Barton
  orcid: 0000-0002-8548-5240
citation:
  ama: Barton NH. The reduction in fixation probability caused by substitutions at
    linked loci. <i>Genetical Research</i>. 1994;64(3):199-208. doi:<a href="https://doi.org/10.1017/S0016672300032857
    ">10.1017/S0016672300032857 </a>
  apa: Barton, N. H. (1994). The reduction in fixation probability caused by substitutions
    at linked loci. <i>Genetical Research</i>. Cambridge University Press. <a href="https://doi.org/10.1017/S0016672300032857
    ">https://doi.org/10.1017/S0016672300032857 </a>
  chicago: Barton, Nicholas H. “The Reduction in Fixation Probability Caused by Substitutions
    at Linked Loci.” <i>Genetical Research</i>. Cambridge University Press, 1994.
    <a href="https://doi.org/10.1017/S0016672300032857 ">https://doi.org/10.1017/S0016672300032857
    </a>.
  ieee: N. H. Barton, “The reduction in fixation probability caused by substitutions
    at linked loci,” <i>Genetical Research</i>, vol. 64, no. 3. Cambridge University
    Press, pp. 199–208, 1994.
  ista: Barton NH. 1994. The reduction in fixation probability caused by substitutions
    at linked loci. Genetical Research. 64(3), 199–208.
  mla: Barton, Nicholas H. “The Reduction in Fixation Probability Caused by Substitutions
    at Linked Loci.” <i>Genetical Research</i>, vol. 64, no. 3, Cambridge University
    Press, 1994, pp. 199–208, doi:<a href="https://doi.org/10.1017/S0016672300032857
    ">10.1017/S0016672300032857 </a>.
  short: N.H. Barton, Genetical Research 64 (1994) 199–208.
date_created: 2018-12-11T12:04:23Z
date_published: 1994-12-01T00:00:00Z
date_updated: 2022-06-03T08:34:32Z
day: '01'
doi: '10.1017/S0016672300032857 '
extern: '1'
intvolume: '        64'
issue: '3'
language:
- iso: eng
main_file_link:
- url: https://www.cambridge.org/core/journals/genetics-research/article/reduction-in-fixation-probability-caused-by-substitutions-at-linked-loci/458BBF3E7FE92E4EA6AFB2B000A98945
month: '12'
oa_version: None
page: 199 - 208
publication: Genetical Research
publication_identifier:
  issn:
  - 0016-6723
publication_status: published
publisher: Cambridge University Press
publist_id: '2742'
quality_controlled: '1'
scopus_import: '1'
status: public
title: The reduction in fixation probability caused by substitutions at linked loci
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 64
year: '1994'
...
---
_id: '3642'
abstract:
- lang: eng
  text: We develop a general population genetic framework for analyzing selection
    on many loci, and apply it to strong truncation and disruptive selection on an
    additive polygenic trait. We first present statistical methods for analyzing the
    infinitesimal model, in which offspring breeding values are normally distributed
    around the mean of the parents, with fixed variance. These show that the usual
    assumption of a Gaussian distribution of breeding values in the population gives
    remarkably accurate predictions for the mean and the variance, even when disruptive
    selection generates substantial deviations from normality. We then set out a general
    genetic analysis of selection and recombination. The population is represented
    by multilocus cumulants describing the distribution of haploid genotypes, and
    selection is described by the relation between mean fitness and these cumulants.
    We provide exact recursions in terms of generating functions for the effects of
    selection on non-central moments. The effects of recombination are simply calculated
    as a weighted sum over all the permutations produced by meiosis. Finally, the
    new cumulants that describe the next generation are computed from the non-central
    moments. Although this scheme is applied here in detail only to selection on an
    additive trait, it is quite general. For arbitrary epistasis and linkage, we describe
    a consistent infinitesimal limit in which the short-term selection response is
    dominated by infinitesimal allele frequency changes and linkage disequilibria.
    Numerical multilocus results show that the standard Gaussian approximation gives
    accurate predictions for the dynamics of the mean and genetic variance in this
    limit. Even with intense truncation selection, linkage disequilibria of order
    three and higher never cause much deviation from normality. Thus, the empirical
    deviations frequently found between predicted and observed responses to artificial
    selection are not caused by linkage-disequilibrium-induced departures from normality.
    Disruptive selection can generate substantial four-way disequilibria, and hence
    kurtosis; but even then, the Gaussian assumption predicts the variance accurately.
    In contrast to the apparent simplicity of the infinitesimal limit, data suggest
    that changes in genetic variance after 10 or more generations of selection are
    likely to be dominated by allele frequency dynamics that depend on genetic details.
article_processing_charge: No
article_type: original
author:
- first_name: Michael
  full_name: Turelli, Michael
  last_name: Turelli
- first_name: Nicholas H
  full_name: Barton, Nicholas H
  id: 4880FE40-F248-11E8-B48F-1D18A9856A87
  last_name: Barton
  orcid: 0000-0002-8548-5240
citation:
  ama: 'Turelli M, Barton NH. Genetic and statistical analyses of strong selection
    on polygenic traits: What, me normal? <i>Genetics</i>. 1994;138(3):913-941. doi:<a
    href="https://doi.org/10.1093/genetics/138.3.913">10.1093/genetics/138.3.913</a>'
  apa: 'Turelli, M., &#38; Barton, N. H. (1994). Genetic and statistical analyses
    of strong selection on polygenic traits: What, me normal? <i>Genetics</i>. Genetics
    Society of America. <a href="https://doi.org/10.1093/genetics/138.3.913">https://doi.org/10.1093/genetics/138.3.913</a>'
  chicago: 'Turelli, Michael, and Nicholas H Barton. “Genetic and Statistical Analyses
    of Strong Selection on Polygenic Traits: What, Me Normal?” <i>Genetics</i>. Genetics
    Society of America, 1994. <a href="https://doi.org/10.1093/genetics/138.3.913">https://doi.org/10.1093/genetics/138.3.913</a>.'
  ieee: 'M. Turelli and N. H. Barton, “Genetic and statistical analyses of strong
    selection on polygenic traits: What, me normal?,” <i>Genetics</i>, vol. 138, no.
    3. Genetics Society of America, pp. 913–941, 1994.'
  ista: 'Turelli M, Barton NH. 1994. Genetic and statistical analyses of strong selection
    on polygenic traits: What, me normal? Genetics. 138(3), 913–941.'
  mla: 'Turelli, Michael, and Nicholas H. Barton. “Genetic and Statistical Analyses
    of Strong Selection on Polygenic Traits: What, Me Normal?” <i>Genetics</i>, vol.
    138, no. 3, Genetics Society of America, 1994, pp. 913–41, doi:<a href="https://doi.org/10.1093/genetics/138.3.913">10.1093/genetics/138.3.913</a>.'
  short: M. Turelli, N.H. Barton, Genetics 138 (1994) 913–941.
date_created: 2018-12-11T12:04:24Z
date_published: 1994-11-01T00:00:00Z
date_updated: 2022-06-03T08:18:54Z
day: '01'
doi: 10.1093/genetics/138.3.913
extern: '1'
external_id:
  pmid:
  - '7851785'
intvolume: '       138'
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://pubmed.ncbi.nlm.nih.gov/7851785/
month: '11'
oa: 1
oa_version: Published Version
page: 913 - 941
pmid: 1
publication: Genetics
publication_identifier:
  issn:
  - 0016-6731
publication_status: published
publisher: Genetics Society of America
publist_id: '2741'
quality_controlled: '1'
status: public
title: 'Genetic and statistical analyses of strong selection on polygenic traits:
  What, me normal?'
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 138
year: '1994'
...
---
_id: '4032'
abstract:
- lang: eng
  text: Every collection of t≥2 n2 triangles with a total of n vertices in ℝ3 has
    Ω(t4/n6) crossing pairs. This implies that one of their edges meets Ω(t3/n6) of
    the triangles. From this it follows that n points in ℝ3 have only O(n8/3) halving
    planes.
acknowledgement: The research of H. Edelsbrunner was supported by the National Science
  Foundation under Grant CCR-8921421 and under an Alan T. Waterman award, Grant CCR-9118874.
  Any opinions, findings and conclusions or recommendations expressed in this publication
  are those of the authors and do not necessarily reflect the view of the National
  Science Foundation.
article_processing_charge: No
article_type: original
author:
- first_name: Tamal
  full_name: Dey, Tamal
  last_name: Dey
- first_name: Herbert
  full_name: Edelsbrunner, Herbert
  id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
  last_name: Edelsbrunner
  orcid: 0000-0002-9823-6833
citation:
  ama: Dey T, Edelsbrunner H. Counting triangle crossings and halving planes. <i>Discrete
    &#38; Computational Geometry</i>. 1994;12(1):281-289. doi:<a href="https://doi.org/10.1007/BF02574381">10.1007/BF02574381</a>
  apa: Dey, T., &#38; Edelsbrunner, H. (1994). Counting triangle crossings and halving
    planes. <i>Discrete &#38; Computational Geometry</i>. Springer. <a href="https://doi.org/10.1007/BF02574381">https://doi.org/10.1007/BF02574381</a>
  chicago: Dey, Tamal, and Herbert Edelsbrunner. “Counting Triangle Crossings and
    Halving Planes.” <i>Discrete &#38; Computational Geometry</i>. Springer, 1994.
    <a href="https://doi.org/10.1007/BF02574381">https://doi.org/10.1007/BF02574381</a>.
  ieee: T. Dey and H. Edelsbrunner, “Counting triangle crossings and halving planes,”
    <i>Discrete &#38; Computational Geometry</i>, vol. 12, no. 1. Springer, pp. 281–289,
    1994.
  ista: Dey T, Edelsbrunner H. 1994. Counting triangle crossings and halving planes.
    Discrete &#38; Computational Geometry. 12(1), 281–289.
  mla: Dey, Tamal, and Herbert Edelsbrunner. “Counting Triangle Crossings and Halving
    Planes.” <i>Discrete &#38; Computational Geometry</i>, vol. 12, no. 1, Springer,
    1994, pp. 281–89, doi:<a href="https://doi.org/10.1007/BF02574381">10.1007/BF02574381</a>.
  short: T. Dey, H. Edelsbrunner, Discrete &#38; Computational Geometry 12 (1994)
    281–289.
date_created: 2018-12-11T12:06:33Z
date_published: 1994-09-01T00:00:00Z
date_updated: 2022-06-02T12:53:01Z
day: '01'
doi: 10.1007/BF02574381
extern: '1'
intvolume: '        12'
issue: '1'
language:
- iso: eng
main_file_link:
- url: https://link.springer.com/article/10.1007/BF02574381
month: '09'
oa_version: None
page: 281 - 289
publication: Discrete & Computational Geometry
publication_identifier:
  issn:
  - 0179-5376
publication_status: published
publisher: Springer
publist_id: '2091'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Counting triangle crossings and halving planes
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 12
year: '1994'
...
