---
_id: '4055'
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 O(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.
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
- 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.
In: 32nd Annual Symposium of Foundations of Computer Science. IEEE; 1991:414-423.
doi:10.1109/SFCS.1991.185400'
apa: 'Edelsbrunner, H., & Tan, T. (1991). A quadratic time algorithm for the
minmax length triangulation. In 32nd Annual Symposium of Foundations of Computer
Science (pp. 414–423). San Juan, PR, United States of America: IEEE. https://doi.org/10.1109/SFCS.1991.185400'
chicago: Edelsbrunner, Herbert, and Tiow Tan. “A Quadratic Time Algorithm for the
Minmax Length Triangulation.” In 32nd Annual Symposium of Foundations of Computer
Science, 414–23. IEEE, 1991. https://doi.org/10.1109/SFCS.1991.185400.
ieee: H. Edelsbrunner and T. Tan, “A quadratic time algorithm for the minmax length
triangulation,” in 32nd Annual Symposium of Foundations of Computer Science,
San Juan, PR, United States of America, 1991, pp. 414–423.
ista: 'Edelsbrunner H, Tan T. 1991. A quadratic time algorithm for the minmax length
triangulation. 32nd Annual Symposium of Foundations of Computer Science. FOCS:
Foundations of Computer Science, 414–423.'
mla: Edelsbrunner, Herbert, and Tiow Tan. “A Quadratic Time Algorithm for the Minmax
Length Triangulation.” 32nd Annual Symposium of Foundations of Computer Science,
IEEE, 1991, pp. 414–23, doi:10.1109/SFCS.1991.185400.
short: H. Edelsbrunner, T. Tan, in:, 32nd Annual Symposium of Foundations of Computer
Science, IEEE, 1991, pp. 414–423.
conference:
end_date: 1991-10-04
location: San Juan, PR, United States of America
name: 'FOCS: Foundations of Computer Science'
start_date: 1991-10-01
date_created: 2018-12-11T12:06:40Z
date_published: 1991-12-01T00:00:00Z
date_updated: 2022-02-28T15:51:45Z
day: '01'
doi: 10.1109/SFCS.1991.185400
extern: '1'
language:
- iso: eng
main_file_link:
- url: https://ieeexplore.ieee.org/document/185400
month: '12'
oa_version: None
page: 414 - 423
publication: 32nd Annual Symposium of Foundations of Computer Science
publication_status: published
publisher: IEEE
publist_id: '2069'
quality_controlled: '1'
scopus_import: '1'
status: public
title: A quadratic time algorithm for the minmax length triangulation
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
year: '1991'
...
---
_id: '4056'
abstract:
- lang: eng
text: This paper proves that for every n ≥ 4 there is a convex n-gon such that the
vertices of 2n - 7 vertex pairs are one unit of distance apart. This improves
the previously best lower bound of ⌊ (5n - 5) 3⌋ given by Erdo{combining double
acute accent}s and Moser if n ≥ 17.
acknowledgement: The first author is pleased to acknowledge partial support by the
Amoco Fnd. Fat. Dev. Comput. Sci. i-6-44862 and the National Science Foundation
under Grant CCR-8714565.
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: Péter
full_name: Hajnal, Péter
last_name: Hajnal
citation:
ama: Edelsbrunner H, Hajnal P. A lower bound on the number of unit distances between
the vertices of a convex polygon. Journal of Combinatorial Theory Series A.
1991;56(2):312-316. doi:10.1016/0097-3165(91)90042-F
apa: Edelsbrunner, H., & Hajnal, P. (1991). A lower bound on the number of unit
distances between the vertices of a convex polygon. Journal of Combinatorial
Theory Series A. Elsevier. https://doi.org/10.1016/0097-3165(91)90042-F
chicago: Edelsbrunner, Herbert, and Péter Hajnal. “A Lower Bound on the Number of
Unit Distances between the Vertices of a Convex Polygon.” Journal of Combinatorial
Theory Series A. Elsevier, 1991. https://doi.org/10.1016/0097-3165(91)90042-F.
ieee: H. Edelsbrunner and P. Hajnal, “A lower bound on the number of unit distances
between the vertices of a convex polygon,” Journal of Combinatorial Theory
Series A, vol. 56, no. 2. Elsevier, pp. 312–316, 1991.
ista: Edelsbrunner H, Hajnal P. 1991. A lower bound on the number of unit distances
between the vertices of a convex polygon. Journal of Combinatorial Theory Series
A. 56(2), 312–316.
mla: Edelsbrunner, Herbert, and Péter Hajnal. “A Lower Bound on the Number of Unit
Distances between the Vertices of a Convex Polygon.” Journal of Combinatorial
Theory Series A, vol. 56, no. 2, Elsevier, 1991, pp. 312–16, doi:10.1016/0097-3165(91)90042-F.
short: H. Edelsbrunner, P. Hajnal, Journal of Combinatorial Theory Series A 56 (1991)
312–316.
date_created: 2018-12-11T12:06:41Z
date_published: 1991-03-01T00:00:00Z
date_updated: 2022-03-02T09:56:10Z
day: '01'
doi: 10.1016/0097-3165(91)90042-F
extern: '1'
intvolume: ' 56'
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.sciencedirect.com/science/article/pii/009731659190042F?via%3Dihub
month: '03'
oa: 1
oa_version: Published Version
page: 312 - 316
publication: Journal of Combinatorial Theory Series A
publication_identifier:
eissn:
- 1096-0899
issn:
- 0097-3165
publication_status: published
publisher: Elsevier
publist_id: '2070'
quality_controlled: '1'
scopus_import: '1'
status: public
title: A lower bound on the number of unit distances between the vertices of a convex
polygon
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 56
year: '1991'
...
---
_id: '4057'
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
citation:
ama: Edelsbrunner H. Corrigendum. Journal of Computer and System Sciences.
1991;42(2):249-251. doi:10.1016/0022-0000(91)90013-U
apa: Edelsbrunner, H. (1991). Corrigendum. Journal of Computer and System Sciences.
Elsevier. https://doi.org/10.1016/0022-0000(91)90013-U
chicago: Edelsbrunner, Herbert. “Corrigendum.” Journal of Computer and System
Sciences. Elsevier, 1991. https://doi.org/10.1016/0022-0000(91)90013-U.
ieee: H. Edelsbrunner, “Corrigendum,” Journal of Computer and System Sciences,
vol. 42, no. 2. Elsevier, pp. 249–251, 1991.
ista: Edelsbrunner H. 1991. Corrigendum. Journal of Computer and System Sciences.
42(2), 249–251.
mla: Edelsbrunner, Herbert. “Corrigendum.” Journal of Computer and System Sciences,
vol. 42, no. 2, Elsevier, 1991, pp. 249–51, doi:10.1016/0022-0000(91)90013-U.
short: H. Edelsbrunner, Journal of Computer and System Sciences 42 (1991) 249–251.
date_created: 2018-12-11T12:06:41Z
date_published: 1991-04-01T00:00:00Z
date_updated: 2022-03-02T10:06:55Z
day: '01'
doi: 10.1016/0022-0000(91)90013-U
extern: '1'
intvolume: ' 42'
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.sciencedirect.com/science/article/pii/002200009190013U?via%3Dihub
month: '04'
oa: 1
oa_version: Published Version
page: 249 - 251
publication: Journal of Computer and System Sciences
publication_identifier:
eissn:
- 1090-2724
issn:
- 0022-0000
publication_status: published
publisher: Elsevier
publist_id: '2071'
quality_controlled: '1'
status: public
title: Corrigendum
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 42
year: '1991'
...
---
_id: '4058'
abstract:
- lang: eng
text: We present 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.
acknowledgement: 'NSF Grant CC R-89-21421. 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
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. In: Proceedings of the 2nd Annual ACM-SIAM
Symposium on Discrete Algorithms. SIAM; 1991:441-448.'
apa: 'Chazelle, B., Edelsbrunner, H., Guibas, L., Sharir, M., & Snoeyink, J.
(1991). Computing a face in an arrangement of line segments. In Proceedings
of the 2nd annual ACM-SIAM symposium on Discrete algorithms (pp. 441–448).
San Francisco, CA, United States of America: SIAM.'
chicago: Chazelle, Bernard, Herbert Edelsbrunner, Leonidas Guibas, Micha Sharir,
and Jack Snoeyink. “Computing a Face in an Arrangement of Line Segments.” In Proceedings
of the 2nd Annual ACM-SIAM Symposium on Discrete Algorithms, 441–48. SIAM,
1991.
ieee: B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir, and J. Snoeyink, “Computing
a face in an arrangement of line segments,” in Proceedings of the 2nd annual
ACM-SIAM symposium on Discrete algorithms, San Francisco, CA, United States
of America, 1991, pp. 441–448.
ista: 'Chazelle B, Edelsbrunner H, Guibas L, Sharir M, Snoeyink J. 1991. Computing
a face in an arrangement of line segments. Proceedings of the 2nd annual ACM-SIAM
symposium on Discrete algorithms. SODA: Symposium on Discrete Algorithms, 441–448.'
mla: Chazelle, Bernard, et al. “Computing a Face in an Arrangement of Line Segments.”
Proceedings of the 2nd Annual ACM-SIAM Symposium on Discrete Algorithms,
SIAM, 1991, pp. 441–48.
short: B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir, J. Snoeyink, in:, Proceedings
of the 2nd Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, 1991, pp. 441–448.
conference:
end_date: 1991-01-30
location: San Francisco, CA, United States of America
name: 'SODA: Symposium on Discrete Algorithms'
start_date: 1991-01-28
date_created: 2018-12-11T12:06:41Z
date_published: 1991-01-01T00:00:00Z
date_updated: 2022-02-28T14:41:47Z
day: '01'
extern: '1'
language:
- iso: eng
main_file_link:
- url: https://dl.acm.org/doi/10.5555/127787.127864
month: '01'
oa_version: None
page: 441 - 448
publication: Proceedings of the 2nd annual ACM-SIAM symposium on Discrete algorithms
publication_identifier:
isbn:
- 978-0-89791-376-8
publication_status: published
publisher: SIAM
publist_id: '2065'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Computing a face in an arrangement of line segments
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
year: '1991'
...
---
_id: '4059'
abstract:
- lang: eng
text: Let P be a simple polygon with n vertices. We present a simple decomposition
scheme that partitions the interior of P into O(n) so-called geodesic triangles,
so that any line segment interior to P crosses at most 2 log n of these triangles.
This decomposition can be used to preprocess P in time O(n log n) and storage
O(n), so that any ray-shooting query can be answered in time O(log n).The algorithms
are fairly simple and easy to implement. We also extend this technique to the
case of ray-shooting amidst k polygonal obstacles with a total of n edges, so
that a query can be answered in O(radicklog n) time.
acknowledgement: Work by Bernard Chazelle has been supported by NSF Grant CCR-87-00917.
Work by Herbert Edelsbrunner has been supported by NSF Grant CCR-89-21421. Work
by Micha Sharir has been supported by ONR Grants N00014-89-J-3042 and N00014-90-J-1284,
by NSF Grant CCR-89-01484, and by grants from the U.S.-Israeli Binational Science
Foundation, 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.
alternative_title:
- LNCS
article_processing_charge: No
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: Michelangelo
full_name: Grigni, Michelangelo
last_name: Grigni
- first_name: Leonidas
full_name: Guibas, Leonidas
last_name: Guibas
- first_name: John
full_name: Hershberger, John
last_name: Hershberger
- 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, Grigni M, et al. Ray shooting in polygons using
geodesic triangulations. In: 18th International Colloquium on Automata, Languages
and Programming. Vol 510. Springer; 1991:661-673. doi:10.1007/3-540-54233-7_172'
apa: 'Chazelle, B., Edelsbrunner, H., Grigni, M., Guibas, L., Hershberger, J., Sharir,
M., & Snoeyink, J. (1991). Ray shooting in polygons using geodesic triangulations.
In 18th International Colloquium on Automata, Languages and Programming
(Vol. 510, pp. 661–673). Madrid, Spain: Springer. https://doi.org/10.1007/3-540-54233-7_172'
chicago: Chazelle, Bernard, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas
Guibas, John Hershberger, Micha Sharir, and Jack Snoeyink. “Ray Shooting in Polygons
Using Geodesic Triangulations.” In 18th International Colloquium on Automata,
Languages and Programming, 510:661–73. Springer, 1991. https://doi.org/10.1007/3-540-54233-7_172.
ieee: B. Chazelle et al., “Ray shooting in polygons using geodesic triangulations,”
in 18th International Colloquium on Automata, Languages and Programming,
Madrid, Spain, 1991, vol. 510, pp. 661–673.
ista: 'Chazelle B, Edelsbrunner H, Grigni M, Guibas L, Hershberger J, Sharir M,
Snoeyink J. 1991. Ray shooting in polygons using geodesic triangulations. 18th
International Colloquium on Automata, Languages and Programming. ICALP: Automata,
Languages and Programming, LNCS, vol. 510, 661–673.'
mla: Chazelle, Bernard, et al. “Ray Shooting in Polygons Using Geodesic Triangulations.”
18th International Colloquium on Automata, Languages and Programming, vol.
510, Springer, 1991, pp. 661–73, doi:10.1007/3-540-54233-7_172.
short: B. Chazelle, H. Edelsbrunner, M. Grigni, L. Guibas, J. Hershberger, M. Sharir,
J. Snoeyink, in:, 18th International Colloquium on Automata, Languages and Programming,
Springer, 1991, pp. 661–673.
conference:
end_date: 1991-07-12
location: Madrid, Spain
name: 'ICALP: Automata, Languages and Programming'
start_date: 1991-07-08
date_created: 2018-12-11T12:06:42Z
date_published: 1991-06-20T00:00:00Z
date_updated: 2022-02-28T14:53:03Z
day: '20'
doi: 10.1007/3-540-54233-7_172
extern: '1'
intvolume: ' 510'
language:
- iso: eng
main_file_link:
- url: https://link.springer.com/chapter/10.1007/3-540-54233-7_172
month: '06'
oa_version: None
page: 661 - 673
publication: 18th International Colloquium on Automata, Languages and Programming
publication_status: published
publisher: Springer
publist_id: '2066'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Ray shooting in polygons using geodesic triangulations
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 510
year: '1991'
...
---
_id: '4061'
abstract:
- lang: eng
text: We present an algorithm to compute a Euclidean minimum spanning tree of a
given set S of N points in Ed in time O(Fd (N,N) logd N), where Fd (n,m) is the
time required to compute a bichromatic closest pair among n red and m green points
in Ed . If Fd (N,N)=Ω(N1+ε), for some fixed e{open}>0, then the running time
improves to O(Fd (N,N)). Furthermore, we describe a randomized algorithm to compute
a bichromatic closest pair in expected time O((nm log n log m)2/3+m log2 n+n log2
m) in E3, which yields an O(N4/3 log4/3 N) expected time, algorithm for computing
a Euclidean minimum spanning tree of N points in E3. In d≥4 dimensions we obtain
expected time O((nm)1-1/([d/2]+1)+ε+m log n+n log m) for the bichromatic closest
pair problem and O(N2-2/([d/2]+1)ε) for the Euclidean minimum spanning tree problem,
for any positive e{open}.
acknowledgement: The first, second, and fourth authors acknowledge support from the
Center for Discrete Mathematics and Theoretical Computer Science (DIMACS), a National
Science Foundation Science and Technology Center under NSF Grant STC 88-09648. The
second author's work was supported by the National Science Foundation under Grant
CCR-8714565. The third author's work was supported by the Deutsche Forschungsgemeinschaft
under Grant A1 253/1-3, Schwerpunktprogramm "Datenstrukturen und effiziente Algorithmen."
The last two authors' work was also partially supported by the ESPRIT II Basic Research
Action of the EC under Contract No. 3075 (project ALCOM).
article_processing_charge: No
article_type: original
author:
- first_name: Pankaj
full_name: Agarwal, Pankaj
last_name: Agarwal
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Otfried
full_name: Schwarzkopf, Otfried
last_name: Schwarzkopf
- first_name: Emo
full_name: Welzl, Emo
last_name: Welzl
citation:
ama: Agarwal P, Edelsbrunner H, Schwarzkopf O, Welzl E. Euclidean minimum spanning
trees and bichromatic closest pairs. Discrete & Computational Geometry.
1991;6(1):407-422. doi:10.1007/BF02574698
apa: Agarwal, P., Edelsbrunner, H., Schwarzkopf, O., & Welzl, E. (1991). Euclidean
minimum spanning trees and bichromatic closest pairs. Discrete & Computational
Geometry. Springer. https://doi.org/10.1007/BF02574698
chicago: Agarwal, Pankaj, Herbert Edelsbrunner, Otfried Schwarzkopf, and Emo Welzl.
“Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs.” Discrete
& Computational Geometry. Springer, 1991. https://doi.org/10.1007/BF02574698.
ieee: P. Agarwal, H. Edelsbrunner, O. Schwarzkopf, and E. Welzl, “Euclidean minimum
spanning trees and bichromatic closest pairs,” Discrete & Computational
Geometry, vol. 6, no. 1. Springer, pp. 407–422, 1991.
ista: Agarwal P, Edelsbrunner H, Schwarzkopf O, Welzl E. 1991. Euclidean minimum
spanning trees and bichromatic closest pairs. Discrete & Computational Geometry.
6(1), 407–422.
mla: Agarwal, Pankaj, et al. “Euclidean Minimum Spanning Trees and Bichromatic Closest
Pairs.” Discrete & Computational Geometry, vol. 6, no. 1, Springer,
1991, pp. 407–22, doi:10.1007/BF02574698.
short: P. Agarwal, H. Edelsbrunner, O. Schwarzkopf, E. Welzl, Discrete & Computational
Geometry 6 (1991) 407–422.
date_created: 2018-12-11T12:06:42Z
date_published: 1991-12-01T00:00:00Z
date_updated: 2022-02-24T15:06:41Z
day: '01'
doi: 10.1007/BF02574698
extern: '1'
intvolume: ' 6'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://link.springer.com/article/10.1007/BF02574698
month: '12'
oa: 1
oa_version: Published Version
page: 407 - 422
publication: Discrete & Computational Geometry
publication_identifier:
eissn:
- 1432-0444
issn:
- 0179-5376
publication_status: published
publisher: Springer
publist_id: '2062'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Euclidean minimum spanning trees and bichromatic closest pairs
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 6
year: '1991'
...
---
_id: '4062'
abstract:
- lang: eng
text: We prove that for any set S of n points in the plane and n3-α triangles spanned
by the points in S there exists a point (not necessarily in S) contained in at
least n3-3α/(c log5 n) of the triangles. This implies that any set of n points
in three-dimensional space defines at most {Mathematical expression} halving planes.
acknowledgement: "Work on this paper by Boris Aronov and Rephael Wenger has been supported
by DIMACS under NSF Grant STC-88-09648. Work on this paper by Bernard Chazelle has
been supported by NSF Grant CCR-87-00917. Work by Herbert Edelsbrunner has been
supported by NSF Grant CCR-87-14565. Micha Sharir has been supported by ONR Grant
N00014-87-K-0129, by NSF Grant CCR-89-01484, and by grants from the U.S.-Israeli
Binational Science Foundation, the Israeli National Council for Research and Development,
and the Fund for Basic Research administered by the Israeli\r\nAcademy of Sciences"
article_processing_charge: No
article_type: original
author:
- first_name: Boris
full_name: Aronov, Boris
last_name: Aronov
- 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: Rephael
full_name: Wenger, Rephael
last_name: Wenger
citation:
ama: Aronov B, Chazelle B, Edelsbrunner H, Guibas L, Sharir M, Wenger R. Points
and triangles in the plane and halving planes in space. Discrete & Computational
Geometry. 1991;6(1):435-442. doi:10.1007/BF02574700
apa: Aronov, B., Chazelle, B., Edelsbrunner, H., Guibas, L., Sharir, M., & Wenger,
R. (1991). Points and triangles in the plane and halving planes in space. Discrete
& Computational Geometry. Springer. https://doi.org/10.1007/BF02574700
chicago: Aronov, Boris, Bernard Chazelle, Herbert Edelsbrunner, Leonidas Guibas,
Micha Sharir, and Rephael Wenger. “Points and Triangles in the Plane and Halving
Planes in Space.” Discrete & Computational Geometry. Springer, 1991.
https://doi.org/10.1007/BF02574700.
ieee: B. Aronov, B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir, and R. Wenger,
“Points and triangles in the plane and halving planes in space,” Discrete &
Computational Geometry, vol. 6, no. 1. Springer, pp. 435–442, 1991.
ista: Aronov B, Chazelle B, Edelsbrunner H, Guibas L, Sharir M, Wenger R. 1991.
Points and triangles in the plane and halving planes in space. Discrete &
Computational Geometry. 6(1), 435–442.
mla: Aronov, Boris, et al. “Points and Triangles in the Plane and Halving Planes
in Space.” Discrete & Computational Geometry, vol. 6, no. 1, Springer,
1991, pp. 435–42, doi:10.1007/BF02574700.
short: B. Aronov, B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir, R. Wenger,
Discrete & Computational Geometry 6 (1991) 435–442.
date_created: 2018-12-11T12:06:43Z
date_published: 1991-12-01T00:00:00Z
date_updated: 2022-02-24T15:39:25Z
day: '01'
doi: 10.1007/BF02574700
extern: '1'
intvolume: ' 6'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://link.springer.com/article/10.1007/BF02574700
month: '12'
oa: 1
oa_version: Published Version
page: 435 - 442
publication: Discrete & Computational Geometry
publication_identifier:
eissn:
- 1432-0444
issn:
- 0179-5376
publication_status: published
publisher: Springer
publist_id: '2063'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Points and triangles in the plane and halving planes in space
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 6
year: '1991'
...
---
_id: '4508'
abstract:
- lang: eng
text: 'We extend the specification language of temporal logic, the corresponding
verification framework, and the underlying computational model to deal with real-time
properties of concurrent and reactive systems. A global, discrete, and asynchronous
clock is incorporated into the model by defining the abstract notion of a real-time
transition system as a conservative extension of traditional transition systems:
qualitative fairness requirements are replaced (and superseded) by quantitative
lower-bound and upperbound real-time requirements for transitions. We show how
to model real-time systems that communicate either through shared variables or
by message passing, and how to represent the important real-time constructs of
priorities (interrupts), scheduling, and timeouts in this framework. Two styles
for the specification of real-time properties are presented. The first style uses
bounded versions of the temporal operators; the real-time requirements expressed
in this style are classified ...'
acknowledgement: 'This research was supported in part by an IBM graduate fellowship,
by the National Science Foundation grants CCR-89-11512 and CC R-89-13641, by the
Defense Advanced Re-search Projects Agency under contract NOO03%84C-0211, by the
United States Air Force Office of Scientific Research un-der contract AFOSR-W-0057,
and by the European Community ESPRIT Basic Research Action project 3096 (SPEC).
We thank Rajeev Alur for many helpful discussions. '
article_processing_charge: No
author:
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Zohar
full_name: Manna, Zohar
last_name: Manna
- first_name: Amir
full_name: Pnueli, Amir
last_name: Pnueli
citation:
ama: 'Henzinger TA, Manna Z, Pnueli A. Temporal proof methodologies for real-time
systems. In: Proceedings of the 18th ACM SIGPLAN-SIGACT Symposium on Principles
of Programming Languages. ACM; 1991:353-366. doi:10.1145/99583.99629'
apa: 'Henzinger, T. A., Manna, Z., & Pnueli, A. (1991). Temporal proof methodologies
for real-time systems. In Proceedings of the 18th ACM SIGPLAN-SIGACT symposium
on Principles of programming languages (pp. 353–366). Orlando, FL, United
States of America: ACM. https://doi.org/10.1145/99583.99629'
chicago: Henzinger, Thomas A, Zohar Manna, and Amir Pnueli. “Temporal Proof Methodologies
for Real-Time Systems.” In Proceedings of the 18th ACM SIGPLAN-SIGACT Symposium
on Principles of Programming Languages, 353–66. ACM, 1991. https://doi.org/10.1145/99583.99629.
ieee: T. A. Henzinger, Z. Manna, and A. Pnueli, “Temporal proof methodologies for
real-time systems,” in Proceedings of the 18th ACM SIGPLAN-SIGACT symposium
on Principles of programming languages, Orlando, FL, United States of America,
1991, pp. 353–366.
ista: 'Henzinger TA, Manna Z, Pnueli A. 1991. Temporal proof methodologies for real-time
systems. Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of
programming languages. POPL: Principles of Programming Languages, 353–366.'
mla: Henzinger, Thomas A., et al. “Temporal Proof Methodologies for Real-Time Systems.”
Proceedings of the 18th ACM SIGPLAN-SIGACT Symposium on Principles of Programming
Languages, ACM, 1991, pp. 353–66, doi:10.1145/99583.99629.
short: T.A. Henzinger, Z. Manna, A. Pnueli, in:, Proceedings of the 18th ACM SIGPLAN-SIGACT
Symposium on Principles of Programming Languages, ACM, 1991, pp. 353–366.
conference:
end_date: 1991-01-23
location: Orlando, FL, United States of America
name: 'POPL: Principles of Programming Languages'
start_date: 1991-01-21
date_created: 2018-12-11T12:09:13Z
date_published: 1991-01-01T00:00:00Z
date_updated: 2022-02-24T14:44:39Z
day: '01'
doi: 10.1145/99583.99629
extern: '1'
language:
- iso: eng
main_file_link:
- url: https://dl.acm.org/doi/10.1145/99583.99629
month: '01'
oa_version: None
page: 353 - 366
publication: Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of
programming languages
publication_identifier:
isbn:
- 978-0-89791-419-2
publication_status: published
publisher: ACM
publist_id: '221'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Temporal proof methodologies for real-time systems
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
year: '1991'
...
---
_id: '4516'
abstract:
- lang: eng
text: We extend the specification language of temporal logic, the corresponding
verification framework, and the underlying computational model to deal with real-time
properties of reactive systems. Semantics We introduce the abstract computational
model of timed transition systems as a conservative extension of traditional transition
systems qualitative fairness requirements are superseded by quantitative real-time
constraints on the transitions. Digital clocks are introduced as observers of
continuous real-time behavior. We justify our semantical abstractions by demonstrating
that a wide variety of concrete real-time systems can be modeled adequately. Specification
We present two conservative extensions of temporal logic that allow for the specification
of timing constraints while timed temporal logic provides access to time through
a novel kind of time quantifier, metric temporal logic refers to time through
time-bounded versions of the temporal operators. We justify our choice of specification
languages by developing a general framework for the classification of real-time
logics according to their complexity and expressive power. Verification We develop
tools for determining if a real-time system that is modeled as a timed transition
system meets a specification that is given in timed temporal logic or in metric
temporal logic. We present both model-checking algorithms for the automatic verification
of finite-state real-time systems and proof methods for the deductive verification
of real-time systems.
article_processing_charge: No
author:
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
citation:
ama: Henzinger TA. The temporal specification and verification of real-time systems
. 1991.
apa: Henzinger, T. A. (1991). The temporal specification and verification of
real-time systems . Stanford University.
chicago: Henzinger, Thomas A. “The Temporal Specification and Verification of Real-Time
Systems .” Stanford University, 1991.
ieee: T. A. Henzinger, “The temporal specification and verification of real-time
systems ,” Stanford University, 1991.
ista: Henzinger TA. 1991. The temporal specification and verification of real-time
systems . Stanford University.
mla: Henzinger, Thomas A. The Temporal Specification and Verification of Real-Time
Systems . Stanford University, 1991.
short: T.A. Henzinger, The Temporal Specification and Verification of Real-Time
Systems , Stanford University, 1991.
date_created: 2018-12-11T12:09:15Z
date_published: 1991-08-30T00:00:00Z
date_updated: 2022-02-24T14:12:36Z
day: '30'
degree_awarded: PhD
extern: '1'
language:
- iso: eng
main_file_link:
- url: http://pub.ist.ac.at/~tah/Publications/the_temporal_specification_and_verification_of_real-time_systems.pdf
month: '08'
oa_version: None
page: '295'
publication_status: published
publisher: Stanford University
publist_id: '210'
status: public
title: 'The temporal specification and verification of real-time systems '
type: dissertation
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
year: '1991'
...
---
_id: '4592'
article_processing_charge: No
article_type: letter_note
author:
- first_name: Rajeev
full_name: Alur, Rajeev
last_name: Alur
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
citation:
ama: Alur R, Henzinger TA. Time for logic. SIGACT News. 1991;22(3):6-12.
apa: Alur, R., & Henzinger, T. A. (1991). Time for logic. SIGACT News.
ACM.
chicago: Alur, Rajeev, and Thomas A Henzinger. “Time for Logic.” SIGACT News.
ACM, 1991.
ieee: R. Alur and T. A. Henzinger, “Time for logic,” SIGACT News, vol. 22,
no. 3. ACM, pp. 6–12, 1991.
ista: Alur R, Henzinger TA. 1991. Time for logic. SIGACT News. 22(3), 6–12.
mla: Alur, Rajeev, and Thomas A. Henzinger. “Time for Logic.” SIGACT News,
vol. 22, no. 3, ACM, 1991, pp. 6–12.
short: R. Alur, T.A. Henzinger, SIGACT News 22 (1991) 6–12.
date_created: 2018-12-11T12:09:39Z
date_published: 1991-01-01T00:00:00Z
date_updated: 2022-02-24T13:54:10Z
day: '01'
extern: '1'
intvolume: ' 22'
issue: '3'
language:
- iso: eng
main_file_link:
- url: https://dl.acm.org/toc/sigact/1991/22/1
month: '01'
oa_version: None
page: 6 - 12
publication: SIGACT News
publication_identifier:
issn:
- 0163-5700
publication_status: published
publisher: ACM
publist_id: '113'
quality_controlled: '1'
status: public
title: Time for logic
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 22
year: '1991'
...
---
_id: '4621'
abstract:
- lang: eng
text: The most natural, compositional, way of modeling real-time systems uses a dense
domain for time. The satisfiability of timing constraints that are capable of expressing punctuality
in this model, however, is known to be undecidable. We introduce a temporal language that can
constrain the time difference between events only with finite, yet arbitrary, precision and show the
resulting logic to be EXPSPACE-complete. This result allows us to develop an algorithm for the
verification of timing properties of real-time systems with a dense semantics.
acknowledgement: 'We wish to thank an anonymous referee for pointing out
the PSPACE-fragment of Section 4.5. T. A. Henzinger was supported in part by
the Office of Naval Research Young Investigator award NOOO14-95-l-0520, by the National
Science Foundation CAREER award CCR 9501708, by the National Science Foundation
grants CCR 92-00794 and CCR 9504469, by the Air Force Office of Scientific Research
contract F49620-93-l-0056, and by the Advanced Research Projects Agency grant NAG2-892. '
article_processing_charge: No
author:
- first_name: Rajeev
full_name: Alur, Rajeev
last_name: Alur
- first_name: Tomás
full_name: Feder, Tomás
last_name: Feder
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
citation:
ama: 'Alur R, Feder T, Henzinger TA. The benefits of relaxing punctuality. In: Proceedings
of the 10th Annual ACM Symposium on Principles of Distributed Computing. ACM;
1991:139-152. doi:10.1145/227595.227602'
apa: 'Alur, R., Feder, T., & Henzinger, T. A. (1991). The benefits of relaxing
punctuality. In Proceedings of the 10th Annual ACM Symposium on Principles
of Distributed Computing (pp. 139–152). Montreal, Canada: ACM. https://doi.org/10.1145/227595.227602'
chicago: Alur, Rajeev, Tomás Feder, and Thomas A Henzinger. “The Benefits of Relaxing
Punctuality.” In Proceedings of the 10th Annual ACM Symposium on Principles
of Distributed Computing, 139–52. ACM, 1991. https://doi.org/10.1145/227595.227602.
ieee: R. Alur, T. Feder, and T. A. Henzinger, “The benefits of relaxing punctuality,”
in Proceedings of the 10th Annual ACM Symposium on Principles of Distributed
Computing, Montreal, Canada, 1991, pp. 139–152.
ista: 'Alur R, Feder T, Henzinger TA. 1991. The benefits of relaxing punctuality.
Proceedings of the 10th Annual ACM Symposium on Principles of Distributed Computing.
PODC: Principles of Distributed Computing, 139–152.'
mla: Alur, Rajeev, et al. “The Benefits of Relaxing Punctuality.” Proceedings
of the 10th Annual ACM Symposium on Principles of Distributed Computing, ACM,
1991, pp. 139–52, doi:10.1145/227595.227602.
short: R. Alur, T. Feder, T.A. Henzinger, in:, Proceedings of the 10th Annual ACM
Symposium on Principles of Distributed Computing, ACM, 1991, pp. 139–152.
conference:
end_date: 1991-08-21
location: Montreal, Canada
name: 'PODC: Principles of Distributed Computing'
start_date: 1991-08-19
date_created: 2018-12-11T12:09:48Z
date_published: 1991-01-01T00:00:00Z
date_updated: 2022-02-24T13:27:20Z
day: '01'
doi: 10.1145/227595.227602
extern: '1'
language:
- iso: eng
main_file_link:
- url: https://dl.acm.org/doi/10.1145/227595.227602
month: '01'
oa_version: None
page: 139 - 152
publication: Proceedings of the 10th Annual ACM Symposium on Principles of Distributed
Computing
publication_identifier:
isbn:
- 978-0-89791-439-0
publication_status: published
publisher: ACM
publist_id: '86'
quality_controlled: '1'
scopus_import: '1'
status: public
title: The benefits of relaxing punctuality
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
year: '1991'
...
---
_id: '2482'
abstract:
- lang: eng
text: The complementary DNA of a metabotropic glutamate receptor coupled to inositol
phosphate/Ca2+ signal transduction has been cloned and characterized. This receptor
shows no sequence similarity to conventional G protein-coupled receptors and has
a unique structure with large hydrophilic sequences at both sides of seven putative
membrane-spanning domains. Abundant expression of this messenger RNA is observed
in neuronal cells in hippocampal dentate gyrus and CA2-3 and in cerebellar Purkinje
cells, suggesting the importance of this receptor in specific hippocampal and
cerebellar functions.
article_processing_charge: No
article_type: original
author:
- first_name: Masayuki
full_name: Masu, Masayuki
last_name: Masu
- first_name: Yasuto
full_name: Tanabe, Yasuto
last_name: Tanabe
- first_name: Kunihiro
full_name: Tsuchida, Kunihiro
last_name: Tsuchida
- first_name: Ryuichi
full_name: Shigemoto, Ryuichi
id: 499F3ABC-F248-11E8-B48F-1D18A9856A87
last_name: Shigemoto
orcid: 0000-0001-8761-9444
- first_name: Shigetada
full_name: Nakanishi, Shigetada
last_name: Nakanishi
citation:
ama: Masu M, Tanabe Y, Tsuchida K, Shigemoto R, Nakanishi S. Sequence and expression
of a metabotropic glutamate receptor. Nature. 1991;349(6312):760-765. doi:10.1038/349760a0
apa: Masu, M., Tanabe, Y., Tsuchida, K., Shigemoto, R., & Nakanishi, S. (1991).
Sequence and expression of a metabotropic glutamate receptor. Nature. Nature
Publishing Group. https://doi.org/10.1038/349760a0
chicago: Masu, Masayuki, Yasuto Tanabe, Kunihiro Tsuchida, Ryuichi Shigemoto, and
Shigetada Nakanishi. “Sequence and Expression of a Metabotropic Glutamate Receptor.”
Nature. Nature Publishing Group, 1991. https://doi.org/10.1038/349760a0.
ieee: M. Masu, Y. Tanabe, K. Tsuchida, R. Shigemoto, and S. Nakanishi, “Sequence
and expression of a metabotropic glutamate receptor,” Nature, vol. 349,
no. 6312. Nature Publishing Group, pp. 760–765, 1991.
ista: Masu M, Tanabe Y, Tsuchida K, Shigemoto R, Nakanishi S. 1991. Sequence and
expression of a metabotropic glutamate receptor. Nature. 349(6312), 760–765.
mla: Masu, Masayuki, et al. “Sequence and Expression of a Metabotropic Glutamate
Receptor.” Nature, vol. 349, no. 6312, Nature Publishing Group, 1991, pp.
760–65, doi:10.1038/349760a0.
short: M. Masu, Y. Tanabe, K. Tsuchida, R. Shigemoto, S. Nakanishi, Nature 349 (1991)
760–765.
date_created: 2018-12-11T11:57:55Z
date_published: 1991-02-28T00:00:00Z
date_updated: 2022-03-03T15:37:36Z
day: '28'
doi: 10.1038/349760a0
extern: '1'
external_id:
pmid:
- '1847995 '
intvolume: ' 349'
issue: '6312'
language:
- iso: eng
main_file_link:
- url: https://www.nature.com/articles/349760a0
month: '02'
oa_version: None
page: 760 - 765
pmid: 1
publication: Nature
publication_identifier:
eissn:
- 1476-4687
issn:
- 0028-0836
publication_status: published
publisher: Nature Publishing Group
publist_id: '4419'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Sequence and expression of a metabotropic glutamate receptor
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 349
year: '1991'
...
---
_id: '2483'
abstract:
- lang: eng
text: A complementary DNA encoding the rat NMDA receptor has been cloned and characterized.
The single protein encoded by the cDNA forms a receptor-channel complex that has
electrophysiological and pharmacological properties characteristic of the NMDA
receptor. This protein has a significant sequence similarity to the AMPA/kainate
receptors and contains four putative transmembrane segments following a large
extracellular domain. The NMDA receptor messenger RNA is expressed in neuronal
cells throughout the brain regions, particularly in the hippocampus, cerebral
cortex and cerebellum.
article_processing_charge: No
article_type: original
author:
- first_name: Koki
full_name: Moriyoshi, Koki
last_name: Moriyoshi
- first_name: Masayuki
full_name: Masu, Masayuki
last_name: Masu
- first_name: Takahiro
full_name: Ishii, Takahiro
last_name: Ishii
- 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
- first_name: Shigetada
full_name: Nakanishi, Shigetada
last_name: Nakanishi
citation:
ama: Moriyoshi K, Masu M, Ishii T, Shigemoto R, Mizuno N, Nakanishi S. Molecular
cloning and characterization of the rat NMDA receptor. Nature. 1991;353(6348):31-37.
doi:10.1038/354031a0
apa: Moriyoshi, K., Masu, M., Ishii, T., Shigemoto, R., Mizuno, N., & Nakanishi,
S. (1991). Molecular cloning and characterization of the rat NMDA receptor. Nature.
Nature Publishing Group. https://doi.org/10.1038/354031a0
chicago: Moriyoshi, Koki, Masayuki Masu, Takahiro Ishii, Ryuichi Shigemoto, Noboru
Mizuno, and Shigetada Nakanishi. “Molecular Cloning and Characterization of the
Rat NMDA Receptor.” Nature. Nature Publishing Group, 1991. https://doi.org/10.1038/354031a0.
ieee: K. Moriyoshi, M. Masu, T. Ishii, R. Shigemoto, N. Mizuno, and S. Nakanishi,
“Molecular cloning and characterization of the rat NMDA receptor,” Nature,
vol. 353, no. 6348. Nature Publishing Group, pp. 31–37, 1991.
ista: Moriyoshi K, Masu M, Ishii T, Shigemoto R, Mizuno N, Nakanishi S. 1991. Molecular
cloning and characterization of the rat NMDA receptor. Nature. 353(6348), 31–37.
mla: Moriyoshi, Koki, et al. “Molecular Cloning and Characterization of the Rat
NMDA Receptor.” Nature, vol. 353, no. 6348, Nature Publishing Group, 1991,
pp. 31–37, doi:10.1038/354031a0.
short: K. Moriyoshi, M. Masu, T. Ishii, R. Shigemoto, N. Mizuno, S. Nakanishi, Nature
353 (1991) 31–37.
date_created: 2018-12-11T11:57:56Z
date_published: 1991-11-07T00:00:00Z
date_updated: 2022-03-03T15:25:04Z
day: '07'
doi: 10.1038/354031a0
extern: '1'
external_id:
pmid:
- '1834949'
intvolume: ' 353'
issue: '6348'
language:
- iso: eng
main_file_link:
- url: https://www.nature.com/articles/354031a0
month: '11'
oa_version: None
page: 31 - 37
pmid: 1
publication: Nature
publication_identifier:
eissn:
- 1476-4687
issn:
- 0028-0836
publication_status: published
publisher: Nature Publishing Group
publist_id: '4418'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Molecular cloning and characterization of the rat NMDA receptor
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 353
year: '1991'
...
---
_id: '2529'
abstract:
- lang: eng
text: 'The distribution of cerebral cortical neurons sending projection fibers to
the nucleus of the solitary tract (NST), and the topographical distribution of
axon terminals of cortico-NST fibers within the NST were examined in the cat by
two sets of experiments with horseradish peroxidase (HRP) and HRP conjugated with
wheat germ agglutinin (WGA-HRP). First, HRP was injected into the NST. In the
cerebral cortex of these cats, neuronal cell bodies were labeled retrogradely
in the deep pyramidal cell layer (layer V): After HRP injection centered on the
rostral or middle part of the NST, HRP-labeled neuronal cell bodies were distributed
mainly in the orbital gyrus and caudal part of the intralimbic cortex, and additionally
in the rostral part of the anterior sylvian gyrus. After HRP injection centered
on the caudal part of the NST, labeled neuronal cell bodies were seen mainly in
the caudoventral part of the intralimbic cortex, and additionally in the orbital
gyrus, posterior sigmoid gyrus and rostral part of the anterior sylvian gyrus.
The labeling in the intralimbic cortex, orbital gyrus and anterior sylvian gyrus
was bilateral with a predominantly ipsilateral distribution, while that in the
posterior sigmoid gyrus was bilateral with a clear-cut contralateral dominance.
In the second set of experiments, WGA-HRP was injected into the cerebral cortical
regions where neuronal cell bodies had been retrogradely labeled with HRP injected
into the NST: after WGA-HRP injection into the orbital gyrus, presumed axon terminals
in the NST were labeled in the rostral two thirds of the nucleus bilaterally with
an ipsilateral predominance. After WGA-HRP injection into the rostral part of
the anterior sylvian gyrus, a moderate number of presumed axon terminals were
labeled throughout the whole rostrocaudal extent of the NST bilaterally with a
slight ipsilateral dominance. After WGA-HRP injection into the middle and caudal
parts of the anterior sylvian gyrus, no labeling was found in the NST. After WGA-HRP
injection into the caudal part of the intralimbic cortex, presumed terminal labeling
in the NST was seen throughout the whole rostrocaudal extent of the nucleus bilaterally
with a dominant ipsilateral distribution. After WGA-HRP injection into the posterior
sigmoid gyrus, however, no terminal labeling was found in the NST. The results
indicate that cortico-NST fibers from the orbital gyrus terminate in the rostral
two thirds of the NST, while those from the intralimbic cortex and the rostral
part of the anterior sylvian gyrus project to the whole rostrocaudal extent of
the NST.'
article_processing_charge: No
article_type: original
author:
- first_name: Yukihiko
full_name: Yasui, Yukihiko
last_name: Yasui
- first_name: Kazuo
full_name: Itoh, Kazuo
last_name: Itoh
- first_name: Takeshi
full_name: Kaneko, Takeshi
last_name: Kaneko
- 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: Yasui Y, Itoh K, Kaneko T, Shigemoto R, Mizuno N. Topographical projections
from the cerebral cortex to the nucleus of the solitary tract in the cat. Experimental
Brain Research. 1991;85(1):75-84. doi:10.1007/BF00229988
apa: Yasui, Y., Itoh, K., Kaneko, T., Shigemoto, R., & Mizuno, N. (1991). Topographical
projections from the cerebral cortex to the nucleus of the solitary tract in the
cat. Experimental Brain Research. Springer. https://doi.org/10.1007/BF00229988
chicago: Yasui, Yukihiko, Kazuo Itoh, Takeshi Kaneko, Ryuichi Shigemoto, and Noboru
Mizuno. “Topographical Projections from the Cerebral Cortex to the Nucleus of
the Solitary Tract in the Cat.” Experimental Brain Research. Springer,
1991. https://doi.org/10.1007/BF00229988.
ieee: Y. Yasui, K. Itoh, T. Kaneko, R. Shigemoto, and N. Mizuno, “Topographical
projections from the cerebral cortex to the nucleus of the solitary tract in the
cat,” Experimental Brain Research, vol. 85, no. 1. Springer, pp. 75–84,
1991.
ista: Yasui Y, Itoh K, Kaneko T, Shigemoto R, Mizuno N. 1991. Topographical projections
from the cerebral cortex to the nucleus of the solitary tract in the cat. Experimental
Brain Research. 85(1), 75–84.
mla: Yasui, Yukihiko, et al. “Topographical Projections from the Cerebral Cortex
to the Nucleus of the Solitary Tract in the Cat.” Experimental Brain Research,
vol. 85, no. 1, Springer, 1991, pp. 75–84, doi:10.1007/BF00229988.
short: Y. Yasui, K. Itoh, T. Kaneko, R. Shigemoto, N. Mizuno, Experimental Brain
Research 85 (1991) 75–84.
date_created: 2018-12-11T11:58:12Z
date_published: 1991-05-01T00:00:00Z
date_updated: 2022-03-03T15:16:05Z
day: '01'
doi: 10.1007/BF00229988
extern: '1'
external_id:
pmid:
- '1715827'
intvolume: ' 85'
issue: '1'
language:
- iso: eng
main_file_link:
- url: https://link.springer.com/article/10.1007/BF00229988
month: '05'
oa_version: None
page: 75 - 84
pmid: 1
publication: Experimental Brain Research
publication_identifier:
eissn:
- 1432-1106
issn:
- 0014-4819
publication_status: published
publisher: Springer
publist_id: '4370'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Topographical projections from the cerebral cortex to the nucleus of the solitary
tract in the cat
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 85
year: '1991'
...
---
_id: '2530'
article_processing_charge: No
author:
- first_name: Shigetada
full_name: Nakanishi, Shigetada
last_name: Nakanishi
- first_name: Hiroaki
full_name: Ohkubo, Hiroaki
last_name: Ohkubo
- first_name: Akira
full_name: Kakizuka, Akira
last_name: Kakizuka
- first_name: Yoshifumi
full_name: Yokota, Yoshifumi
last_name: Yokota
- first_name: Ryuichi
full_name: Shigemoto, Ryuichi
id: 499F3ABC-F248-11E8-B48F-1D18A9856A87
last_name: Shigemoto
orcid: 0000-0001-8761-9444
- first_name: Yoshiki
full_name: Sasai, Yoshiki
last_name: Sasai
- first_name: Toru
full_name: Takumi, Toru
last_name: Takumi
citation:
ama: 'Nakanishi S, Ohkubo H, Kakizuka A, et al. Molecular characterization of mammalian
tachykinin receptors and a possible epithelial potassium channel. In: Recent
Progress in Hormone Research. Vol 46. The Endocrine Society; 1991:59-83. doi:10.1016/b978-0-12-571146-3.50007-9'
apa: Nakanishi, S., Ohkubo, H., Kakizuka, A., Yokota, Y., Shigemoto, R., Sasai,
Y., & Takumi, T. (1991). Molecular characterization of mammalian tachykinin
receptors and a possible epithelial potassium channel. In Recent Progress in
Hormone Research (Vol. 46, pp. 59–83). The Endocrine Society. https://doi.org/10.1016/b978-0-12-571146-3.50007-9
chicago: Nakanishi, Shigetada, Hiroaki Ohkubo, Akira Kakizuka, Yoshifumi Yokota,
Ryuichi Shigemoto, Yoshiki Sasai, and Toru Takumi. “Molecular Characterization
of Mammalian Tachykinin Receptors and a Possible Epithelial Potassium Channel.”
In Recent Progress in Hormone Research, 46:59–83. The Endocrine Society,
1991. https://doi.org/10.1016/b978-0-12-571146-3.50007-9.
ieee: S. Nakanishi et al., “Molecular characterization of mammalian tachykinin
receptors and a possible epithelial potassium channel,” in Recent Progress
in Hormone Research, vol. 46, The Endocrine Society, 1991, pp. 59–83.
ista: 'Nakanishi S, Ohkubo H, Kakizuka A, Yokota Y, Shigemoto R, Sasai Y, Takumi
T. 1991.Molecular characterization of mammalian tachykinin receptors and a possible
epithelial potassium channel. In: Recent Progress in Hormone Research. vol. 46,
59–83.'
mla: Nakanishi, Shigetada, et al. “Molecular Characterization of Mammalian Tachykinin
Receptors and a Possible Epithelial Potassium Channel.” Recent Progress in
Hormone Research, vol. 46, The Endocrine Society, 1991, pp. 59–83, doi:10.1016/b978-0-12-571146-3.50007-9.
short: S. Nakanishi, H. Ohkubo, A. Kakizuka, Y. Yokota, R. Shigemoto, Y. Sasai,
T. Takumi, in:, Recent Progress in Hormone Research, The Endocrine Society, 1991,
pp. 59–83.
date_created: 2018-12-11T11:58:13Z
date_published: 1991-01-01T00:00:00Z
date_updated: 2022-03-03T14:59:24Z
day: '01'
doi: 10.1016/b978-0-12-571146-3.50007-9
extern: '1'
external_id:
pmid:
- '2177908 '
intvolume: ' 46'
language:
- iso: eng
main_file_link:
- url: https://www.sciencedirect.com/science/article/pii/B9780125711463500079
month: '01'
oa_version: None
page: 59 - 83
pmid: 1
publication: Recent Progress in Hormone Research
publication_identifier:
isbn:
- 978-0-12-571148-7
publication_status: published
publisher: The Endocrine Society
publist_id: '4369'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Molecular characterization of mammalian tachykinin receptors and a possible
epithelial potassium channel
type: book_chapter
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 46
year: '1991'
...
---
_id: '3467'
abstract:
- lang: eng
text: The effects of mast cell degranulating peptide (MCDP), a toxin from the honey
bee, and of dendrotoxin (DTX), a toxin from the green mamba snake, were studied
in voltage-clamped experiments with myelinated nerve fibres of Xenopus. MCDP and
DTX blocked part of the K+ current. About 20% of the K+ current, however, was
resistant to the toxins even in high concentrations. In Ringer solution half-maximal
block was reached with concentrations of 33 nM MCDP and 11 nM DTX. In high-K+
solution the potency of both toxins was lower. β-Bungarotoxin (β-BuTX), another
snake toxin, also blocked part of the K+ current, but was less potent than MCDP
and DTX. Tail currents in high-K+ solution were analysed and three K+ current
components were separated according to Dubois (1981b). Both MCDP and DTX selectively
blocked a fast deactivating, slowly inactivating K+ current component which steeply
activates between E = -60 mV and E = -40 mV (component f1). In concentrations
around 100 nM, MCDP and DTX blocked neither the slow K+ current (component s)
nor the fast deactivating, rapidly inactivating K+ current which activates between
E = -40 mV and E = 20 mV (component f2). Similar results could be derived from
K+ outward currents in Ringer solution. In high-K+, IC50 of MCDP for component
f1 was 99 nM, whereas it was 7.6 μM for f2. Corresponding values for DTX are 68
nM and 1.8 μM. Binding studies with nerve fibre membranes of Xenopus reveal high-affinity
binding sites for 125I-labelled DTX )K(D) = 22 pM in Ringer solution and 81 pM
in high-K+ solution). 125I-labelled DTX can be displaced from its sites completely
by unlabelled DTX, toxin I (black mamba toxin), MCDP, and partially by β-BuTX.
Immunocytochemical staining demonstrates that binding sites for DTX are present
in nodal and paranodal regions of the axonal membrane. The axonal membrane of
motor and sensory nerve fibres is equipped with three types of well-characterized
K+ channels and constitutes so far the best preparation to study MCDP- and DTX-sensitive
K+ channels with electrophysiological and biochemical methods.
acknowledgement: "We thank Professor E. Habermann for critical reading of the manuscript
and E. Schmidt and J. Schafer for technical assistance. Financial support by the
Deutsche Forschungsgemeinschaft (Vo 188/13-1 and SFB 249) is gratefully acknowledged.\r\n"
article_processing_charge: No
article_type: original
author:
- first_name: Michael
full_name: Bräu, Michael
last_name: Bräu
- first_name: Florian
full_name: Dreyer, Florian
last_name: Dreyer
- 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: Holger
full_name: Repp, Holger
last_name: Repp
- first_name: Werner
full_name: Vogel, Werner
last_name: Vogel
citation:
ama: 'Bräu M, Dreyer F, Jonas PM, Repp H, Vogel W. A K+ channel in Xenopus nerve
fibres selectively blocked by bee and snake toxins: binding and voltage-clamp
experiments. Journal of Physiology. 1990;420:365-385. doi:10.1113/jphysiol.1990.sp017918'
apa: 'Bräu, M., Dreyer, F., Jonas, P. M., Repp, H., & Vogel, W. (1990). A K+
channel in Xenopus nerve fibres selectively blocked by bee and snake toxins: binding
and voltage-clamp experiments. Journal of Physiology. Wiley-Blackwell.
https://doi.org/10.1113/jphysiol.1990.sp017918'
chicago: 'Bräu, Michael, Florian Dreyer, Peter M Jonas, Holger Repp, and Werner
Vogel. “A K+ Channel in Xenopus Nerve Fibres Selectively Blocked by Bee and Snake
Toxins: Binding and Voltage-Clamp Experiments.” Journal of Physiology.
Wiley-Blackwell, 1990. https://doi.org/10.1113/jphysiol.1990.sp017918.'
ieee: 'M. Bräu, F. Dreyer, P. M. Jonas, H. Repp, and W. Vogel, “A K+ channel in
Xenopus nerve fibres selectively blocked by bee and snake toxins: binding and
voltage-clamp experiments,” Journal of Physiology, vol. 420. Wiley-Blackwell,
pp. 365–385, 1990.'
ista: 'Bräu M, Dreyer F, Jonas PM, Repp H, Vogel W. 1990. A K+ channel in Xenopus
nerve fibres selectively blocked by bee and snake toxins: binding and voltage-clamp
experiments. Journal of Physiology. 420, 365–385.'
mla: 'Bräu, Michael, et al. “A K+ Channel in Xenopus Nerve Fibres Selectively Blocked
by Bee and Snake Toxins: Binding and Voltage-Clamp Experiments.” Journal of
Physiology, vol. 420, Wiley-Blackwell, 1990, pp. 365–85, doi:10.1113/jphysiol.1990.sp017918.'
short: M. Bräu, F. Dreyer, P.M. Jonas, H. Repp, W. Vogel, Journal of Physiology
420 (1990) 365–385.
date_created: 2018-12-11T12:03:29Z
date_published: 1990-01-01T00:00:00Z
date_updated: 2022-02-23T16:10:03Z
day: '01'
doi: 10.1113/jphysiol.1990.sp017918
extern: '1'
external_id:
pmid:
- '2324990'
intvolume: ' 420'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC1190055/
month: '01'
oa: 1
oa_version: None
page: 365 - 385
pmid: 1
publication: Journal of Physiology
publication_identifier:
eissn:
- 1469-7793
issn:
- 0022-3751
publication_status: published
publisher: Wiley-Blackwell
publist_id: '2920'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'A K+ channel in Xenopus nerve fibres selectively blocked by bee and snake
toxins: binding and voltage-clamp experiments'
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 420
year: '1990'
...
---
_id: '3565'
abstract:
- lang: eng
text: We investigate the complexity of determining the shape and presentation (i.e.
position with orientation) of convex polytopes in multi-dimensional Euclidean
space using a variety of probe models.
acknowledgement: "NSF Grant MCS-83-03926 and DCR-85-05517\r\nAmoco Foundation Faculty
Development in Computer Science\r\nNSF Grant DCR-84-01633 and DCR-84-01898"
article_processing_charge: No
author:
- first_name: David
full_name: Dobkin, David
last_name: Dobkin
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Chee
full_name: Yap, Chee
last_name: Yap
citation:
ama: 'Dobkin D, Edelsbrunner H, Yap C. Probing convex polytopes. In: Cox I, Wilfong
G, eds. Autonomous Robot Vehicles. Springer; 1990:328-341. doi:10.1007/978-1-4613-8997-2_25'
apa: Dobkin, D., Edelsbrunner, H., & Yap, C. (1990). Probing convex polytopes.
In I. Cox & G. Wilfong (Eds.), Autonomous Robot Vehicles (pp. 328–341).
Springer. https://doi.org/10.1007/978-1-4613-8997-2_25
chicago: Dobkin, David, Herbert Edelsbrunner, and Chee Yap. “Probing Convex Polytopes.”
In Autonomous Robot Vehicles, edited by Ingemar Cox and Gordon Wilfong,
328–41. Springer, 1990. https://doi.org/10.1007/978-1-4613-8997-2_25.
ieee: D. Dobkin, H. Edelsbrunner, and C. Yap, “Probing convex polytopes,” in Autonomous
Robot Vehicles, I. Cox and G. Wilfong, Eds. Springer, 1990, pp. 328–341.
ista: 'Dobkin D, Edelsbrunner H, Yap C. 1990.Probing convex polytopes. In: Autonomous
Robot Vehicles. , 328–341.'
mla: Dobkin, David, et al. “Probing Convex Polytopes.” Autonomous Robot Vehicles,
edited by Ingemar Cox and Gordon Wilfong, Springer, 1990, pp. 328–41, doi:10.1007/978-1-4613-8997-2_25.
short: D. Dobkin, H. Edelsbrunner, C. Yap, in:, I. Cox, G. Wilfong (Eds.), Autonomous
Robot Vehicles, Springer, 1990, pp. 328–341.
date_created: 2018-12-11T12:03:59Z
date_published: 1990-01-01T00:00:00Z
date_updated: 2022-02-23T15:41:07Z
day: '01'
doi: 10.1007/978-1-4613-8997-2_25
editor:
- first_name: Ingemar
full_name: Cox, Ingemar
last_name: Cox
- first_name: Gordon
full_name: Wilfong, Gordon
last_name: Wilfong
extern: '1'
language:
- iso: eng
main_file_link:
- url: https://link.springer.com/chapter/10.1007/978-1-4613-8997-2_25
month: '01'
oa_version: None
page: 328 - 341
publication: Autonomous Robot Vehicles
publication_identifier:
isbn:
- 978-1-4613-8997-2
publication_status: published
publisher: Springer
publist_id: '2820'
quality_controlled: '1'
status: public
title: Probing convex polytopes
type: book_chapter
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
year: '1990'
...
---
_id: '3649'
abstract:
- lang: eng
text: Selection on polygenic characters is generally analyzed by statistical methods
that assume a Gaussian (normal) distribution of breeding values. We present an
alternative analysis based on multilocus population genetics. We use a general
representation of selection, recombination, and drift to analyze an idealized
polygenic system in which all genetic effects are additive (i.e., both dominance
and epistasis are absent), but no assumptions are made about the distribution
of breeding values or the numbers of loci or alleles. Our analysis produces three
results. First, our equations reproduce the standard recursions for the mean and
additive variance if breeding values are Gaussian; but they also reveal how non-Gaussian
distributions of breeding values will alter these dynamics. Second, an approximation
valid for weak selection shows that even if genetic variance is attributable to
an effectively infinite number of loci with only additive effects, selection will
generally drive the distribution of breeding values away from a Gaussian distribution
by creating multilocus linkage disequilibria. Long-term dynamics of means can
depart substantially from the predictions of the standard selection recursions,
but the discrepancy may often be negligible for short-term selection. Third, by
including mutation, we show that, for realistic parameter values, linkage disequilibrium
has little effect on the amount of additive variance maintained at an equilibrium
between stabilizing selection and mutation. Each of these analytical results is
supported by numerical calculations.
acknowledgement: 'We thank R. Burger, J. A. Coyne, W. G. Hill, A. A. Hoffmann, J.
H. Gillespie, M. Slatkin, T. Nagylaki and Z.-B. Zeng for helpful discussions and
comments on earlier drafts. Our research is supported by grants from the National
Science Foundation (BSR-8866548), the Science and Engineering Research Council,
and the Institute of Theoretical Dynamics at UCD. '
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. Dynamics of polygenic characters under selection. Theoretical
Population Biology. 1990;38(1):1-57. doi:10.1016/0040-5809(90)90002-D
apa: Turelli, M., & Barton, N. H. (1990). Dynamics of polygenic characters under
selection. Theoretical Population Biology. Academic Press. https://doi.org/10.1016/0040-5809(90)90002-D
chicago: Turelli, Michael, and Nicholas H Barton. “Dynamics of Polygenic Characters
under Selection.” Theoretical Population Biology. Academic Press, 1990.
https://doi.org/10.1016/0040-5809(90)90002-D.
ieee: M. Turelli and N. H. Barton, “Dynamics of polygenic characters under selection,”
Theoretical Population Biology, vol. 38, no. 1. Academic Press, pp. 1–57,
1990.
ista: Turelli M, Barton NH. 1990. Dynamics of polygenic characters under selection.
Theoretical Population Biology. 38(1), 1–57.
mla: Turelli, Michael, and Nicholas H. Barton. “Dynamics of Polygenic Characters
under Selection.” Theoretical Population Biology, vol. 38, no. 1, Academic
Press, 1990, pp. 1–57, doi:10.1016/0040-5809(90)90002-D.
short: M. Turelli, N.H. Barton, Theoretical Population Biology 38 (1990) 1–57.
date_created: 2018-12-11T12:04:26Z
date_published: 1990-01-01T00:00:00Z
date_updated: 2022-02-23T14:48:49Z
day: '01'
doi: 10.1016/0040-5809(90)90002-D
extern: '1'
intvolume: ' 38'
issue: '1'
language:
- iso: eng
main_file_link:
- url: https://www.sciencedirect.com/science/article/pii/004058099090002D?via%3Dihub
month: '01'
oa_version: None
page: 1 - 57
publication: Theoretical Population Biology
publication_identifier:
issn:
- 0040-5809
publication_status: published
publisher: Academic Press
publist_id: '2734'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Dynamics of polygenic characters under selection
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 38
year: '1990'
...
---
_id: '3650'
abstract:
- lang: eng
text: Hybrid zones can yield estimates of natural selection and gene flow. The width
of a cline in gene frequency is approximately proportional to gene flow (σ) divided
by the square root of per-locus selection ( &s). Gene flow also causes gametic
correlations (linkage disequilibria) between genes that differ across hybrid zones.
Correlations are stronger when the hybrid zone is narrow, and rise to a maximum
roughly equal to s. Thus cline width and gametic correlations combine to give
estimates of gene flow and selection. These indirect measures of σ and s are especially
useful because they can be made from collections, and require no field experiments.
The method was applied to hybrid zones between color pattern races in a pair of
Peruvian Heliconius butterfly species. The species are Mullerian mimics of one
another, and both show the same changes in warning color pattern across their
respective hybrid zones. The expectations of cline width and gametic correlation
were generated using simulations of clines stabilized by strong frequency-dependent
selection. In the hybrid zone in Heliconius erato, clines at three major color
pattern loci were between 8.5 and 10.2 km wide, and the pairwise gametic correlations
peaked at R & 0.35. These measures suggest that s & 0.23 per locus, and
that σ & 2.6 km. In erato, the shapes of the clines agreed with that expected
on the basis of dominance. Heliconius melpomene has a nearly coincident hybrid
zone. In this species, cline widths at four major color pattern loci varied between
11.7 and 13.4 km. Pairwise gametic correlations peaked near R & 1.00 for tightly
linked genes, and at R & 0.40 for unlinked genes, giving s & 0.25 per
locus and σ & 3.7 km. In melpomene, cline shapes did not perfectly fit theoretical
shapes based on dominance; this deviation might be explained by long-distance
migration and/or strong epistasis. Compared with erato, sample sizes in melpomene
are lower and the genetics of its color patterns are less well understood. In
spite of these problems, selection and gene flow are clearly of the same order
of magnitude in the two species. The relatively high per locus selection coefficients
agree with ``major gene'' theories for the evolution of Mullerian mimicry, but
the genetic architecture of the color patterns does not. These results show that
the genetics and evolution of mimicry are still only sketchily understood.
acknowledgement: 'We thank the Natural Environmental Research Council, the Royal Society,
the Nuffield Foundation, CONCYTEC, and Mrs. G. W. BORLASE for financial support,
and the people of San Martin for their generous hospitality. We are very grateful
to S. D. KNAPP, who helped by maintaining our sanity and rearing larvae. We are
also grateful to an anonymous reviewer, A. W. PORTER, J. C. SCHNEIDER, M. TURELLI
and C. E. WATSON for helpful comments on the manuscript. This paper was approved
for publication as journal article no. 5-7255 of the Mississippi Agricultural and
Forestry Experiment Station, Mississippi State University, project no. MIS-2 122. '
article_processing_charge: No
article_type: original
author:
- first_name: James
full_name: Mallet, James
last_name: Mallet
- 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: Gerado
full_name: Lamas, Gerado
last_name: Lamas
- first_name: José
full_name: Santisteban, José
last_name: Santisteban
- first_name: Manuel
full_name: Muedas, Manuel
last_name: Muedas
- first_name: Harriet
full_name: Eeley, Harriet
last_name: Eeley
citation:
ama: Mallet J, Barton NH, Lamas G, Santisteban J, Muedas M, Eeley H. Estimates of
selection and gene flow from measures of cline width and linkage disequilibrium
in Heliconius hybrid zones. Genetics. 1990;124(4):921-936. doi:10.1093/genetics/124.4.921
apa: Mallet, J., Barton, N. H., Lamas, G., Santisteban, J., Muedas, M., & Eeley,
H. (1990). Estimates of selection and gene flow from measures of cline width and
linkage disequilibrium in Heliconius hybrid zones. Genetics. Genetics Society
of America. https://doi.org/10.1093/genetics/124.4.921
chicago: Mallet, James, Nicholas H Barton, Gerado Lamas, José Santisteban, Manuel
Muedas, and Harriet Eeley. “Estimates of Selection and Gene Flow from Measures
of Cline Width and Linkage Disequilibrium in Heliconius Hybrid Zones.” Genetics.
Genetics Society of America, 1990. https://doi.org/10.1093/genetics/124.4.921.
ieee: J. Mallet, N. H. Barton, G. Lamas, J. Santisteban, M. Muedas, and H. Eeley,
“Estimates of selection and gene flow from measures of cline width and linkage
disequilibrium in Heliconius hybrid zones,” Genetics, vol. 124, no. 4.
Genetics Society of America, pp. 921–936, 1990.
ista: Mallet J, Barton NH, Lamas G, Santisteban J, Muedas M, Eeley H. 1990. Estimates
of selection and gene flow from measures of cline width and linkage disequilibrium
in Heliconius hybrid zones. Genetics. 124(4), 921–936.
mla: Mallet, James, et al. “Estimates of Selection and Gene Flow from Measures of
Cline Width and Linkage Disequilibrium in Heliconius Hybrid Zones.” Genetics,
vol. 124, no. 4, Genetics Society of America, 1990, pp. 921–36, doi:10.1093/genetics/124.4.921.
short: J. Mallet, N.H. Barton, G. Lamas, J. Santisteban, M. Muedas, H. Eeley, Genetics
124 (1990) 921–936.
date_created: 2018-12-11T12:04:26Z
date_published: 1990-04-01T00:00:00Z
date_updated: 2022-02-23T11:04:17Z
day: '01'
doi: 10.1093/genetics/124.4.921
extern: '1'
external_id:
pmid:
- '2323556'
intvolume: ' 124'
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC1203983/
month: '04'
oa: 1
oa_version: Published Version
page: 921 - 936
pmid: 1
publication: Genetics
publication_identifier:
issn:
- 0016-6731
publication_status: published
publisher: Genetics Society of America
publist_id: '2733'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Estimates of selection and gene flow from measures of cline width and linkage
disequilibrium in Heliconius hybrid zones
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 124
year: '1990'
...
---
_id: '3651'
abstract:
- lang: eng
text: 'It is widely held that each gene typically affects many characters, and that
each character is affected by many genes. Moreover, strong stabilizing selection
cannot act on an indefinitely large number of independent traits. This makes it
likely that heritable variation in any one trait is maintained as a side effect
of polymorphisms which have nothing to do with selection on that trait. This paper
examines the idea that variation is maintained as the pleiotropic side effect
of either deleterious mutation, or balancing selection. If mutation is responsible,
it must produce alleles which are only mildly deleterious (s & 10(-3)), but
nevertheless have significant effects on the trait. Balancing selection can readily
maintain high heritabilities; however, selection must be spread over many weakly
selected polymorphisms if large responses to artificial selection are to be possible.
In both classes of pleiotropic model, extreme phenotypes are less fit, giving
the appearance of stabilizing selection on the trait. However, it is shown that
this effect is weak (of the same order as the selection on each gene): the strong
stabilizing selection which is often observed is likely to be caused by correlations
with a limited number of directly selected traits. Possible experiments for distinguishing
the alternatives are discussed.'
acknowledgement: Thanks to JERRY COYNE, BILL HILL, LINDA PARTRIDGE, MICHAEL TURELLI,
and two anonymous reviewers for their critical comments. This work was supported
by grants from the National Science Foundation (BSR-8866548) the Science and Engineering
Research Council (GR/E/08507), and by the Institute of Theoretical Dynamics, University
of California, Davis.
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. Pleiotropic models of quantitative variation. Genetics. 1990;124(3):773-782.
doi:10.1093/genetics/124.3.773
apa: Barton, N. H. (1990). Pleiotropic models of quantitative variation. Genetics.
Genetics Society of America. https://doi.org/10.1093/genetics/124.3.773
chicago: Barton, Nicholas H. “Pleiotropic Models of Quantitative Variation.” Genetics.
Genetics Society of America, 1990. https://doi.org/10.1093/genetics/124.3.773 .
ieee: N. H. Barton, “Pleiotropic models of quantitative variation,” Genetics,
vol. 124, no. 3. Genetics Society of America, pp. 773–782, 1990.
ista: Barton NH. 1990. Pleiotropic models of quantitative variation. Genetics. 124(3),
773–782.
mla: Barton, Nicholas H. “Pleiotropic Models of Quantitative Variation.” Genetics,
vol. 124, no. 3, Genetics Society of America, 1990, pp. 773–82, doi:10.1093/genetics/124.3.773 .
short: N.H. Barton, Genetics 124 (1990) 773–782.
date_created: 2018-12-11T12:04:26Z
date_published: 1990-03-01T00:00:00Z
date_updated: 2022-02-23T10:41:43Z
day: '01'
doi: '10.1093/genetics/124.3.773 '
extern: '1'
external_id:
pmid:
- '2311921'
intvolume: ' 124'
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://academic.oup.com/genetics/article/124/3/773/5999956?login=true
month: '03'
oa: 1
oa_version: Published Version
page: 773 - 782
pmid: 1
publication: Genetics
publication_identifier:
issn:
- 0016-6731
publication_status: published
publisher: Genetics Society of America
publist_id: '2732'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Pleiotropic models of quantitative variation
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 124
year: '1990'
...