---
_id: '11857'
abstract:
- lang: eng
text: Two edges e/sub 1/ and e/sub 2/ of an undirected graph are cycle-equivalent
iff all cycles that contain e/sub 1/ also contain e/sub 2/, i.e., iff e/sub 1/
and e/sub 2/ are a cut-edge pair. The cycle-equivalence classes of the control-flow
graph are used in optimizing compilers to speed up existing control-flow and data-flow
algorithms. While the cycle-equivalence classes can be computed in linear time,
we present the first fully dynamic algorithm for maintaining the cycle-equivalence
relation. In an n-node graph our data structure executes an edge insertion or
deletion in O(/spl radic/n log n) time and answers the query whether two given
edges are cycle-equivalent in O(log/sup 2/ n) time. We also present an algorithm
for plane graphs with O(log n) update and query time and for planar graphs with
O(log n) insertion time and O(log/sup 2/ n) query and deletion time. Additionally,
we show a lower bound of /spl Omega/(log n/log log n) for the amortized time per
operation for the dynamic cycle-equivalence problem in the cell probe model.<
>
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. Fully dynamic cycle-equivalence in graphs. In: 35th Annual
Symposium on Foundations of Computer Science. Institute of Electrical and
Electronics Engineers; 1994:744-755. doi:10.1109/sfcs.1994.365718'
apa: 'Henzinger, M. H. (1994). Fully dynamic cycle-equivalence in graphs. In 35th
Annual Symposium on Foundations of Computer Science (pp. 744–755). Santa Fe,
NM, United States: Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/sfcs.1994.365718'
chicago: Henzinger, Monika H. “Fully Dynamic Cycle-Equivalence in Graphs.” In 35th
Annual Symposium on Foundations of Computer Science, 744–55. Institute of
Electrical and Electronics Engineers, 1994. https://doi.org/10.1109/sfcs.1994.365718.
ieee: M. H. Henzinger, “Fully dynamic cycle-equivalence in graphs,” in 35th Annual
Symposium on Foundations of Computer Science, Santa Fe, NM, United States,
1994, pp. 744–755.
ista: 'Henzinger MH. 1994. Fully dynamic cycle-equivalence in graphs. 35th Annual
Symposium on Foundations of Computer Science. FOCS: Symposium on Foundations of
Computer Science, 744–755.'
mla: Henzinger, Monika H. “Fully Dynamic Cycle-Equivalence in Graphs.” 35th Annual
Symposium on Foundations of Computer Science, Institute of Electrical and
Electronics Engineers, 1994, pp. 744–55, doi:10.1109/sfcs.1994.365718.
short: M.H. Henzinger, in:, 35th Annual Symposium on Foundations of Computer Science,
Institute of Electrical and Electronics Engineers, 1994, pp. 744–755.
conference:
end_date: 1994-11-22
location: Santa Fe, NM, United States
name: 'FOCS: Symposium on Foundations of Computer Science'
start_date: 1994-11-20
date_created: 2022-08-16T08:29:08Z
date_published: 1994-11-01T00:00:00Z
date_updated: 2023-02-17T09:58:04Z
day: '01'
doi: 10.1109/sfcs.1994.365718
extern: '1'
language:
- iso: eng
month: '11'
oa_version: None
page: 744 - 755
publication: 35th Annual Symposium on Foundations of Computer Science
publication_identifier:
isbn:
- 0-8186-6580-7
publication_status: published
publisher: Institute of Electrical and Electronics Engineers
quality_controlled: '1'
scopus_import: '1'
status: public
title: Fully dynamic cycle-equivalence in graphs
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '1994'
...
---
_id: '1947'
abstract:
- lang: eng
text: Mitochondrial transhydrogenase has been reported previously to be inhibited
by high, rather non-physiological concentrations (in the range of 2-20 mM) of
divalent cations. We show that the enzyme could be activated by low (from about
1 μM to 1 mM) concentrations of Ca2+ and Mg2+, which are within physiological
range. These results bring in line the effects observed with mitochondrial enzyme
to the findings with bacterial transhydrogenases. The activation of transhydrogenase
by divalent cations is interpreted as an increase in affinity of the NADP(H)-binding
site of the enzyme-NAD(H) complex. Reported effects of the metal ions could be
important for the enzyme function in vivo.
acknowledgement: 'This work was supported by a Wellcome Trust fellowship to L.A.S. '
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. Activation and inhibition of mitochondrial transhydrogenase
by metal ions. Biochimica et Biophysica Acta - Bioenergetics. 1993;1144(2):225-228.
doi:10.1016/0005-2728(93)90177-H
apa: Sazanov, L. A., & Jackson, J. (1993). Activation and inhibition of mitochondrial
transhydrogenase by metal ions. Biochimica et Biophysica Acta - Bioenergetics.
Elsevier. https://doi.org/10.1016/0005-2728(93)90177-H
chicago: Sazanov, Leonid A, and Julie Jackson. “Activation and Inhibition of Mitochondrial
Transhydrogenase by Metal Ions.” Biochimica et Biophysica Acta - Bioenergetics.
Elsevier, 1993. https://doi.org/10.1016/0005-2728(93)90177-H.
ieee: L. A. Sazanov and J. Jackson, “Activation and inhibition of mitochondrial
transhydrogenase by metal ions,” Biochimica et Biophysica Acta - Bioenergetics,
vol. 1144, no. 2. Elsevier, pp. 225–228, 1993.
ista: Sazanov LA, Jackson J. 1993. Activation and inhibition of mitochondrial transhydrogenase
by metal ions. Biochimica et Biophysica Acta - Bioenergetics. 1144(2), 225–228.
mla: Sazanov, Leonid A., and Julie Jackson. “Activation and Inhibition of Mitochondrial
Transhydrogenase by Metal Ions.” Biochimica et Biophysica Acta - Bioenergetics,
vol. 1144, no. 2, Elsevier, 1993, pp. 225–28, doi:10.1016/0005-2728(93)90177-H.
short: L.A. Sazanov, J. Jackson, Biochimica et Biophysica Acta - Bioenergetics 1144
(1993) 225–228.
date_created: 2018-12-11T11:54:52Z
date_published: 1993-09-13T00:00:00Z
date_updated: 2022-06-01T12:51:32Z
day: '13'
doi: 10.1016/0005-2728(93)90177-H
extern: '1'
external_id:
pmid:
- '8369341 '
intvolume: ' 1144'
issue: '2'
language:
- iso: eng
main_file_link:
- url: https://www.sciencedirect.com/science/article/pii/000527289390177H?via%3Dihub
month: '09'
oa_version: None
page: 225 - 228
pmid: 1
publication: Biochimica et Biophysica Acta - Bioenergetics
publication_identifier:
issn:
- 0005-2728
publication_status: published
publisher: Elsevier
publist_id: '5136'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Activation and inhibition of mitochondrial transhydrogenase by metal ions
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 1144
year: '1993'
...
---
_id: '1948'
acknowledgement: 'We acknowledge financial support from the Wellcome Trust (fellowship
to L.A.S) '
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. Possible functions of the NADP-linked isocitrate dehydrogenase
and H+ -transhydrogenase in heart mitochondria . Biochemical Society Transactions.
1993;21(3):260. doi:10.1042/bst021260s
apa: Sazanov, L. A., & Jackson, J. (1993). Possible functions of the NADP-linked
isocitrate dehydrogenase and H+ -transhydrogenase in heart mitochondria . Biochemical
Society Transactions. Portland Press. https://doi.org/10.1042/bst021260s
chicago: Sazanov, Leonid A, and Julie Jackson. “Possible Functions of the NADP-Linked
Isocitrate Dehydrogenase and H+ -Transhydrogenase in Heart Mitochondria .” Biochemical
Society Transactions. Portland Press, 1993. https://doi.org/10.1042/bst021260s.
ieee: L. A. Sazanov and J. Jackson, “Possible functions of the NADP-linked isocitrate
dehydrogenase and H+ -transhydrogenase in heart mitochondria ,” Biochemical
Society Transactions, vol. 21, no. 3. Portland Press, p. 260, 1993.
ista: Sazanov LA, Jackson J. 1993. Possible functions of the NADP-linked isocitrate
dehydrogenase and H+ -transhydrogenase in heart mitochondria . Biochemical Society
Transactions. 21(3), 260.
mla: Sazanov, Leonid A., and Julie Jackson. “Possible Functions of the NADP-Linked
Isocitrate Dehydrogenase and H+ -Transhydrogenase in Heart Mitochondria .” Biochemical
Society Transactions, vol. 21, no. 3, Portland Press, 1993, p. 260, doi:10.1042/bst021260s.
short: L.A. Sazanov, J. Jackson, Biochemical Society Transactions 21 (1993) 260.
date_created: 2018-12-11T11:54:52Z
date_published: 1993-01-01T00:00:00Z
date_updated: 2022-06-01T13:17:02Z
day: '01'
doi: 10.1042/bst021260s
extern: '1'
external_id:
pmid:
- '8224412 '
intvolume: ' 21'
issue: '3'
language:
- iso: eng
main_file_link:
- url: https://portlandpress.com/biochemsoctrans/article-abstract/21/3/260S/83260/Possible-functions-of-the-NADP-linked-isocitrate?redirectedFrom=fulltext
month: '01'
oa_version: None
page: '260'
pmid: 1
publication: Biochemical Society Transactions
publication_identifier:
issn:
- 0300-5127
publication_status: published
publisher: Portland Press
publist_id: '5137'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Possible functions of the NADP-linked isocitrate dehydrogenase and H+ -transhydrogenase
in heart mitochondria '
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 21
year: '1993'
...
---
_id: '1950'
article_processing_charge: No
article_type: original
author:
- first_name: Julie
full_name: Jackson, Julie
last_name: Jackson
- first_name: N P J
full_name: Cotton, N P J
last_name: Cotton
- first_name: Ross
full_name: Williams, Ross
last_name: Williams
- first_name: Tania
full_name: Bizouarn, Tania
last_name: Bizouarn
- first_name: Mike
full_name: Hutton, Mike
last_name: Hutton
- 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: Christopher
full_name: Thomas, Christopher
last_name: Thomas
citation:
ama: Jackson J, Cotton NPJ, Williams R, et al. Proton-translocating transhydrogenase
in bacteria. Biochemical Society Transactions. 1993;21(4):1010-1013. doi:10.1042/bst0211010
apa: Jackson, J., Cotton, N. P. J., Williams, R., Bizouarn, T., Hutton, M., Sazanov,
L. A., & Thomas, C. (1993). Proton-translocating transhydrogenase in bacteria.
Biochemical Society Transactions. Portland Press. https://doi.org/10.1042/bst0211010
chicago: Jackson, Julie, N P J Cotton, Ross Williams, Tania Bizouarn, Mike Hutton,
Leonid A Sazanov, and Christopher Thomas. “Proton-Translocating Transhydrogenase
in Bacteria.” Biochemical Society Transactions. Portland Press, 1993. https://doi.org/10.1042/bst0211010.
ieee: J. Jackson et al., “Proton-translocating transhydrogenase in bacteria,”
Biochemical Society Transactions, vol. 21, no. 4. Portland Press, pp. 1010–1013,
1993.
ista: Jackson J, Cotton NPJ, Williams R, Bizouarn T, Hutton M, Sazanov LA, Thomas
C. 1993. Proton-translocating transhydrogenase in bacteria. Biochemical Society
Transactions. 21(4), 1010–1013.
mla: Jackson, Julie, et al. “Proton-Translocating Transhydrogenase in Bacteria.”
Biochemical Society Transactions, vol. 21, no. 4, Portland Press, 1993,
pp. 1010–13, doi:10.1042/bst0211010.
short: J. Jackson, N.P.J. Cotton, R. Williams, T. Bizouarn, M. Hutton, L.A. Sazanov,
C. Thomas, Biochemical Society Transactions 21 (1993) 1010–1013.
date_created: 2018-12-11T11:54:52Z
date_published: 1993-11-01T00:00:00Z
date_updated: 2022-06-01T12:16:19Z
day: '01'
doi: 10.1042/bst0211010
extern: '1'
external_id:
pmid:
- '8131888'
intvolume: ' 21'
issue: '4'
language:
- iso: eng
main_file_link:
- url: https://portlandpress.com/biochemsoctrans/article-abstract/21/4/1010/86733/Proton-translocating-transhydrogenase-in-bacteria?redirectedFrom=fulltext
month: '11'
oa_version: None
page: 1010 - 1013
pmid: 1
publication: Biochemical Society Transactions
publication_identifier:
issn:
- 0300-5127
publication_status: published
publisher: Portland Press
publist_id: '5135'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Proton-translocating transhydrogenase in bacteria
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 21
year: '1993'
...
---
_id: '3446'
abstract:
- lang: eng
text: An effective character recognition procedure implemented on a new type of
hardware system and using a new architecture called CNND is proposed. This CNND
contains one or more analog cellular neural networks (CNNs) and some digital logic,
combining the advantages of the fast analog CNN signal processing and the fast
and easy decision capability of digital logic. It is shown that the CNND system
can be used for recognition of multifont printed or handwritten characters and
could recognize 100,000 char/s with a recognition rate of more than 95%. The more
advantage of the system over competing types is that there is not an extra feature
extraction procedure implemented in slow hardware
article_processing_charge: No
article_type: original
author:
- first_name: Tamas
full_name: Sziranyi, Tamas
last_name: Sziranyi
- first_name: Jozsef L
full_name: Csicsvari, Jozsef L
id: 3FA14672-F248-11E8-B48F-1D18A9856A87
last_name: Csicsvari
orcid: 0000-0002-5193-4036
citation:
ama: 'Sziranyi T, Csicsvari JL. High-speed character recognition using a dual cellular
neural network architecture (CNND). IEEE Transactions on Circuits and Systems
II: Analog and Digital Signal Processing. 1993;40(3):223-231. doi:10.1109/82.222823'
apa: 'Sziranyi, T., & Csicsvari, J. L. (1993). High-speed character recognition
using a dual cellular neural network architecture (CNND). IEEE Transactions
on Circuits and Systems II: Analog and Digital Signal Processing. IEEE. https://doi.org/10.1109/82.222823'
chicago: 'Sziranyi, Tamas, and Jozsef L Csicsvari. “High-Speed Character Recognition
Using a Dual Cellular Neural Network Architecture (CNND).” IEEE Transactions
on Circuits and Systems II: Analog and Digital Signal Processing. IEEE, 1993.
https://doi.org/10.1109/82.222823.'
ieee: 'T. Sziranyi and J. L. Csicsvari, “High-speed character recognition using
a dual cellular neural network architecture (CNND),” IEEE Transactions on Circuits
and Systems II: Analog and Digital Signal Processing, vol. 40, no. 3. IEEE,
pp. 223–231, 1993.'
ista: 'Sziranyi T, Csicsvari JL. 1993. High-speed character recognition using a
dual cellular neural network architecture (CNND). IEEE Transactions on Circuits
and Systems II: Analog and Digital Signal Processing. 40(3), 223–231.'
mla: 'Sziranyi, Tamas, and Jozsef L. Csicsvari. “High-Speed Character Recognition
Using a Dual Cellular Neural Network Architecture (CNND).” IEEE Transactions
on Circuits and Systems II: Analog and Digital Signal Processing, vol. 40,
no. 3, IEEE, 1993, pp. 223–31, doi:10.1109/82.222823.'
short: 'T. Sziranyi, J.L. Csicsvari, IEEE Transactions on Circuits and Systems II:
Analog and Digital Signal Processing 40 (1993) 223–231.'
date_created: 2018-12-11T12:03:22Z
date_published: 1993-03-01T00:00:00Z
date_updated: 2022-03-30T14:44:44Z
day: '01'
doi: 10.1109/82.222823
extern: '1'
intvolume: ' 40'
issue: '3'
language:
- iso: eng
main_file_link:
- url: https://ieeexplore.ieee.org/document/222823
month: '03'
oa_version: None
page: 223 - 231
publication: 'IEEE Transactions on Circuits and Systems II: Analog and Digital Signal
Processing'
publication_identifier:
issn:
- 1057-7130
publication_status: published
publisher: IEEE
publist_id: '2941'
quality_controlled: '1'
scopus_import: '1'
status: public
title: High-speed character recognition using a dual cellular neural network architecture
(CNND)
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 40
year: '1993'
...
---
_id: '3451'
acknowledgement: I thank Prof. B. Sakmann for generous support and Drs. M. Häusser
and A. Villarroel for critically reading the manuscript.
alternative_title:
- 'Annals of the New York Academy of Sciences '
article_processing_charge: No
author:
- 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: 'Jonas PM. Glutamate receptors in the central nervous system. In: Molecular
Basis of Ion Channels and Receptors Involved in Nerve Excitation, Synaptic Transmission,
and Muscle Contraction. Vol 707. Annals of the New York Academy of Sciences.
New York Academy of Sciences; 1993:126-135. doi:10.1111/j.1749-6632.1993.tb38048.x'
apa: Jonas, P. M. (1993). Glutamate receptors in the central nervous system. In
Molecular Basis of Ion Channels and Receptors Involved in Nerve Excitation,
Synaptic Transmission, and Muscle Contraction (Vol. 707, pp. 126–135). New
York Academy of Sciences. https://doi.org/10.1111/j.1749-6632.1993.tb38048.x
chicago: Jonas, Peter M. “Glutamate Receptors in the Central Nervous System.” In
Molecular Basis of Ion Channels and Receptors Involved in Nerve Excitation,
Synaptic Transmission, and Muscle Contraction, 707:126–35. Annals of the New
York Academy of Sciences. New York Academy of Sciences, 1993. https://doi.org/10.1111/j.1749-6632.1993.tb38048.x.
ieee: P. M. Jonas, “Glutamate receptors in the central nervous system,” in Molecular
Basis of Ion Channels and Receptors Involved in Nerve Excitation, Synaptic Transmission,
and Muscle Contraction, vol. 707, New York Academy of Sciences, 1993, pp.
126–135.
ista: 'Jonas PM. 1993.Glutamate receptors in the central nervous system. In: Molecular
Basis of Ion Channels and Receptors Involved in Nerve Excitation, Synaptic Transmission,
and Muscle Contraction. Annals of the New York Academy of Sciences , vol. 707,
126–135.'
mla: Jonas, Peter M. “Glutamate Receptors in the Central Nervous System.” Molecular
Basis of Ion Channels and Receptors Involved in Nerve Excitation, Synaptic Transmission,
and Muscle Contraction, vol. 707, New York Academy of Sciences, 1993, pp.
126–35, doi:10.1111/j.1749-6632.1993.tb38048.x.
short: P.M. Jonas, in:, Molecular Basis of Ion Channels and Receptors Involved in
Nerve Excitation, Synaptic Transmission, and Muscle Contraction, New York Academy
of Sciences, 1993, pp. 126–135.
date_created: 2018-12-11T12:03:24Z
date_published: 1993-12-20T00:00:00Z
date_updated: 2022-03-30T12:35:23Z
day: '20'
doi: 10.1111/j.1749-6632.1993.tb38048.x
extern: '1'
external_id:
pmid:
- '9729204'
intvolume: ' 707'
language:
- iso: eng
main_file_link:
- url: https://nyaspubs.onlinelibrary.wiley.com/doi/10.1111/j.1749-6632.1993.tb38048.x
month: '12'
oa_version: None
page: 126 - 135
pmid: 1
publication: Molecular Basis of Ion Channels and Receptors Involved in Nerve Excitation,
Synaptic Transmission, and Muscle Contraction
publication_status: published
publisher: New York Academy of Sciences
publist_id: '2936'
quality_controlled: '1'
scopus_import: '1'
series_title: Annals of the New York Academy of Sciences
status: public
title: Glutamate receptors in the central nervous system
type: book_chapter
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 707
year: '1993'
...
---
_id: '3452'
abstract:
- lang: eng
text: In recent years, considerable progress in our understanding of the molecular
events underlying excitatory synaptic transmission has been made. This progress
was mainly achieved by technical advances, among them the patch-clamp technique
in brain slices (Edwards et al., 1989), fast application of agonists (Franke et
al., 1987), and cloning and functional expression of GluR channels of the nonNMDA
type (e.g., Hollmann et al., 1989). A suitable model for studying excitatory postsynaptic
currents (EPSCs) in the brain slice with patch-clamp techniques is the mossy fiber
synapse on CA3 pyramidal cells of rat hippocampus (MF-CA3 synapse). This synapse
is located close to the cell soma and should provide almost ideal space-clamp
conditions. A comparison of MF-CA3 EPSCs with the currents activated by fast application
of glutamate on membrane patches isolated from CA3 cell somata suggests that the
concentration of glutamate in the synaptic cleft during excitatory synaptic transmission
is high (about 1 mM) and that the transmitter remains in the synaptic cleft only
briefly (about 1 ms). It seems likely that desensitization influences the peak
amplitude of the EPSC in several ways. Brief pulses of glutamate cause desensitization,
from which the glutamate receptor channels recover only slowly, and micromolar
ambient glutamate concentrations produce desensitization at equilibrium. From
the functional properties of recombinant GluR channels, in situ hybridization
data, and patch-clamp experiments on different neuronal and nonneuronal cell types,
a picture of the molecular identity of native channels emerges. In neurons of
the hippocampus the pharmacological features of these channels were similar to
recombinant channels assembled from subunits of the AMPA/kainate subtype which
are strongly expressed in these cells. The native channels are characterized by
outward rectification of the steady-state I-V and low Ca permeability, similar
to recombinant channels containing the GluR-B subunit. This is consistent with
the ubiquitous expression of this subunit in hippocampal neurones. In contrast,
GluR channels from cerebellar glial cells, which uniquely in the central nervous
system lack the expression of GluR-B subunits, show double rectification and high
Ca permeability. The results suggest that the native functional nonNMDA glutamate
receptor channels in the CNS are assembled form subunits of the AMPA/kainate subtype
in a cell-specific way, with the functional properties of GluR channels in neurones
being dominated by the GluR-B subunit.
alternative_title:
- EXS
article_processing_charge: No
author:
- 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: 'Jonas PM. AMPA-type glutamate receptors - nonselective cation channels mediating
fast excitatory transmission in the CNS. In: Siemen D, ed. Nonselective Cation
Channels: Pharmacology, Physiology and Biophysics. Vol 66. Birkhäuser; 1993:61-76.
doi:10.1007/978-3-0348-7327-7_4'
apa: 'Jonas, P. M. (1993). AMPA-type glutamate receptors - nonselective cation channels
mediating fast excitatory transmission in the CNS. In D. Siemen (Ed.), Nonselective
cation channels: Pharmacology, Physiology and Biophysics. (Vol. 66, pp. 61–76).
Birkhäuser. https://doi.org/10.1007/978-3-0348-7327-7_4'
chicago: 'Jonas, Peter M. “AMPA-Type Glutamate Receptors - Nonselective Cation Channels
Mediating Fast Excitatory Transmission in the CNS.” In Nonselective Cation
Channels: Pharmacology, Physiology and Biophysics., edited by Detlef Siemen,
66:61–76. Birkhäuser, 1993. https://doi.org/10.1007/978-3-0348-7327-7_4.'
ieee: 'P. M. Jonas, “AMPA-type glutamate receptors - nonselective cation channels
mediating fast excitatory transmission in the CNS,” in Nonselective cation
channels: Pharmacology, Physiology and Biophysics., vol. 66, D. Siemen, Ed.
Birkhäuser, 1993, pp. 61–76.'
ista: 'Jonas PM. 1993.AMPA-type glutamate receptors - nonselective cation channels
mediating fast excitatory transmission in the CNS. In: Nonselective cation channels:
Pharmacology, Physiology and Biophysics. EXS, vol. 66, 61–76.'
mla: 'Jonas, Peter M. “AMPA-Type Glutamate Receptors - Nonselective Cation Channels
Mediating Fast Excitatory Transmission in the CNS.” Nonselective Cation Channels:
Pharmacology, Physiology and Biophysics., edited by Detlef Siemen, vol. 66,
Birkhäuser, 1993, pp. 61–76, doi:10.1007/978-3-0348-7327-7_4.'
short: 'P.M. Jonas, in:, D. Siemen (Ed.), Nonselective Cation Channels: Pharmacology,
Physiology and Biophysics., Birkhäuser, 1993, pp. 61–76.'
date_created: 2018-12-11T12:03:24Z
date_published: 1993-01-01T00:00:00Z
date_updated: 2022-03-30T11:46:44Z
day: '01'
doi: 10.1007/978-3-0348-7327-7_4
editor:
- first_name: Detlef
full_name: Siemen, Detlef
last_name: Siemen
extern: '1'
external_id:
pmid:
- '7505664'
intvolume: ' 66'
language:
- iso: eng
main_file_link:
- url: https://link.springer.com/chapter/10.1007/978-3-0348-7327-7_4
month: '01'
oa_version: None
page: 61 - 76
pmid: 1
publication: 'Nonselective cation channels: Pharmacology, Physiology and Biophysics.'
publication_identifier:
isbn:
- 978-3-0348-7327-7
publication_status: published
publisher: Birkhäuser
publist_id: '2935'
quality_controlled: '1'
scopus_import: '1'
status: public
title: AMPA-type glutamate receptors - nonselective cation channels mediating fast
excitatory transmission in the CNS
type: book_chapter
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 66
year: '1993'
...
---
_id: '3473'
abstract:
- lang: eng
text: Sixteen different K+ channel subtypes have been cloned from mammalian tissue.
Considering their sequence homology to Drosophila Shaker, Shab, Shaw and Shal
channels, they were classified into four corresponding classes Kv1-4. All K+ channels
belonging to these classes consist of four subunits with each six hydrophobic
segments (S1-S6) and a characteristic structure-function relationship of certain
domains in their amino acid sequence. These domains are, the inactivation gate
in the N-terminal region of the sequence, the voltage sensor in the fourth hydrophobic
segment (S4), and the pore-region in the H5 segment between S5 and S6. In some
functional properties K+ channels cloned from the mammalian brain, however, differ
from Drosophila K+ channels. These are pharmacological differences, differences
in the threshold of activation and in regulation of inactivation. Part of these
differences are important to understand their physiological role in the brain.
Based on their functional characteristics the expression pattern of cloned K+
channels in the rat brain can be correlated with the properties of K+ currents
measured in central neurones.
article_processing_charge: No
article_type: original
author:
- first_name: Peter
full_name: Ruppersberg, Peter
last_name: Ruppersberg
- first_name: Mamfred
full_name: Ermler, Mamfred
last_name: Ermler
- first_name: Martin
full_name: Knopf, Martin
last_name: Knopf
- first_name: Wilfried
full_name: Kues, Wilfried
last_name: Kues
- 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: Michael
full_name: Koenen, Michael
last_name: Koenen
citation:
ama: Ruppersberg P, Ermler M, Knopf M, Kues W, Jonas PM, Koenen M. Properties of
Shaker-homologous potassium channels expressed in the mammalian brain. Cellular
Physiology and Biochemistry. 1993;3:250-269. doi:10.1159/000154691
apa: Ruppersberg, P., Ermler, M., Knopf, M., Kues, W., Jonas, P. M., & Koenen,
M. (1993). Properties of Shaker-homologous potassium channels expressed in the
mammalian brain. Cellular Physiology and Biochemistry. S. Karger AG. https://doi.org/10.1159/000154691
chicago: Ruppersberg, Peter, Mamfred Ermler, Martin Knopf, Wilfried Kues, Peter
M Jonas, and Michael Koenen. “Properties of Shaker-Homologous Potassium Channels
Expressed in the Mammalian Brain.” Cellular Physiology and Biochemistry.
S. Karger AG, 1993. https://doi.org/10.1159/000154691.
ieee: P. Ruppersberg, M. Ermler, M. Knopf, W. Kues, P. M. Jonas, and M. Koenen,
“Properties of Shaker-homologous potassium channels expressed in the mammalian
brain.,” Cellular Physiology and Biochemistry, vol. 3. S. Karger AG, pp.
250–269, 1993.
ista: Ruppersberg P, Ermler M, Knopf M, Kues W, Jonas PM, Koenen M. 1993. Properties
of Shaker-homologous potassium channels expressed in the mammalian brain. Cellular
Physiology and Biochemistry. 3, 250–269.
mla: Ruppersberg, Peter, et al. “Properties of Shaker-Homologous Potassium Channels
Expressed in the Mammalian Brain.” Cellular Physiology and Biochemistry,
vol. 3, S. Karger AG, 1993, pp. 250–69, doi:10.1159/000154691.
short: P. Ruppersberg, M. Ermler, M. Knopf, W. Kues, P.M. Jonas, M. Koenen, Cellular
Physiology and Biochemistry 3 (1993) 250–269.
date_created: 2018-12-11T12:03:31Z
date_published: 1993-01-01T00:00:00Z
date_updated: 2022-03-30T10:21:04Z
day: '01'
doi: 10.1159/000154691
extern: '1'
intvolume: ' 3'
language:
- iso: eng
main_file_link:
- url: https://www.karger.com/Article/Abstract/154691
month: '01'
oa_version: None
page: 250 - 269
publication: Cellular Physiology and Biochemistry
publication_identifier:
issn:
- 1015-8987
publication_status: published
publisher: S. Karger AG
publist_id: '2914'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Properties of Shaker-homologous potassium channels expressed in the mammalian
brain.
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 3
year: '1993'
...
---
_id: '3474'
abstract:
- lang: eng
text: 1. Excitatory postsynaptic currents (EPSCs) were recorded in CA3 pyramidal
cells of hippocampal slices of 15- to 24-day-old rats (22 degrees C) using the
whole-cell configuration of the patch clamp technique. 2. Composite EPSCs were
evoked by extracellular stimulation of the mossy fibre tract. Using the selective
blockers 6-cyano-7-nitroquinoxaline-2,3-dione (CNQX) and D-2-amino-5-phosphonopentanoic
acid (APV), a major alpha-amino-3-hydroxy-5-methylisoxazole-4-propionate (AMPA)/kainate
receptor-mediated component and a minor NMDA receptor-mediated component with
slower time course were distinguished. For the AMPA/kainate receptor-mediated
component, the peak current-voltage (I-V) relation was linear, with a reversal
potential close to 0 mV. The half-maximal blocking concentration of CNQX was 353
nM. 3. Unitary EPSCs of the mossy fibre terminal (MF)-CA3 pyramidal cell synapse
were evoked at membrane potentials of -70 to -90 mV by low-intensity extracellular
stimulation of granule cell somata using fine-tipped pipettes. The EPSC peak amplitude
as a function of stimulus intensity showed all-or-none behaviour. The region of
low threshold was restricted to a few micrometres. This suggests that extracellular
stimulation was focal, and that the stimulus-evoked EPSCs were unitary. 4. Latency
and rise time histograms of EPSCs evoked by granule cell stimulation showed narrow
unimodal distributions within each experiment. The mean latency was 4.2 +/- 1.0
ms, and the mean 20-80% rise time was 0.6 +/- 0.1 ms (23 cells). When fitted within
the range 0.7 ms to 20 ms after the peak, the decay of the EPSCs with the fastest
rise (rise time 0.5 ms or less) could be described by a single exponential function;
the mean time constant was in the range 3.0-6.6 ms with a mean of 4.8 ms (8 cells).
5. Peak amplitudes of the EPSCs evoked by suprathreshold granule cell stimulation
fluctuated between trials. The apparent EPSC peak conductance in normal extracellular
solution (2 mM Ca2+, 1 mM Mg2+), excluding failures, was 1 nS. Reducing the Ca2+
concentration and increasing the Mg2+ concentration reduced the mean peak amplitude
in a concentration-dependent manner. 6. Peaks in EPSC peak amplitude distributions
were apparent in low Ca2+ and high Mg2+. Using the criteria of equidistance and
the presence of peaks and dips in the autocorrelation function, five of nine EPSC
peak amplitude distributions were judged to be quantal.
acknowledgement: "We are indebted to Professor B. Katz for critically reading the
manuscript and for helpful suggestions. We especially thank Professor D. Colquhoun
for several discussions, for generously providing the source codes of programs for
maximum-likelihood fit with sums of Gaussian functions, a routine for calculating
the error function and for critically reading the manuscript. We also thank Drs
A. Larkman, P. Ruppersberg, N. Spuston and G. Stuart for critically reading the
manuscript, P. Andersen, B. Betz, J. Evans, K. Harris, E. v. Kitzing, R. Rahamimov
and K. Stratford for helpful discussions, and J. J. B. Jack for much-needed advice
and guidance to G.M. We thank K. Bauer, F. Helmchen, M. Huke, B. Manz and especially
A. Roth for computer programming, B. Werner for typing the manuscript, and M. Kaiser
for excellent technical assistance. Part of the project was supported by the Deutsche
Forschungsgemeinschaft (SFB-317)\r\nand the Wellcome Trust."
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: Guy
full_name: Major, Guy
last_name: Major
- first_name: Bert
full_name: Sakmann, Bert
last_name: Sakmann
citation:
ama: Jonas PM, Major G, Sakmann B. Quantal components of unitary EPSCs at the mossy
fibre synapse on CA3 pyramidal cells of rat hippocampus. Journal of Physiology.
1993;472:615-663. doi:10.1113/jphysiol.1993.sp019965
apa: Jonas, P. M., Major, G., & Sakmann, B. (1993). Quantal components of unitary
EPSCs at the mossy fibre synapse on CA3 pyramidal cells of rat hippocampus. Journal
of Physiology. Wiley-Blackwell. https://doi.org/10.1113/jphysiol.1993.sp019965
chicago: Jonas, Peter M, Guy Major, and Bert Sakmann. “Quantal Components of Unitary
EPSCs at the Mossy Fibre Synapse on CA3 Pyramidal Cells of Rat Hippocampus.” Journal
of Physiology. Wiley-Blackwell, 1993. https://doi.org/10.1113/jphysiol.1993.sp019965.
ieee: P. M. Jonas, G. Major, and B. Sakmann, “Quantal components of unitary EPSCs
at the mossy fibre synapse on CA3 pyramidal cells of rat hippocampus,” Journal
of Physiology, vol. 472. Wiley-Blackwell, pp. 615–663, 1993.
ista: Jonas PM, Major G, Sakmann B. 1993. Quantal components of unitary EPSCs at
the mossy fibre synapse on CA3 pyramidal cells of rat hippocampus. Journal of
Physiology. 472, 615–663.
mla: Jonas, Peter M., et al. “Quantal Components of Unitary EPSCs at the Mossy Fibre
Synapse on CA3 Pyramidal Cells of Rat Hippocampus.” Journal of Physiology,
vol. 472, Wiley-Blackwell, 1993, pp. 615–63, doi:10.1113/jphysiol.1993.sp019965.
short: P.M. Jonas, G. Major, B. Sakmann, Journal of Physiology 472 (1993) 615–663.
date_created: 2018-12-11T12:03:31Z
date_published: 1993-12-01T00:00:00Z
date_updated: 2022-03-30T09:33:19Z
day: '01'
doi: 10.1113/jphysiol.1993.sp019965
extern: '1'
external_id:
pmid:
- '7908327'
intvolume: ' 472'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC1160505
month: '12'
oa: 1
oa_version: Published Version
page: 615 - 663
pmid: 1
publication: Journal of Physiology
publication_identifier:
issn:
- 0022-3751
publication_status: published
publisher: Wiley-Blackwell
publist_id: '2913'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Quantal components of unitary EPSCs at the mossy fibre synapse on CA3 pyramidal
cells of rat hippocampus
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 472
year: '1993'
...
---
_id: '3568'
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. Geometric algorithms. In: Handbook of Convex Geometry.
North Holland; 1993:699-735. doi:10.1016/C2009-0-15705-7'
apa: Edelsbrunner, H. (1993). Geometric algorithms. In Handbook of Convex Geometry
(pp. 699–735). North Holland. https://doi.org/10.1016/C2009-0-15705-7
chicago: Edelsbrunner, Herbert. “Geometric Algorithms.” In Handbook of Convex
Geometry, 699–735. North Holland, 1993. https://doi.org/10.1016/C2009-0-15705-7.
ieee: H. Edelsbrunner, “Geometric algorithms,” in Handbook of Convex Geometry,
North Holland, 1993, pp. 699–735.
ista: 'Edelsbrunner H. 1993.Geometric algorithms. In: Handbook of Convex Geometry.
, 699–735.'
mla: Edelsbrunner, Herbert. “Geometric Algorithms.” Handbook of Convex Geometry,
North Holland, 1993, pp. 699–735, doi:10.1016/C2009-0-15705-7.
short: H. Edelsbrunner, in:, Handbook of Convex Geometry, North Holland, 1993, pp.
699–735.
date_created: 2018-12-11T12:04:00Z
date_published: 1993-08-24T00:00:00Z
date_updated: 2022-03-30T09:30:11Z
day: '24'
doi: 10.1016/C2009-0-15705-7
extern: '1'
language:
- iso: eng
main_file_link:
- url: https://www.sciencedirect.com/book/9780444895967/handbook-of-convex-geometry
month: '08'
oa_version: None
page: 699 - 735
publication: Handbook of Convex Geometry
publication_identifier:
isbn:
- 978-0-444-89596-7
publication_status: published
publisher: North Holland
publist_id: '2817'
status: public
title: Geometric algorithms
type: book_chapter
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
year: '1993'
...
---
_id: '3569'
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. Computational geometry. In: Current Trends in Theoretical
Computer Science, Essays and Tutorials. World Scientific Publishing; 1993:1-48.'
apa: Edelsbrunner, H. (1993). Computational geometry. In Current Trends in Theoretical
Computer Science, Essays and Tutorials (pp. 1–48). World Scientific Publishing.
chicago: Edelsbrunner, Herbert. “Computational Geometry.” In Current Trends in
Theoretical Computer Science, Essays and Tutorials, 1–48. World Scientific
Publishing, 1993.
ieee: H. Edelsbrunner, “Computational geometry,” in Current Trends in Theoretical
Computer Science, Essays and Tutorials, World Scientific Publishing, 1993,
pp. 1–48.
ista: 'Edelsbrunner H. 1993.Computational geometry. In: Current Trends in Theoretical
Computer Science, Essays and Tutorials. , 1–48.'
mla: Edelsbrunner, Herbert. “Computational Geometry.” Current Trends in Theoretical
Computer Science, Essays and Tutorials, World Scientific Publishing, 1993,
pp. 1–48.
short: H. Edelsbrunner, in:, Current Trends in Theoretical Computer Science, Essays
and Tutorials, World Scientific Publishing, 1993, pp. 1–48.
date_created: 2018-12-11T12:04:01Z
date_published: 1993-08-01T00:00:00Z
date_updated: 2022-03-30T08:46:20Z
day: '01'
extern: '1'
language:
- iso: eng
main_file_link:
- url: https://books.google.at/books?hl=en&lr=&id=fr_sCgAAQBAJ&oi=fnd&pg=PR5&ots=XAust-LAGl&sig=FQTlA5rrM25y5EZ8ZmrorT7SaMo&redir_esc=y#v=onepage&q&f=false
month: '08'
oa_version: None
page: 1 - 48
publication: Current Trends in Theoretical Computer Science, Essays and Tutorials
publication_identifier:
isbn:
- 978-9810214623
publication_status: published
publisher: World Scientific Publishing
publist_id: '2816'
status: public
title: Computational geometry
type: book_chapter
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
year: '1993'
...
---
_id: '3643'
abstract:
- lang: eng
text: 'We investigate the establishment and spread of new adaptive peaks within
Wright''s ‘shifting balance’. The third phase of the ‘shifting balance’ involves
a kind of group selection, since demes in which a superior peak has been established
contain more individuals, and so send out more migrants. We assume that population
size, N, increases with mean fitness, , according to the exponential relation,
. Here, k is a measure of the weakness of density-dependent regulation, and equals
the inverse of the regression of log (fitness) on log(N). In the island model,
we find that just as with soft selection (k = 0), two distinct types of behaviour
exist: group selection makes no qualitative difference. With low numbers of migrants,
demes fluctuate almost independently, and only one equilibrium exists. With large
numbers of migrants, all the demes evolve towards the same adaptive peak, and
so the whole population can move towards one or other of the peaks. Group selection
can be understood in terms of an effective mean fitness function. Its main consequence
is to increase the effect of selection relative to drift (Ns), and so increase
the bias towards the fitter peak. However, this increased bias depends on the
ratio between k and the deme size (k/N), and so is very small when density-dependence
is reasonably strong.'
acknowledgement: 'This work was supported by the Darwin Trust, by a Science and Engineering
Research Council grant (GR/E/08507), and by an SERC Visiting Fellowship to S.Rouhani. '
article_processing_charge: No
article_type: original
author:
- first_name: Shahin
full_name: Rouhani, Shahin
last_name: Rouhani
- 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: Rouhani S, Barton NH. Group selection and the “shifting balance.” Genetical
Research. 1993;61(2):127-136. doi:10.1017/S0016672300031232
apa: Rouhani, S., & Barton, N. H. (1993). Group selection and the “shifting
balance.” Genetical Research. Cambridge University Press. https://doi.org/10.1017/S0016672300031232
chicago: Rouhani, Shahin, and Nicholas H Barton. “Group Selection and the ‘Shifting
Balance.’” Genetical Research. Cambridge University Press, 1993. https://doi.org/10.1017/S0016672300031232.
ieee: S. Rouhani and N. H. Barton, “Group selection and the ‘shifting balance,’”
Genetical Research, vol. 61, no. 2. Cambridge University Press, pp. 127–136,
1993.
ista: Rouhani S, Barton NH. 1993. Group selection and the ‘shifting balance’. Genetical
Research. 61(2), 127–136.
mla: Rouhani, Shahin, and Nicholas H. Barton. “Group Selection and the ‘Shifting
Balance.’” Genetical Research, vol. 61, no. 2, Cambridge University Press,
1993, pp. 127–36, doi:10.1017/S0016672300031232.
short: S. Rouhani, N.H. Barton, Genetical Research 61 (1993) 127–136.
date_created: 2018-12-11T12:04:24Z
date_published: 1993-04-01T00:00:00Z
date_updated: 2022-03-30T08:28:54Z
day: '01'
doi: 10.1017/S0016672300031232
extern: '1'
intvolume: ' 61'
issue: '2'
language:
- iso: eng
main_file_link:
- url: https://www.cambridge.org/core/journals/genetics-research/article/group-selection-and-the-shifting-balance/CFDE26EA7125957545F9A0AA37755BC4
month: '04'
oa_version: None
page: 127 - 136
publication: Genetical Research
publication_identifier:
issn:
- 0016-6723
publication_status: published
publisher: Cambridge University Press
publist_id: '2740'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Group selection and the 'shifting balance'
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 61
year: '1993'
...
---
_id: '3644'
abstract:
- lang: eng
text: "Wright proposed that there is a ' shifting balance' between selection within
demes, random drift, and selection between demes at different 'adaptive peaks'.
We investigate the establishment and spread of new adaptive peaks, considering
a chromosome rearrangement, and a polygenic character under disruptive selection.
When the number of migrants (Nm) is small, demes fluctuate independently, with
a bias towards the fitter peak. When Nm is large, the whole population can\r\nmove
to one of two stable equilibria, and so can be trapped near the lower peak. These
two regimes are separated by a sharp transition at a critical Nm of order 1. Just
below this critical point, adaptation is most efficient, since the shifting balance
greatly increases the proportion of demes that reach the global optimum. This
is so even if one peak is only slightly fitter than the other (AWx \\/N), and
for both strong and weak selection (Ns <§ 1 or Ns > 1). Provided that Nm\r\nvaries
sufficiently gradually from place to place, the fitter peak can be established
in regions where Nm « 1, and can then spread through the rest of the range. Our
analysis confirms Wright's argument that if selection, migration and drift are
of the same order, the ' shifting balance' leads to efficient evolution towards
the global optimum."
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
- first_name: Shahin
full_name: Rouhani, Shahin
last_name: Rouhani
citation:
ama: Barton NH, Rouhani S. Adaptation and the “shifting balance.” Genetical Research.
1993;61(1):57-74. doi:10.1017/S0016672300031098
apa: Barton, N. H., & Rouhani, S. (1993). Adaptation and the “shifting balance.”
Genetical Research. Cambridge University Press. https://doi.org/10.1017/S0016672300031098
chicago: Barton, Nicholas H, and Shahin Rouhani. “Adaptation and the ‘Shifting Balance.’”
Genetical Research. Cambridge University Press, 1993. https://doi.org/10.1017/S0016672300031098 .
ieee: N. H. Barton and S. Rouhani, “Adaptation and the ‘shifting balance,’” Genetical
Research, vol. 61, no. 1. Cambridge University Press, pp. 57–74, 1993.
ista: Barton NH, Rouhani S. 1993. Adaptation and the ‘shifting balance’. Genetical
Research. 61(1), 57–74.
mla: Barton, Nicholas H., and Shahin Rouhani. “Adaptation and the ‘Shifting Balance.’”
Genetical Research, vol. 61, no. 1, Cambridge University Press, 1993, pp.
57–74, doi:10.1017/S0016672300031098
.
short: N.H. Barton, S. Rouhani, Genetical Research 61 (1993) 57–74.
date_created: 2018-12-11T12:04:24Z
date_published: 1993-02-01T00:00:00Z
date_updated: 2022-03-30T08:18:58Z
day: '01'
doi: '10.1017/S0016672300031098 '
extern: '1'
intvolume: ' 61'
issue: '1'
language:
- iso: eng
main_file_link:
- url: https://www.cambridge.org/core/journals/genetics-research/article/adaptation-and-the-shifting-balance/2E15452B3AFCA97E77743E0C7E108064
month: '02'
oa_version: None
page: 57 - 74
publication: Genetical Research
publication_identifier:
issn:
- 0016-6723
publication_status: published
publisher: Cambridge University Press
publist_id: '2739'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Adaptation and the 'shifting balance'
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 61
year: '1993'
...
---
_id: '4036'
abstract:
- lang: eng
text: This paper presents a randomized incremental algorithm for computing a single
face in an arrangement of n line segments in the plane that is fairly simple to
implement. The expected running time of the algorithm is O(nα(n)log n). The analysis
of the algorithm uses a novel approach that generalizes and extends the Clarkson-Shor
analysis technique [in Discrete Comput. Geom., 4(1989), pp. 387-421]. A few extensions
of the technique, obtaining efficient randomized incremental algorithms for constructing
the entire arrangement of a collection of line segments and for computing a single
face in an arrangement of Jordan arcs are also presented.
acknowledgement: The authors wish to express their gratitude for the generous support
and hospitality of the DEC Palo Alto Systems Research Center.
article_processing_charge: No
article_type: original
author:
- first_name: Bernard
full_name: Chazelle, Bernard
last_name: Chazelle
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Leonidas
full_name: Guibas, Leonidas
last_name: Guibas
- first_name: Micha
full_name: Sharir, Micha
last_name: Sharir
- first_name: Jack
full_name: Snoeyink, Jack
last_name: Snoeyink
citation:
ama: Chazelle B, Edelsbrunner H, Guibas L, Sharir M, Snoeyink J. Computing a face
in an arrangement of line segments and related problems. SIAM Journal on Computing.
1993;22(6):1286-1302. doi:10.1137/0222077
apa: Chazelle, B., Edelsbrunner, H., Guibas, L., Sharir, M., & Snoeyink, J.
(1993). Computing a face in an arrangement of line segments and related problems.
SIAM Journal on Computing. SIAM. https://doi.org/10.1137/0222077
chicago: Chazelle, Bernard, Herbert Edelsbrunner, Leonidas Guibas, Micha Sharir,
and Jack Snoeyink. “Computing a Face in an Arrangement of Line Segments and Related
Problems.” SIAM Journal on Computing. SIAM, 1993. https://doi.org/10.1137/0222077 .
ieee: B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir, and J. Snoeyink, “Computing
a face in an arrangement of line segments and related problems,” SIAM Journal
on Computing, vol. 22, no. 6. SIAM, pp. 1286–1302, 1993.
ista: Chazelle B, Edelsbrunner H, Guibas L, Sharir M, Snoeyink J. 1993. Computing
a face in an arrangement of line segments and related problems. SIAM Journal on
Computing. 22(6), 1286–1302.
mla: Chazelle, Bernard, et al. “Computing a Face in an Arrangement of Line Segments
and Related Problems.” SIAM Journal on Computing, vol. 22, no. 6, SIAM,
1993, pp. 1286–302, doi:10.1137/0222077
.
short: B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir, J. Snoeyink, SIAM Journal
on Computing 22 (1993) 1286–1302.
date_created: 2018-12-11T12:06:34Z
date_published: 1993-12-01T00:00:00Z
date_updated: 2022-03-30T08:07:21Z
day: '01'
doi: '10.1137/0222077 '
extern: '1'
intvolume: ' 22'
issue: '6'
language:
- iso: eng
main_file_link:
- url: https://epubs.siam.org/doi/10.1137/0222077
month: '12'
oa_version: None
page: 1286 - 1302
publication: SIAM Journal on Computing
publication_identifier:
issn:
- 0097-5397
publication_status: published
publisher: SIAM
publist_id: '2087'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Computing a face in an arrangement of line segments and related problems
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 22
year: '1993'
...
---
_id: '4040'
abstract:
- lang: eng
text: A plane geometric graph C in ℝ2 conforms to another such graph G if each edge
of G is the union of some edges of C. It is proved that, for every G with n vertices
and m edges, there is a completion of a Delaunay triangulation of O(m2 n) points
that conforms to G. The algorithm that constructs the points is also described.
acknowledgement: 'Research of the first author is supported by the National Science
Foundation under Grant CCR-8921421 and under the 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. Work of the second author was conducted while he was on study
leave at the University of Illinois. '
article_processing_charge: No
article_type: original
author:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Tiow
full_name: Tan, Tiow
last_name: Tan
citation:
ama: Edelsbrunner H, Tan T. An upper bound for conforming Delaunay triangulations.
Discrete & Computational Geometry. 1993;10(1):197-213. doi:10.1007/BF02573974
apa: Edelsbrunner, H., & Tan, T. (1993). An upper bound for conforming Delaunay
triangulations. Discrete & Computational Geometry. Springer. https://doi.org/10.1007/BF02573974
chicago: Edelsbrunner, Herbert, and Tiow Tan. “An Upper Bound for Conforming Delaunay
Triangulations.” Discrete & Computational Geometry. Springer, 1993.
https://doi.org/10.1007/BF02573974.
ieee: H. Edelsbrunner and T. Tan, “An upper bound for conforming Delaunay triangulations,”
Discrete & Computational Geometry, vol. 10, no. 1. Springer, pp. 197–213,
1993.
ista: Edelsbrunner H, Tan T. 1993. An upper bound for conforming Delaunay triangulations.
Discrete & Computational Geometry. 10(1), 197–213.
mla: Edelsbrunner, Herbert, and Tiow Tan. “An Upper Bound for Conforming Delaunay
Triangulations.” Discrete & Computational Geometry, vol. 10, no. 1,
Springer, 1993, pp. 197–213, doi:10.1007/BF02573974.
short: H. Edelsbrunner, T. Tan, Discrete & Computational Geometry 10 (1993)
197–213.
date_created: 2018-12-11T12:06:35Z
date_published: 1993-12-01T00:00:00Z
date_updated: 2022-03-28T14:58:16Z
day: '01'
doi: 10.1007/BF02573974
extern: '1'
intvolume: ' 10'
issue: '1'
language:
- iso: eng
main_file_link:
- url: https://link.springer.com/article/10.1007/BF02573974
month: '12'
oa_version: None
page: 197 - 213
publication: Discrete & Computational Geometry
publication_identifier:
issn:
- 0179-5376
publication_status: published
publisher: Springer
publist_id: '2084'
quality_controlled: '1'
status: public
title: An upper bound for conforming Delaunay triangulations
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 10
year: '1993'
...
---
_id: '4041'
abstract:
- lang: eng
text: The zone theorem for an arrangement of n hyperplanes in d-dimensional real
space says that the total number of faces bounding the cells intersected by another
hyperplane is O(n(d-1)). This result is the basis of a time-optimal incremental
algorithm that constructs a hyperplane arrangement and has a host of other algorithmic
and combinatorial applications. Unfortunately, the original proof of the zone
theorem, for d greater-than-or-equal-to 3, turned out to contain a serious and
irreparable error. This paper presents a new proof of the theorem. The proof is
based on an inductive argument, which also applies in the case of pseudohyperplane
arrangements. The fallacies of the old proof along with some ways of partially
saving that approach are briefly discussed.
acknowledgement: National Science Foundation under grant CCR-89- 21421.
article_processing_charge: No
article_type: original
author:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Raimund
full_name: Seidel, Raimund
last_name: Seidel
- first_name: Micha
full_name: Sharir, Micha
last_name: Sharir
citation:
ama: Edelsbrunner H, Seidel R, Sharir M. On the zone theorem for hyperplane arrangements.
SIAM Journal on Computing. 1993;22(2):418-429. doi:10.1137/0222031
apa: Edelsbrunner, H., Seidel, R., & Sharir, M. (1993). On the zone theorem
for hyperplane arrangements. SIAM Journal on Computing. SIAM. https://doi.org/10.1137/0222031
chicago: Edelsbrunner, Herbert, Raimund Seidel, and Micha Sharir. “On the Zone Theorem
for Hyperplane Arrangements.” SIAM Journal on Computing. SIAM, 1993. https://doi.org/10.1137/0222031.
ieee: H. Edelsbrunner, R. Seidel, and M. Sharir, “On the zone theorem for hyperplane
arrangements,” SIAM Journal on Computing, vol. 22, no. 2. SIAM, pp. 418–429,
1993.
ista: Edelsbrunner H, Seidel R, Sharir M. 1993. On the zone theorem for hyperplane
arrangements. SIAM Journal on Computing. 22(2), 418–429.
mla: Edelsbrunner, Herbert, et al. “On the Zone Theorem for Hyperplane Arrangements.”
SIAM Journal on Computing, vol. 22, no. 2, SIAM, 1993, pp. 418–29, doi:10.1137/0222031.
short: H. Edelsbrunner, R. Seidel, M. Sharir, SIAM Journal on Computing 22 (1993)
418–429.
date_created: 2018-12-11T12:06:35Z
date_published: 1993-04-01T00:00:00Z
date_updated: 2022-03-29T13:25:02Z
day: '01'
doi: 10.1137/0222031
extern: '1'
intvolume: ' 22'
issue: '2'
language:
- iso: eng
main_file_link:
- url: https://epubs.siam.org/doi/10.1137/0222031
month: '04'
oa_version: None
page: 418 - 429
publication: SIAM Journal on Computing
publication_identifier:
issn:
- 0097-5397
publication_status: published
publisher: SIAM
publist_id: '2085'
quality_controlled: '1'
scopus_import: '1'
status: public
title: On the zone theorem for hyperplane arrangements
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 22
year: '1993'
...
---
_id: '4042'
abstract:
- lang: eng
text: It is shown that a triangulation of a set of n points in the plane that minimizes
the maximum edge length can be computed in time 0(n2). The algorithm is reasonably
easy to implement and is based on the theorem that there is a triangulation with
minmax edge length that contains the relative neighborhood graph of the points
as a subgraph. With minor modifications the algorithm works for arbitrary normed
metrics.
acknowledgement: The authors thank an anonymous referee for suggestions on the organization
of this paper.
article_processing_charge: No
article_type: original
author:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Tiow
full_name: Tan, Tiow
last_name: Tan
citation:
ama: Edelsbrunner H, Tan T. A quadratic time algorithm for the minmax length triangulation.
SIAM Journal on Computing. 1993;22(3):527-551. doi:10.1137/0222036
apa: Edelsbrunner, H., & Tan, T. (1993). A quadratic time algorithm for the
minmax length triangulation. SIAM Journal on Computing. SIAM. https://doi.org/10.1137/0222036
chicago: Edelsbrunner, Herbert, and Tiow Tan. “A Quadratic Time Algorithm for the
Minmax Length Triangulation.” SIAM Journal on Computing. SIAM, 1993. https://doi.org/10.1137/0222036 .
ieee: H. Edelsbrunner and T. Tan, “A quadratic time algorithm for the minmax length
triangulation,” SIAM Journal on Computing, vol. 22, no. 3. SIAM, pp. 527–551,
1993.
ista: Edelsbrunner H, Tan T. 1993. A quadratic time algorithm for the minmax length
triangulation. SIAM Journal on Computing. 22(3), 527–551.
mla: Edelsbrunner, Herbert, and Tiow Tan. “A Quadratic Time Algorithm for the Minmax
Length Triangulation.” SIAM Journal on Computing, vol. 22, no. 3, SIAM,
1993, pp. 527–51, doi:10.1137/0222036
.
short: H. Edelsbrunner, T. Tan, SIAM Journal on Computing 22 (1993) 527–551.
date_created: 2018-12-11T12:06:36Z
date_published: 1993-06-01T00:00:00Z
date_updated: 2022-03-30T07:43:13Z
day: '01'
doi: '10.1137/0222036 '
extern: '1'
intvolume: ' 22'
issue: '3'
language:
- iso: eng
main_file_link:
- url: https://epubs.siam.org/doi/10.1137/0222036
month: '06'
oa_version: None
page: 527 - 551
publication: SIAM Journal on Computing
publication_identifier:
issn:
- 0097-5397
publication_status: published
publisher: SIAM
publist_id: '2086'
quality_controlled: '1'
scopus_import: '1'
status: public
title: A quadratic time algorithm for the minmax length triangulation
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 22
year: '1993'
...
---
_id: '4044'
abstract:
- lang: eng
text: Edge insertion iteratively improves a triangulation of a finite point set
in ℜ2 by adding a new edge, deleting old edges crossing the new edge, and retriangulating
the polygonal regions on either side of the new edge. This paper presents an abstract
view of the edge insertion paradigm, and then shows that it gives polynomial-time
algorithms for several types of optimal triangulations, including minimizing the
maximum slope of a piecewise-linear interpolating surface.
acknowledgement: "The authors thank two anonymous referees for suggestions on improving
the style of this paper. The research of the second' author was supported by the
National Science Foundation under Grant No. CCR-8921421 and under the Alan T. Waterman
award, Grant No. 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. Part of the work was done while the
second, third, and fourth authors visited the Xerox Palo Alto Research Center,\r\nand
while the fifth author was on study leave at the University of Illinois. "
article_processing_charge: No
article_type: original
author:
- first_name: Marshall
full_name: Bern, Marshall
last_name: Bern
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: David
full_name: Eppstein, David
last_name: Eppstein
- first_name: Stephen
full_name: Mitchell, Stephen
last_name: Mitchell
- first_name: Tiow
full_name: Tan, Tiow
last_name: Tan
citation:
ama: Bern M, Edelsbrunner H, Eppstein D, Mitchell S, Tan T. Edge insertion for optimal
triangulations. Discrete & Computational Geometry. 1993;10(1):47-65.
doi:10.1007/BF02573962
apa: Bern, M., Edelsbrunner, H., Eppstein, D., Mitchell, S., & Tan, T. (1993).
Edge insertion for optimal triangulations. Discrete & Computational Geometry.
Springer. https://doi.org/10.1007/BF02573962
chicago: Bern, Marshall, Herbert Edelsbrunner, David Eppstein, Stephen Mitchell,
and Tiow Tan. “Edge Insertion for Optimal Triangulations.” Discrete & Computational
Geometry. Springer, 1993. https://doi.org/10.1007/BF02573962.
ieee: M. Bern, H. Edelsbrunner, D. Eppstein, S. Mitchell, and T. Tan, “Edge insertion
for optimal triangulations,” Discrete & Computational Geometry, vol.
10, no. 1. Springer, pp. 47–65, 1993.
ista: Bern M, Edelsbrunner H, Eppstein D, Mitchell S, Tan T. 1993. Edge insertion
for optimal triangulations. Discrete & Computational Geometry. 10(1), 47–65.
mla: Bern, Marshall, et al. “Edge Insertion for Optimal Triangulations.” Discrete
& Computational Geometry, vol. 10, no. 1, Springer, 1993, pp. 47–65, doi:10.1007/BF02573962.
short: M. Bern, H. Edelsbrunner, D. Eppstein, S. Mitchell, T. Tan, Discrete &
Computational Geometry 10 (1993) 47–65.
date_created: 2018-12-11T12:06:36Z
date_published: 1993-12-01T00:00:00Z
date_updated: 2022-03-28T14:10:59Z
day: '01'
doi: 10.1007/BF02573962
extern: '1'
intvolume: ' 10'
issue: '1'
language:
- iso: eng
main_file_link:
- url: https://link.springer.com/article/10.1007/BF02573962
month: '12'
oa_version: None
page: 47 - 65
publication: Discrete & Computational Geometry
publication_identifier:
issn:
- 0179-5376
publication_status: published
publisher: Springer
publist_id: '2082'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Edge insertion for optimal triangulations
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 10
year: '1993'
...
---
_id: '4045'
abstract:
- lang: eng
text: We apply Megiddo's parametric searching technique to several geometric optimization
problems and derive significantly improved solutions for them. We obtain, for
any fixed ε>0, an O(n1+ε) algorithm for computing the diameter of a point set
in 3-space, an O(8/5+ε) algorithm for computing the width of such a set, and on
O(n8/5+ε) algorithm for computing the closest pair in a set of n lines in space.
All these algorithms are deterministic.
acknowledgement: '*Work by Bernard Chazelle was supported by NSF Grant CCR-90-02352.
Work by Herbert Edelsbrunner was supported by NSF Grant CCR-89-21421. Work by Leonidas
Guibas and Micha Sharir was supported by a grant from the U.S.-Israeli Binational
Science Foundation. Work by Micha Sharir was also supported by ONR Grant N00014-90-J-1284,
by NSF Grant CCR-89-01484, and by grants from the Fund for Basic Research administered
by the Israeli Academy of Sciences, and the G.I.F., the German-Israeli Foundation
for Scientific Research and Development.'
article_processing_charge: No
article_type: original
author:
- first_name: Bernard
full_name: Chazelle, Bernard
last_name: Chazelle
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Leonidas
full_name: Guibas, Leonidas
last_name: Guibas
- first_name: Micha
full_name: Sharir, Micha
last_name: Sharir
citation:
ama: Chazelle B, Edelsbrunner H, Guibas L, Sharir M. Diameter, width, closest line
pair, and parametric searching. Discrete & Computational Geometry.
1993;10(1):183-196. doi:10.1007/BF02573973
apa: Chazelle, B., Edelsbrunner, H., Guibas, L., & Sharir, M. (1993). Diameter,
width, closest line pair, and parametric searching. Discrete & Computational
Geometry. Springer. https://doi.org/10.1007/BF02573973
chicago: Chazelle, Bernard, Herbert Edelsbrunner, Leonidas Guibas, and Micha Sharir.
“Diameter, Width, Closest Line Pair, and Parametric Searching.” Discrete &
Computational Geometry. Springer, 1993. https://doi.org/10.1007/BF02573973.
ieee: B. Chazelle, H. Edelsbrunner, L. Guibas, and M. Sharir, “Diameter, width,
closest line pair, and parametric searching,” Discrete & Computational
Geometry, vol. 10, no. 1. Springer, pp. 183–196, 1993.
ista: Chazelle B, Edelsbrunner H, Guibas L, Sharir M. 1993. Diameter, width, closest
line pair, and parametric searching. Discrete & Computational Geometry. 10(1),
183–196.
mla: Chazelle, Bernard, et al. “Diameter, Width, Closest Line Pair, and Parametric
Searching.” Discrete & Computational Geometry, vol. 10, no. 1, Springer,
1993, pp. 183–96, doi:10.1007/BF02573973.
short: B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir, Discrete & Computational
Geometry 10 (1993) 183–196.
date_created: 2018-12-11T12:06:37Z
date_published: 1993-12-01T00:00:00Z
date_updated: 2022-03-28T14:50:42Z
day: '01'
doi: 10.1007/BF02573973
extern: '1'
intvolume: ' 10'
issue: '1'
language:
- iso: eng
main_file_link:
- url: https://link.springer.com/article/10.1007/BF02573973
month: '12'
oa_version: None
page: 183 - 196
publication: Discrete & Computational Geometry
publication_identifier:
issn:
- 0179-5376
publication_status: published
publisher: Springer
publist_id: '2083'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Diameter, width, closest line pair, and parametric searching
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 10
year: '1993'
...
---
_id: '4175'
abstract:
- lang: eng
text: We have studied the effects of different neurotrophins on the survival and
proliferation of rat cerebellar granule cells in culture. These neurons express
trkB and trkC, the putative neuronal receptors for brain-derived neurotrophic
factor (BDNF) and neurotrophin-3 (NT-3) respectively. Binding studies using iodinated
BDNF and NT-3 demonstrated that both BDNF and NT-3 bind to the cerebellar granule
neurons with a similar affinity of approximately 2 x 10(-9) M. The number of receptors
per granule cell was surprisingly high, approximately 30 x 10(-4) and 2 x 10(5)
for BDNF and NT-3, respectively. Both NT-3 and BDNF elevated c-fos mRNA in the
granule neurons, but only BDNF up-regulated the mRNA encoding the low-affinity
neurotrophin receptor (p75). In contrast to NT-3, BDNF acted as a survival factor
for the granule neurons. BDNF also induced sprouting of the granule neurons and
significantly protected them against neurotoxicity induced by high (1 mM) glutamate
concentrations. Cultured granule neurons also expressed low levels of BDNF mRNA
which were increased by kainic acid, a glutamate receptor agonist. Thus, BDNF,
but not NT-3, is a survival factor for cultured cerebellar granule neurons and
activation of glutamate receptor(s) up-regulates BDNF expression in these cells.
article_processing_charge: No
article_type: original
author:
- first_name: Dan
full_name: Lindholm, Dan
last_name: Lindholm
- first_name: Georg
full_name: Dechant, Georg
last_name: Dechant
- first_name: Carl-Philipp J
full_name: Heisenberg, Carl-Philipp J
id: 39427864-F248-11E8-B48F-1D18A9856A87
last_name: Heisenberg
orcid: 0000-0002-0912-4566
- first_name: Hans
full_name: Thoenen, Hans
last_name: Thoenen
citation:
ama: Lindholm D, Dechant G, Heisenberg C-PJ, Thoenen H. Brain-derived neurotrophic
factor is a survival factor for cultured rat cerebellar granule neurons and protects
them against glutamate-induced neurotoxicity. European Journal of Neuroscience.
1993;5(11):1455-1464. doi:10.1111/j.1460-9568.1993.tb00213.x
apa: Lindholm, D., Dechant, G., Heisenberg, C.-P. J., & Thoenen, H. (1993).
Brain-derived neurotrophic factor is a survival factor for cultured rat cerebellar
granule neurons and protects them against glutamate-induced neurotoxicity. European
Journal of Neuroscience. Wiley-Blackwell. https://doi.org/10.1111/j.1460-9568.1993.tb00213.x
chicago: Lindholm, Dan, Georg Dechant, Carl-Philipp J Heisenberg, and Hans Thoenen.
“Brain-Derived Neurotrophic Factor Is a Survival Factor for Cultured Rat Cerebellar
Granule Neurons and Protects Them against Glutamate-Induced Neurotoxicity.” European
Journal of Neuroscience. Wiley-Blackwell, 1993. https://doi.org/10.1111/j.1460-9568.1993.tb00213.x.
ieee: D. Lindholm, G. Dechant, C.-P. J. Heisenberg, and H. Thoenen, “Brain-derived
neurotrophic factor is a survival factor for cultured rat cerebellar granule neurons
and protects them against glutamate-induced neurotoxicity,” European Journal
of Neuroscience, vol. 5, no. 11. Wiley-Blackwell, pp. 1455–1464, 1993.
ista: Lindholm D, Dechant G, Heisenberg C-PJ, Thoenen H. 1993. Brain-derived neurotrophic
factor is a survival factor for cultured rat cerebellar granule neurons and protects
them against glutamate-induced neurotoxicity. European Journal of Neuroscience.
5(11), 1455–1464.
mla: Lindholm, Dan, et al. “Brain-Derived Neurotrophic Factor Is a Survival Factor
for Cultured Rat Cerebellar Granule Neurons and Protects Them against Glutamate-Induced
Neurotoxicity.” European Journal of Neuroscience, vol. 5, no. 11, Wiley-Blackwell,
1993, pp. 1455–64, doi:10.1111/j.1460-9568.1993.tb00213.x.
short: D. Lindholm, G. Dechant, C.-P.J. Heisenberg, H. Thoenen, European Journal
of Neuroscience 5 (1993) 1455–1464.
date_created: 2018-12-11T12:07:24Z
date_published: 1993-11-01T00:00:00Z
date_updated: 2022-03-28T13:33:18Z
day: '01'
doi: 10.1111/j.1460-9568.1993.tb00213.x
extern: '1'
external_id:
pmid:
- '7904521 '
intvolume: ' 5'
issue: '11'
language:
- iso: eng
main_file_link:
- url: https://onlinelibrary.wiley.com/doi/10.1111/j.1460-9568.1993.tb00213.x
month: '11'
oa_version: None
page: 1455 - 1464
pmid: 1
publication: European Journal of Neuroscience
publication_identifier:
issn:
- 0953-816X
publication_status: published
publisher: Wiley-Blackwell
publist_id: '1943'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Brain-derived neurotrophic factor is a survival factor for cultured rat cerebellar
granule neurons and protects them against glutamate-induced neurotoxicity
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 5
year: '1993'
...