---
_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'
...
---
_id: '4177'
abstract:
- lang: eng
text: Thyroid hormones play an important role in brain development, but the mechanism(s)
by which triiodothyronine (T3) mediates neuronal differentiation is poorly understood.
Here we demonstrate that T3 regulates the neurotrophic factor, neurotrophin-3
(NT-3), in developing rat cerebellar granule cells both in cell culture and in
vivo. In situ hybridization experiments showed that developing Purkinje cells
do not express NT-3 mRNA but do express trkC, the putative neuronal receptor for
NT-3. Addition of recombinant NT-3 to cerebellar cultures from embryonic rat brain
induces hypertrophy and neurite sprouting of Purkinje cells, and upregulates the
mRNA encoding the calcium-binding protein, calbindin-28 kD. The present study
demonstrates a novel interaction between cerebellar granule neurons and developing
Purkinje cells in which NT-3 induced by T3 in the granule cells promotes Purkinje
cell differentiation.
acknowledgement: "E. Castrtn is an Alexander von Humboldt fellow. M. Berzaghi is supported
by a scholarship from CNPQ, Brasil. L. F. Parada, P. Tsoulfas, and L. Tesarollo
were supported by a National Institutes of Health grant. We thank D. Stratmann and
K. Angermeyer for skillful technical assistance; I. Hajjar for secretarial work
and Dr. R. G~rtner for help with\r\ninducing hypothyroidism; Dr. W. Hunzieker for
the calbindin-28 kD eDNA; Dr. M. Fishman for the GAP-43 eDNA; and Dr. Y.-A. Barde
for critical comments."
article_processing_charge: No
article_type: original
author:
- first_name: Dan
full_name: Lindholm, Dan
last_name: Lindholm
- first_name: Eero
full_name: Castrén, Eero
last_name: Castrén
- first_name: Pantelis
full_name: Tsoulfas, Pantelis
last_name: Tsoulfas
- first_name: Roland
full_name: Kolbeck, Roland
last_name: Kolbeck
- first_name: Maria
full_name: Berzaghi, Maria
last_name: Berzaghi
- first_name: Axel
full_name: Leingärtner, Axel
last_name: Leingärtner
- 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: Lino
full_name: Tesarollo, Lino
last_name: Tesarollo
- first_name: Luis
full_name: Parada, Luis
last_name: Parada
- first_name: Hans
full_name: Thoenen, Hans
last_name: Thoenen
citation:
ama: Lindholm D, Castrén E, Tsoulfas P, et al. Neurotrophin-3 induced by tri-iodothyronine
in cerebellar granule cells promotes Purkinje cell differentiation. Journal
of Cell Biology. 1993;122(2):443-450. doi:10.1083/jcb.122.2.443
apa: Lindholm, D., Castrén, E., Tsoulfas, P., Kolbeck, R., Berzaghi, M., Leingärtner,
A., … Thoenen, H. (1993). Neurotrophin-3 induced by tri-iodothyronine in cerebellar
granule cells promotes Purkinje cell differentiation. Journal of Cell Biology.
Rockefeller University Press. https://doi.org/10.1083/jcb.122.2.443
chicago: Lindholm, Dan, Eero Castrén, Pantelis Tsoulfas, Roland Kolbeck, Maria Berzaghi,
Axel Leingärtner, Carl-Philipp J Heisenberg, Lino Tesarollo, Luis Parada, and
Hans Thoenen. “Neurotrophin-3 Induced by Tri-Iodothyronine in Cerebellar Granule
Cells Promotes Purkinje Cell Differentiation.” Journal of Cell Biology.
Rockefeller University Press, 1993. https://doi.org/10.1083/jcb.122.2.443.
ieee: D. Lindholm et al., “Neurotrophin-3 induced by tri-iodothyronine in
cerebellar granule cells promotes Purkinje cell differentiation,” Journal of
Cell Biology, vol. 122, no. 2. Rockefeller University Press, pp. 443–450,
1993.
ista: Lindholm D, Castrén E, Tsoulfas P, Kolbeck R, Berzaghi M, Leingärtner A, Heisenberg
C-PJ, Tesarollo L, Parada L, Thoenen H. 1993. Neurotrophin-3 induced by tri-iodothyronine
in cerebellar granule cells promotes Purkinje cell differentiation. Journal of
Cell Biology. 122(2), 443–450.
mla: Lindholm, Dan, et al. “Neurotrophin-3 Induced by Tri-Iodothyronine in Cerebellar
Granule Cells Promotes Purkinje Cell Differentiation.” Journal of Cell Biology,
vol. 122, no. 2, Rockefeller University Press, 1993, pp. 443–50, doi:10.1083/jcb.122.2.443.
short: D. Lindholm, E. Castrén, P. Tsoulfas, R. Kolbeck, M. Berzaghi, A. Leingärtner,
C.-P.J. Heisenberg, L. Tesarollo, L. Parada, H. Thoenen, Journal of Cell Biology
122 (1993) 443–450.
date_created: 2018-12-11T12:07:25Z
date_published: 1993-07-15T00:00:00Z
date_updated: 2022-03-24T12:59:20Z
day: '15'
doi: 10.1083/jcb.122.2.443
extern: '1'
external_id:
pmid:
- '8320266'
intvolume: ' 122'
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2119654/
month: '07'
oa: 1
oa_version: None
page: 443 - 450
pmid: 1
publication: Journal of Cell Biology
publication_identifier:
issn:
- 0021-9525
publication_status: published
publisher: Rockefeller University Press
publist_id: '1942'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Neurotrophin-3 induced by tri-iodothyronine in cerebellar granule cells promotes
Purkinje cell differentiation
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 122
year: '1993'
...
---
_id: '4299'
abstract:
- lang: eng
text: Evolutionary explanations of aging (or senescence) fall into two classes.
First, organisms might have evolved the optimal life history, in which survival
and fertility late in life are sacrificed for the sake of early reproduction or
high pre-adult survival. Second, the life history might be depressed below this
optimal compromise by the influx of deleterious mutations; since selection against
late-acting mutations is weaker, deleterious mutations will impose a greater load
on late life. We discuss ways in which these theories might be investigated and
distinguished, with reference to experimental work withDrosophila. While genetic
correlations between life history traits determine the immediate response to selection,
they are hard to measure, and may not reflect the fundamental constraints on life
history. Long term selection experiments are more likely to be informative. The
third approach of using experimental manipulations suffers from some of the same
problems as measures of genetic correlations; however, these two approaches may
be fruitful when used together. The experimental results so far suggest that aging
inDrosophila has evolved in part as a consequence of selection for an optimal
life history, and in part as a result of accumulation of predominantly late-acting
deleterious mutations. Quantification of these effects presents a major challenge
for the future.
article_processing_charge: No
article_type: original
author:
- first_name: Linda
full_name: Partridge, Linda
last_name: Partridge
- 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: 'Partridge L, Barton NH. Evolution of aging: Testing the theory using Drosophila.
Genetica. 1993;91(1-3):89-98. doi:10.1007/BF01435990'
apa: 'Partridge, L., & Barton, N. H. (1993). Evolution of aging: Testing the
theory using Drosophila. Genetica. Springer. https://doi.org/10.1007/BF01435990'
chicago: 'Partridge, Linda, and Nicholas H Barton. “Evolution of Aging: Testing
the Theory Using Drosophila.” Genetica. Springer, 1993. https://doi.org/10.1007/BF01435990.'
ieee: 'L. Partridge and N. H. Barton, “Evolution of aging: Testing the theory using
Drosophila,” Genetica, vol. 91, no. 1–3. Springer, pp. 89–98, 1993.'
ista: 'Partridge L, Barton NH. 1993. Evolution of aging: Testing the theory using
Drosophila. Genetica. 91(1–3), 89–98.'
mla: 'Partridge, Linda, and Nicholas H. Barton. “Evolution of Aging: Testing the
Theory Using Drosophila.” Genetica, vol. 91, no. 1–3, Springer, 1993, pp.
89–98, doi:10.1007/BF01435990.'
short: L. Partridge, N.H. Barton, Genetica 91 (1993) 89–98.
date_created: 2018-12-11T12:08:07Z
date_published: 1993-01-01T00:00:00Z
date_updated: 2022-06-02T10:00:56Z
day: '01'
doi: 10.1007/BF01435990
extern: '1'
external_id:
pmid:
- '8125281 '
intvolume: ' 91'
issue: 1-3
language:
- iso: eng
main_file_link:
- url: https://link.springer.com/article/10.1007/BF01435990
month: '01'
oa_version: None
page: 89 - 98
pmid: 1
publication: Genetica
publication_identifier:
issn:
- 0016-6707
publication_status: published
publisher: Springer
publist_id: '1769'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Evolution of aging: Testing the theory using Drosophila'
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 91
year: '1993'
...
---
_id: '4300'
abstract:
- lang: eng
text: 'Evolutionary explanations of ageing fall into two classes. Organisms might
have evolved the optimal life history, in which survival and fertility late in
life are sacrificed for the sake of early reproduction and survival. Alternatively,
the life history might be depressed below this optimal compromise by deleterious
mutations: because selection against late-acting mutations is weaker, these will
impose a greater load on late life. Evidence for the importance of both is emerging,
and unravelling their relative importance presents experimentalists with a major
challenge.'
acknowledgement: We thank B. Charlesworth, T. Chapman. K. Dawson, K. S. Gale. P. Harvey.
A. Kondrashov. J. Maynard Smith, M. J. Morgan, M. Slatkin and M. Turell/ for helpful
comments and C. Roper for providing the data for Fig. 1. Our work was supported
by grants from the NERC and SERC and by the Darwin Trust of Edinburgh.
article_processing_charge: No
article_type: original
author:
- first_name: Linda
full_name: Partridge, Linda
last_name: Partridge
- 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: Partridge L, Barton NH. Optimality, mutation and the evolution of ageing. Nature.
1993;362:305-311. doi:10.1038/362305a0
apa: Partridge, L., & Barton, N. H. (1993). Optimality, mutation and the evolution
of ageing. Nature. Nature Publishing Group. https://doi.org/10.1038/362305a0
chicago: Partridge, Linda, and Nicholas H Barton. “Optimality, Mutation and the
Evolution of Ageing.” Nature. Nature Publishing Group, 1993. https://doi.org/10.1038/362305a0.
ieee: L. Partridge and N. H. Barton, “Optimality, mutation and the evolution of
ageing,” Nature, vol. 362. Nature Publishing Group, pp. 305–311, 1993.
ista: Partridge L, Barton NH. 1993. Optimality, mutation and the evolution of ageing.
Nature. 362, 305–311.
mla: Partridge, Linda, and Nicholas H. Barton. “Optimality, Mutation and the Evolution
of Ageing.” Nature, vol. 362, Nature Publishing Group, 1993, pp. 305–11,
doi:10.1038/362305a0.
short: L. Partridge, N.H. Barton, Nature 362 (1993) 305–311.
date_created: 2018-12-11T12:08:07Z
date_published: 1993-03-25T00:00:00Z
date_updated: 2022-03-24T12:22:38Z
day: '25'
doi: 10.1038/362305a0
extern: '1'
external_id:
pmid:
- '8455716'
intvolume: ' 362'
language:
- iso: eng
main_file_link:
- url: https://www.nature.com/articles/362305a0
month: '03'
oa_version: None
page: 305 - 311
pmid: 1
publication: Nature
publication_identifier:
issn:
- 0028-0836
publication_status: published
publisher: Nature Publishing Group
publist_id: '1766'
quality_controlled: '1'
status: public
title: Optimality, mutation and the evolution of ageing
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 362
year: '1993'
...
---
_id: '4301'
article_processing_charge: No
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: Katherine
full_name: Gale, Katherine
last_name: Gale
citation:
ama: 'Barton NH, Gale K. Genetic analysis of hybrid zones. In: Harrison R, ed. Hybrid
Zones and the Evolutionary Process. Oxford University Press; 1993:13-45. doi:10.1046/j.1420-9101.1994.7050631.x'
apa: Barton, N. H., & Gale, K. (1993). Genetic analysis of hybrid zones. In
R. Harrison (Ed.), Hybrid zones and the evolutionary process (pp. 13–45).
Oxford University Press. https://doi.org/10.1046/j.1420-9101.1994.7050631.x
chicago: Barton, Nicholas H, and Katherine Gale. “Genetic Analysis of Hybrid Zones.”
In Hybrid Zones and the Evolutionary Process, edited by Richard Harrison,
13–45. Oxford University Press, 1993. https://doi.org/10.1046/j.1420-9101.1994.7050631.x.
ieee: N. H. Barton and K. Gale, “Genetic analysis of hybrid zones,” in Hybrid
zones and the evolutionary process, R. Harrison, Ed. Oxford University Press,
1993, pp. 13–45.
ista: 'Barton NH, Gale K. 1993.Genetic analysis of hybrid zones. In: Hybrid zones
and the evolutionary process. , 13–45.'
mla: Barton, Nicholas H., and Katherine Gale. “Genetic Analysis of Hybrid Zones.”
Hybrid Zones and the Evolutionary Process, edited by Richard Harrison,
Oxford University Press, 1993, pp. 13–45, doi:10.1046/j.1420-9101.1994.7050631.x.
short: N.H. Barton, K. Gale, in:, R. Harrison (Ed.), Hybrid Zones and the Evolutionary
Process, Oxford University Press, 1993, pp. 13–45.
date_created: 2018-12-11T12:08:08Z
date_published: 1993-01-01T00:00:00Z
date_updated: 2022-03-24T10:36:10Z
day: '01'
doi: 10.1046/j.1420-9101.1994.7050631.x
editor:
- first_name: Richard
full_name: Harrison, Richard
last_name: Harrison
extern: '1'
language:
- iso: eng
main_file_link:
- url: https://books.google.at/books?hl=en&lr=&id=aFJFkVKskYIC&oi=fnd&pg=PA13&ots=MFf0ehNeKK&sig=Yp6VrwzCJRB-v-iOhI7WZw-xf8w&redir_esc=y#v=onepage&q&f=false
month: '01'
oa_version: None
page: 13 - 45
publication: Hybrid zones and the evolutionary process
publication_identifier:
isbn:
- ' 0-19-506917-X'
publication_status: published
publisher: Oxford University Press
publist_id: '1764'
quality_controlled: '1'
status: public
title: Genetic analysis of hybrid zones
type: book_chapter
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
year: '1993'
...
---
_id: '4302'
article_processing_charge: No
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. Review of "The causes of molecular evolution"
by J.H. Gillespie. Genetical Research. 1993;62(1):77-85. doi:10.1017/S001667230003158X
apa: Barton, N. H. (1993). Review of "The causes of molecular evolution"
by J.H. Gillespie. Genetical Research. Cambridge University Press. https://doi.org/10.1017/S001667230003158X
chicago: Barton, Nicholas H. “Review of "The Causes of Molecular Evolution"
by J.H. Gillespie.” Genetical Research. Cambridge University Press, 1993.
https://doi.org/10.1017/S001667230003158X
.
ieee: N. H. Barton, “Review of "The causes of molecular evolution"
by J.H. Gillespie,” Genetical Research, vol. 62, no. 1. Cambridge University
Press, pp. 77–85, 1993.
ista: Barton NH. 1993. Review of "The causes of molecular evolution"
by J.H. Gillespie. Genetical Research. 62(1), 77–85.
mla: Barton, Nicholas H. “Review of "The Causes of Molecular Evolution"
by J.H. Gillespie.” Genetical Research, vol. 62, no. 1, Cambridge University
Press, 1993, pp. 77–85, doi:10.1017/S001667230003158X .
short: N.H. Barton, Genetical Research 62 (1993) 77–85.
date_created: 2018-12-11T12:08:08Z
date_published: 1993-01-01T00:00:00Z
date_updated: 2022-03-23T16:05:31Z
day: '01'
doi: '10.1017/S001667230003158X '
extern: '1'
intvolume: ' 62'
issue: '1'
language:
- iso: eng
main_file_link:
- url: https://www.cambridge.org/core/journals/genetics-research/article/causes-of-molecular-evolution-by-john-h-gillespie-oxford-university-press-1992-336-pages-price-2500-isbn-0-19-506883-1/FF2B56D0B883F340BEC4E3C068F89F6C
month: '01'
oa_version: None
page: 77 - 85
publication: Genetical Research
publication_identifier:
issn:
- 0016-6723
publication_status: published
publisher: Cambridge University Press
publist_id: '1763'
quality_controlled: '1'
status: public
title: Review of "The causes of molecular evolution" by J.H. Gillespie
type: review
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 62
year: '1993'
...
---
_id: '4303'
abstract:
- lang: eng
text: In a stably subdivided population with symmetric migration, the chance that
a favoured allele will be fixed is independent of population structure. However,
random extinction introduces an extra component of sampling drift, and reduces
the probability of fixation. In this paper, the fixation probability is calculated
using the diffusion approximation; comparison with exact solution of the discrete
model shows this to be accurate. The key parameters are the rates of selection,
migration and extinction, scaled relative to population size (S = 4Ns, M = 4Nm,
Λ = 4Nλ); results apply to a haploid model, or to diploids with additive selection.
If new colonies derive from many demes, the fixation probability cannot be reduced
by more than half. However, if colonies are initially homogeneous, fixation probability
can be much reduced. In the limit of low migration and extinction rates (M, Λ
1), it is 2s/{1 + (Λ/MS)(1 −exp(−S))}, whilst in the opposite limit (S 1), it
is 4sM/{Λ(Λ + M)}. In the limit of weak selection (M, Λ 1), it is 4sM/{Λ(Λ +
M)}. These factors are not the same as the reduction in effective population size
(Ne/N), showing that the effects of population structure on selected alleles cannot
be understood from the behaviour of neutral markers.
acknowledgement: This work was supported by grants from the SERC (GR/H/09928) and
NERC (GR/3/8002), and by the Darwin Trust of Edinburgh. Thanks are due to B. Nürnberger
for convincing me that population structure does reduce fixation probability, to
M. Whitlock for discussions on calculations of effective population size, and to
W. G. Hill, P. Keightley and the anonymous referees for their comments.
article_processing_charge: No
article_type: original
author:
- first_name: Nicholas H
full_name: Barton, Nicholas H
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
citation:
ama: Barton NH. The probability of fixation of a favoured allele in a subdivided
population. Genetics Research. 1993;62(2):149-158. doi:10.1017/S0016672300031748
apa: Barton, N. H. (1993). The probability of fixation of a favoured allele in a
subdivided population. Genetics Research. Cambridge University Press. https://doi.org/10.1017/S0016672300031748
chicago: Barton, Nicholas H. “The Probability of Fixation of a Favoured Allele in
a Subdivided Population.” Genetics Research. Cambridge University Press,
1993. https://doi.org/10.1017/S0016672300031748.
ieee: N. H. Barton, “The probability of fixation of a favoured allele in a subdivided
population,” Genetics Research, vol. 62, no. 2. Cambridge University Press,
pp. 149–158, 1993.
ista: Barton NH. 1993. The probability of fixation of a favoured allele in a subdivided
population. Genetics Research. 62(2), 149–158.
mla: Barton, Nicholas H. “The Probability of Fixation of a Favoured Allele in a
Subdivided Population.” Genetics Research, vol. 62, no. 2, Cambridge University
Press, 1993, pp. 149–58, doi:10.1017/S0016672300031748.
short: N.H. Barton, Genetics Research 62 (1993) 149–158.
date_created: 2018-12-11T12:08:09Z
date_published: 1993-10-01T00:00:00Z
date_updated: 2022-03-23T15:41:32Z
day: '01'
doi: 10.1017/S0016672300031748
extern: '1'
intvolume: ' 62'
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.cambridge.org/core/journals/genetics-research/article/probability-of-fixation-of-a-favoured-allele-in-a-subdivided-population/3257B4AEC7044AFE40436C2DC15FBC4C#article
month: '10'
oa: 1
oa_version: None
page: 149 - 158
publication: Genetics Research
publication_identifier:
issn:
- 0016-6723
publication_status: published
publisher: Cambridge University Press
publist_id: '1762'
quality_controlled: '1'
scopus_import: '1'
status: public
title: The probability of fixation of a favoured allele in a subdivided population
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 62
year: '1993'
...
---
_id: '4304'
article_processing_charge: No
article_type: letter_note
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. Why species and subspecies? Current Biology. 1993;3(11):797-799.
doi:10.1016/0960-9822(93)90036-N
apa: Barton, N. H. (1993). Why species and subspecies? Current Biology. Cell
Press. https://doi.org/10.1016/0960-9822(93)90036-N
chicago: Barton, Nicholas H. “Why Species and Subspecies?” Current Biology.
Cell Press, 1993. https://doi.org/10.1016/0960-9822(93)90036-N.
ieee: N. H. Barton, “Why species and subspecies?,” Current Biology, vol.
3, no. 11. Cell Press, pp. 797–799, 1993.
ista: Barton NH. 1993. Why species and subspecies? Current Biology. 3(11), 797–799.
mla: Barton, Nicholas H. “Why Species and Subspecies?” Current Biology, vol.
3, no. 11, Cell Press, 1993, pp. 797–99, doi:10.1016/0960-9822(93)90036-N.
short: N.H. Barton, Current Biology 3 (1993) 797–799.
date_created: 2018-12-11T12:08:09Z
date_published: 1993-11-01T00:00:00Z
date_updated: 2022-03-23T13:19:21Z
day: '01'
doi: 10.1016/0960-9822(93)90036-N
extern: '1'
intvolume: ' 3'
issue: '11'
language:
- iso: eng
main_file_link:
- url: https://www.sciencedirect.com/science/article/pii/096098229390036N?via%3Dihub
month: '11'
oa_version: None
page: 797 - 799
publication: Current Biology
publication_identifier:
issn:
- 0960-9822
publication_status: published
publisher: Cell Press
publist_id: '1761'
quality_controlled: '1'
status: public
title: Why species and subspecies?
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 3
year: '1993'
...
---
_id: '4506'
abstract:
- lang: eng
text: We propose a formal framework for designing hybrid systems by stepwise refinement.
Starting with a specification in hybrid temporal logic, we make successively more
transitions explicit until we obtain an executable system.
acknowledgement: This research was supported in part by the National Science Foundation
under grants CCR-92-00794 and CCR-92-23226, by the Defense Advanced Research Projects
Agency under contract NAG2-703, by the United States Air Force Office of Scientific
Research under contracts F49620-93-1-0056 and F49620-93-1-0139, and by the European
Community ESPRIT Basic Research Action Project 6021 (REACT).
alternative_title:
- LNCS
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. Towards refining temporal specifications
into hybrid systems. In: Grossman R, Nerode A, Ravn A, Rischel H, eds. International
Hybrid Systems Workshop. Vol 736. Springer; 1993:60-76. doi:10.1007/3-540-57318-6_24'
apa: Henzinger, T. A., Manna, Z., & Pnueli, A. (1993). Towards refining temporal
specifications into hybrid systems. In R. Grossman, A. Nerode, A. Ravn, &
H. Rischel (Eds.), International Hybrid Systems Workshop (Vol. 736, pp.
60–76). Springer. https://doi.org/10.1007/3-540-57318-6_24
chicago: Henzinger, Thomas A, Zohar Manna, and Amir Pnueli. “Towards Refining Temporal
Specifications into Hybrid Systems.” In International Hybrid Systems Workshop,
edited by Robert Grossman, Anil Nerode, Anders Ravn, and Hans Rischel, 736:60–76.
Springer, 1993. https://doi.org/10.1007/3-540-57318-6_24.
ieee: T. A. Henzinger, Z. Manna, and A. Pnueli, “Towards refining temporal specifications
into hybrid systems,” in International Hybrid Systems Workshop, 1993, vol.
736, pp. 60–76.
ista: Henzinger TA, Manna Z, Pnueli A. 1993. Towards refining temporal specifications
into hybrid systems. International Hybrid Systems Workshop. International Hybrid
Systems Workshop, LNCS, vol. 736, 60–76.
mla: Henzinger, Thomas A., et al. “Towards Refining Temporal Specifications into
Hybrid Systems.” International Hybrid Systems Workshop, edited by Robert
Grossman et al., vol. 736, Springer, 1993, pp. 60–76, doi:10.1007/3-540-57318-6_24.
short: T.A. Henzinger, Z. Manna, A. Pnueli, in:, R. Grossman, A. Nerode, A. Ravn,
H. Rischel (Eds.), International Hybrid Systems Workshop, Springer, 1993, pp.
60–76.
conference:
name: International Hybrid Systems Workshop
date_created: 2018-12-11T12:09:12Z
date_published: 1993-01-01T00:00:00Z
date_updated: 2022-03-23T13:13:46Z
day: '01'
doi: 10.1007/3-540-57318-6_24
editor:
- first_name: Robert
full_name: Grossman, Robert
last_name: Grossman
- first_name: Anil
full_name: Nerode, Anil
last_name: Nerode
- first_name: Anders
full_name: Ravn, Anders
last_name: Ravn
- first_name: Hans
full_name: Rischel, Hans
last_name: Rischel
extern: '1'
intvolume: ' 736'
language:
- iso: eng
main_file_link:
- url: https://link.springer.com/chapter/10.1007/3-540-57318-6_24
month: '01'
oa_version: None
page: 60 - 76
publication: International Hybrid Systems Workshop
publication_identifier:
isbn:
- 978-3-540-57318-0
publication_status: published
publisher: Springer
publist_id: '225'
quality_controlled: '1'
status: public
title: Towards refining temporal specifications into hybrid systems
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 736
year: '1993'
...
---
_id: '4589'
abstract:
- lang: eng
text: "The theory of the natural numbers with linear order and monadic predicates
underlies propositional linear temporal logic. To study temporal logics that are
suitable for reasoning about real-time systems, we combine this classical theory
of infinite state sequences with a theory of discrete time, via a monotonic function
that maps every state to its time. The resulting theory of timed state sequences
is shown to be decidable, albeit nonelementary, and its expressive power is characterized
by ω-regular sets. Several more expressive variants are proved to be highly undecidable.
This framework allows us to classify a wide variety of real-time logics according
to their complexity and expressiveness. Indeed, it follows that most formalisms
proposed in the literature cannot be decided. We are, however, able to identify
two elementary real-time temporal logics as expressively complete fragments of
the theory of timed state sequences, and we present tableau-based decision procedures
for checking validity. Consequently, these two formalisms are well-suited for
the specification and verification of real-time systems.\r\n\r\nCopyright © 1993
Academic Press. All rights reserved."
acknowledgement: We thank David Dill, Zohar Manna, and Amir Pnueli for helpful discussion.
article_processing_charge: No
article_type: original
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. Real-time logics: Complexity and expressiveness. Information
and Computation. 1993;104(1):35-77. doi:10.1006/inco.1993.1025'
apa: 'Alur, R., & Henzinger, T. A. (1993). Real-time logics: Complexity and
expressiveness. Information and Computation. Elsevier. https://doi.org/10.1006/inco.1993.1025'
chicago: 'Alur, Rajeev, and Thomas A Henzinger. “Real-Time Logics: Complexity and
Expressiveness.” Information and Computation. Elsevier, 1993. https://doi.org/10.1006/inco.1993.1025.'
ieee: 'R. Alur and T. A. Henzinger, “Real-time logics: Complexity and expressiveness,”
Information and Computation, vol. 104, no. 1. Elsevier, pp. 35–77, 1993.'
ista: 'Alur R, Henzinger TA. 1993. Real-time logics: Complexity and expressiveness.
Information and Computation. 104(1), 35–77.'
mla: 'Alur, Rajeev, and Thomas A. Henzinger. “Real-Time Logics: Complexity and Expressiveness.”
Information and Computation, vol. 104, no. 1, Elsevier, 1993, pp. 35–77,
doi:10.1006/inco.1993.1025.'
short: R. Alur, T.A. Henzinger, Information and Computation 104 (1993) 35–77.
date_created: 2018-12-11T12:09:38Z
date_published: 1993-05-01T00:00:00Z
date_updated: 2022-03-23T13:08:27Z
day: '01'
doi: 10.1006/inco.1993.1025
extern: '1'
intvolume: ' 104'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.sciencedirect.com/science/article/pii/S0890540183710254?via%3Dihub
month: '05'
oa: 1
oa_version: Published Version
page: 35 - 77
publication: Information and Computation
publication_identifier:
eissn:
- 0890-5401
publication_status: published
publisher: Elsevier
publist_id: '116'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Real-time logics: Complexity and expressiveness'
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 104
year: '1993'
...