---
_id: '4111'
abstract:
- lang: eng
text: 'This paper describes an optimal solution for the following geometric search
problem defined for a set P of n points in three dimensions: Given a plane h with
all points of P on one side and a line ℓ in h, determine a point of P that is
hit first when h is rotated around ℓ. The solution takes O(n) space and O(log
n) time for a query. By use of geometric transforms, the post-office problem for
a finite set of points in two dimensions and certain two-dimensional point location
problems are reduced to the former problem and thus also optimally solved.'
acknowledgement: "Research reported in this paper was partially supported by the Austrian
Fonds zur Förderung tier wissenschaftlichen\r\nForschung. \r\n"
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: Hermann
full_name: Maurer, Hermann
last_name: Maurer
citation:
ama: Edelsbrunner H, Maurer H. Finding extreme-points in 3-dimensions and solving
the post-office problem in the plane. Information Processing Letters. 1985;21(1):39-47.
doi:10.1016/0020-0190(85)90107-3
apa: Edelsbrunner, H., & Maurer, H. (1985). Finding extreme-points in 3-dimensions
and solving the post-office problem in the plane. Information Processing Letters.
Elsevier. https://doi.org/10.1016/0020-0190(85)90107-3
chicago: Edelsbrunner, Herbert, and Hermann Maurer. “Finding Extreme-Points in 3-Dimensions
and Solving the Post-Office Problem in the Plane.” Information Processing Letters.
Elsevier, 1985. https://doi.org/10.1016/0020-0190(85)90107-3.
ieee: H. Edelsbrunner and H. Maurer, “Finding extreme-points in 3-dimensions and
solving the post-office problem in the plane,” Information Processing Letters,
vol. 21, no. 1. Elsevier, pp. 39–47, 1985.
ista: Edelsbrunner H, Maurer H. 1985. Finding extreme-points in 3-dimensions and
solving the post-office problem in the plane. Information Processing Letters.
21(1), 39–47.
mla: Edelsbrunner, Herbert, and Hermann Maurer. “Finding Extreme-Points in 3-Dimensions
and Solving the Post-Office Problem in the Plane.” Information Processing Letters,
vol. 21, no. 1, Elsevier, 1985, pp. 39–47, doi:10.1016/0020-0190(85)90107-3.
short: H. Edelsbrunner, H. Maurer, Information Processing Letters 21 (1985) 39–47.
date_created: 2018-12-11T12:07:00Z
date_published: 1985-07-10T00:00:00Z
date_updated: 2022-01-31T12:49:12Z
day: '10'
doi: 10.1016/0020-0190(85)90107-3
extern: '1'
intvolume: ' 21'
issue: '1'
language:
- iso: eng
month: '07'
oa_version: None
page: 39 - 47
publication: Information Processing Letters
publication_identifier:
eissn:
- 1872-6119
issn:
- 0020-0190
publication_status: published
publisher: Elsevier
publist_id: '2009'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Finding extreme-points in 3-dimensions and solving the post-office problem
in the plane
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 21
year: '1985'
...
---
_id: '4112'
abstract:
- lang: eng
text: 'The batched static version of a searching problem asks for performing a given
set of queries on a given set of objects. All queries are known in advance. The
batched dynamic version of a searching problem is the following: given a sequence
of insertions, deletions, and queries, perform them on an initially empty set.
We will develop methods for solving batched static and batched dynamic versions
of searching problems which are in particular applicable to decomposable searching
problems. The techniques show that batched static (dynamic) versions of searching
problems can often be solved more efficiently than by using known static (dynamic)
data structures. In particular, a technique called “streaming” is described that
reduces the space requirements considerably. The methods have also a number of
applications on set problems. E.g., the k intersecting pairs in a set of n axis-parallel
hyper-rectangles in d dimensions can be reported in O (nlogd−1n + k) time using
only O(n) space.'
acknowledgement: "Research reported in this paper was done while the second author
visited the University of Graz. The first author was supported by the Austrian Fonds
zur Förderung der Wissenschaftlichen Forschung. The second author was supported
by the Netherlands Organization for the Advancement of Pure Research (ZWO). \r\n"
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: Mark
full_name: Overmars, Mark
last_name: Overmars
citation:
ama: Edelsbrunner H, Overmars M. Batched dynamic solutions to decomposable searching
problems. Journal of Algorithms. 1985;6(4):515-542. doi:10.1016/0196-6774(85)90030-6
apa: Edelsbrunner, H., & Overmars, M. (1985). Batched dynamic solutions to decomposable
searching problems. Journal of Algorithms. Elsevier. https://doi.org/10.1016/0196-6774(85)90030-6
chicago: Edelsbrunner, Herbert, and Mark Overmars. “Batched Dynamic Solutions to
Decomposable Searching Problems.” Journal of Algorithms. Elsevier, 1985.
https://doi.org/10.1016/0196-6774(85)90030-6.
ieee: H. Edelsbrunner and M. Overmars, “Batched dynamic solutions to decomposable
searching problems,” Journal of Algorithms, vol. 6, no. 4. Elsevier, pp.
515–542, 1985.
ista: Edelsbrunner H, Overmars M. 1985. Batched dynamic solutions to decomposable
searching problems. Journal of Algorithms. 6(4), 515–542.
mla: Edelsbrunner, Herbert, and Mark Overmars. “Batched Dynamic Solutions to Decomposable
Searching Problems.” Journal of Algorithms, vol. 6, no. 4, Elsevier, 1985,
pp. 515–42, doi:10.1016/0196-6774(85)90030-6.
short: H. Edelsbrunner, M. Overmars, Journal of Algorithms 6 (1985) 515–542.
date_created: 2018-12-11T12:07:00Z
date_published: 1985-12-01T00:00:00Z
date_updated: 2022-01-31T13:36:56Z
day: '01'
doi: 10.1016/0196-6774(85)90030-6
extern: '1'
intvolume: ' 6'
issue: '4'
language:
- iso: eng
month: '12'
oa_version: None
page: 515 - 542
publication: Journal of Algorithms
publication_identifier:
eissn:
- 1090-2678
issn:
- 0196-6774
publication_status: published
publisher: Elsevier
publist_id: '2010'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Batched dynamic solutions to decomposable searching problems
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 6
year: '1985'
...
---
_id: '4113'
abstract:
- lang: eng
text: Let S denote a set of n points in the Euclidean plane. A subset S′ of S is
termed a k-set of S if it contains k points and there exists a straight line which
has no point of S on it and separates S′ from S−S′. We let fk(n) denote the maximum
number of k-sets which can be realized by a set of n points. This paper studies
the asymptotic behaviour of fk(n) as this function has applications to a number
of problems in computational geometry. A lower and an upper bound on fk(n) is
established. Both are nontrivial and improve bounds known before. In particular, is
shown by exhibiting special point-sets which realize that many k-sets. In addition, is
proved by the study of a combinatorial problem which is of interest in its own
right.
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: Emo
full_name: Welzl, Emo
last_name: Welzl
citation:
ama: Edelsbrunner H, Welzl E. On the number of line separations of a finite set
in the plane. Journal of Combinatorial Theory Series A. 1985;38(1):15-29.
doi:10.1016/0097-3165(85)90017-2
apa: Edelsbrunner, H., & Welzl, E. (1985). On the number of line separations
of a finite set in the plane. Journal of Combinatorial Theory Series A.
Elsevier. https://doi.org/10.1016/0097-3165(85)90017-2
chicago: Edelsbrunner, Herbert, and Emo Welzl. “On the Number of Line Separations
of a Finite Set in the Plane.” Journal of Combinatorial Theory Series A.
Elsevier, 1985. https://doi.org/10.1016/0097-3165(85)90017-2.
ieee: H. Edelsbrunner and E. Welzl, “On the number of line separations of a finite
set in the plane,” Journal of Combinatorial Theory Series A, vol. 38, no.
1. Elsevier, pp. 15–29, 1985.
ista: Edelsbrunner H, Welzl E. 1985. On the number of line separations of a finite
set in the plane. Journal of Combinatorial Theory Series A. 38(1), 15–29.
mla: Edelsbrunner, Herbert, and Emo Welzl. “On the Number of Line Separations of
a Finite Set in the Plane.” Journal of Combinatorial Theory Series A, vol.
38, no. 1, Elsevier, 1985, pp. 15–29, doi:10.1016/0097-3165(85)90017-2.
short: H. Edelsbrunner, E. Welzl, Journal of Combinatorial Theory Series A 38 (1985)
15–29.
date_created: 2018-12-11T12:07:01Z
date_published: 1985-01-01T00:00:00Z
date_updated: 2022-01-31T14:14:25Z
day: '01'
doi: 10.1016/0097-3165(85)90017-2
extern: '1'
intvolume: ' 38'
issue: '1'
language:
- iso: eng
month: '01'
oa_version: None
page: 15 - 29
publication: Journal of Combinatorial Theory Series A
publication_identifier:
eissn:
- 1096-0899
issn:
- 0097-3165
publication_status: published
publisher: Elsevier
publist_id: '2011'
quality_controlled: '1'
scopus_import: '1'
status: public
title: On the number of line separations of a finite set in the plane
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 38
year: '1985'
...
---
_id: '4114'
abstract:
- lang: eng
text: Proportional link linkage (PLL) clustering methods are a parametric family
of monotone invariant agglomerative hierarchical clustering methods. This family
includes the single, minimedian, and complete linkage clustering methods as special
cases; its members are used in psychological and ecological applications. Since
the literature on clustering space distortion is oriented to quantitative input
data, we adapt its basic concepts to input data with only ordinal significance
and analyze the space distortion properties of PLL methods. To enable PLL methods
to be used when the numbern of objects being clustered is large, we describe an
efficient PLL algorithm that operates inO(n 2 logn) time andO(n 2) space
acknowledgement: This work was partially supported by the Natural Sciences and Engineering
Research Council of Canada and by the Austrian Fonds zur Förderung der wissenschaftlichen
Forschung.
article_processing_charge: No
article_type: original
author:
- first_name: William
full_name: Day, William
last_name: Day
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
citation:
ama: Day W, Edelsbrunner H. Investigation of Proportional Link Linkage Clustering
Methods. Journal of Classification. 1985;2(2-3):239-254. doi:10.1007/BF01908077
apa: Day, W., & Edelsbrunner, H. (1985). Investigation of Proportional Link
Linkage Clustering Methods. Journal of Classification. Springer. https://doi.org/10.1007/BF01908077
chicago: Day, William, and Herbert Edelsbrunner. “Investigation of Proportional
Link Linkage Clustering Methods.” Journal of Classification. Springer,
1985. https://doi.org/10.1007/BF01908077.
ieee: W. Day and H. Edelsbrunner, “Investigation of Proportional Link Linkage Clustering
Methods,” Journal of Classification, vol. 2, no. 2–3. Springer, pp. 239–254,
1985.
ista: Day W, Edelsbrunner H. 1985. Investigation of Proportional Link Linkage Clustering
Methods. Journal of Classification. 2(2–3), 239–254.
mla: Day, William, and Herbert Edelsbrunner. “Investigation of Proportional Link
Linkage Clustering Methods.” Journal of Classification, vol. 2, no. 2–3,
Springer, 1985, pp. 239–54, doi:10.1007/BF01908077.
short: W. Day, H. Edelsbrunner, Journal of Classification 2 (1985) 239–254.
date_created: 2018-12-11T12:07:01Z
date_published: 1985-12-01T00:00:00Z
date_updated: 2022-01-31T10:37:13Z
day: '01'
doi: 10.1007/BF01908077
extern: '1'
intvolume: ' 2'
issue: 2-3
language:
- iso: eng
month: '12'
oa_version: None
page: 239 - 254
publication: Journal of Classification
publication_identifier:
eissn:
- 1432-1343
issn:
- 0176-4268
publication_status: published
publisher: Springer
publist_id: '2006'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Investigation of Proportional Link Linkage Clustering Methods
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 2
year: '1985'
...
---
_id: '4115'
abstract:
- lang: eng
text: A polygon in the plane is convex if it contains all line segments connecting
any two of its points. Let P and Q denote two convex polygons. The computational
complexity of finding the minimum and maximum distance possible between two points
p in P and q in Q is studied. An algorithm is described that determines the minimum
distance (together with points p and q that realize it) in O(logm + logn) time,
where m and n denote the number of vertices of P and Q, respectively. This is
optimal in the worst case. For computing the maximum distance, a lower bound Ω(m
+ n) is proved. This bound is also shown to be best possible by establishing an
upper bound of O(m + n).
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. Computing the extreme distances between two convex polygons.
Journal of Algorithms. 1985;6(2):213-224. doi:10.1016/0196-6774(85)90039-2
apa: Edelsbrunner, H. (1985). Computing the extreme distances between two convex
polygons. Journal of Algorithms. Academic Press. https://doi.org/10.1016/0196-6774(85)90039-2
chicago: Edelsbrunner, Herbert. “Computing the Extreme Distances between Two Convex
Polygons.” Journal of Algorithms. Academic Press, 1985. https://doi.org/10.1016/0196-6774(85)90039-2.
ieee: H. Edelsbrunner, “Computing the extreme distances between two convex polygons,”
Journal of Algorithms, vol. 6, no. 2. Academic Press, pp. 213–224, 1985.
ista: Edelsbrunner H. 1985. Computing the extreme distances between two convex polygons.
Journal of Algorithms. 6(2), 213–224.
mla: Edelsbrunner, Herbert. “Computing the Extreme Distances between Two Convex
Polygons.” Journal of Algorithms, vol. 6, no. 2, Academic Press, 1985,
pp. 213–24, doi:10.1016/0196-6774(85)90039-2.
short: H. Edelsbrunner, Journal of Algorithms 6 (1985) 213–224.
date_created: 2018-12-11T12:07:01Z
date_published: 1985-06-01T00:00:00Z
date_updated: 2022-01-31T10:44:41Z
day: '01'
doi: 10.1016/0196-6774(85)90039-2
extern: '1'
intvolume: ' 6'
issue: '2'
language:
- iso: eng
month: '06'
oa_version: None
page: 213 - 224
publication: Journal of Algorithms
publication_identifier:
eissn:
- 1090-2678
issn:
- 0196-6774
publication_status: published
publisher: Academic Press
publist_id: '2007'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Computing the extreme distances between two convex polygons
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 6
year: '1985'
...
---
_id: '4116'
abstract:
- lang: eng
text: 'A straight line that intersects all members of a set S of objects in the
real plane is called a transversal of S. Geometric transforms are described that
reduce transversal problems for various types of objects to convex hull problems
for points. These reductions lead to efficient algorithms for finding transversals
which are also described. Applications of the algorithms are found in computer
graphics: “Reproduce the line displayed by a collection of pixels”, and in statistics:
“Find the line that minimizes the maximum distance from a collection of (weighted)
points in the plane”.'
acknowledgement: 'The author gratefully acknowledges the criticism of an anonymous
referee who discovered a serious flaw in an earlier version 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
citation:
ama: Edelsbrunner H. Finding Transversals for Sets of Simple Geometric-Figures.
Theoretical Computer Science. 1985;35(1):55-69. doi:10.1016/0304-3975(85)90005-2
apa: Edelsbrunner, H. (1985). Finding Transversals for Sets of Simple Geometric-Figures.
Theoretical Computer Science. Elsevier. https://doi.org/10.1016/0304-3975(85)90005-2
chicago: Edelsbrunner, Herbert. “Finding Transversals for Sets of Simple Geometric-Figures.”
Theoretical Computer Science. Elsevier, 1985. https://doi.org/10.1016/0304-3975(85)90005-2.
ieee: H. Edelsbrunner, “Finding Transversals for Sets of Simple Geometric-Figures,”
Theoretical Computer Science, vol. 35, no. 1. Elsevier, pp. 55–69, 1985.
ista: Edelsbrunner H. 1985. Finding Transversals for Sets of Simple Geometric-Figures.
Theoretical Computer Science. 35(1), 55–69.
mla: Edelsbrunner, Herbert. “Finding Transversals for Sets of Simple Geometric-Figures.”
Theoretical Computer Science, vol. 35, no. 1, Elsevier, 1985, pp. 55–69,
doi:10.1016/0304-3975(85)90005-2.
short: H. Edelsbrunner, Theoretical Computer Science 35 (1985) 55–69.
date_created: 2018-12-11T12:07:02Z
date_published: 1985-01-01T00:00:00Z
date_updated: 2022-01-31T11:09:26Z
day: '01'
doi: 10.1016/0304-3975(85)90005-2
extern: '1'
intvolume: ' 35'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.sciencedirect.com/science/article/pii/0304397585900052?via%3Dihub
month: '01'
oa: 1
oa_version: Published Version
page: 55 - 69
publication: Theoretical Computer Science
publication_identifier:
eissn:
- 0304-3975
issn:
- 0304-3975
publication_status: published
publisher: Elsevier
publist_id: '2008'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Finding Transversals for Sets of Simple Geometric-Figures
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 35
year: '1985'
...
---
_id: '4120'
abstract:
- lang: eng
text: 'Let P be a set of n points in the Euclidean plane and let C be a convex figure.
We study the problem of preprocessing P so that for any query point q, the points
of P in C+q can be retrieved efficiently. If constant time sumces for deciding
the inclusion of a point in C, we then demonstrate the existence of an optimal
solution: the algorithm requires O(n) space and O(k + log n) time for a query
with output size k. If C is a disk, the problem becomes the wellknown fixed-radius
neighbour problem, to which we thus provide the first known optimal solution.'
acknowledgement: The first author was supported i~1 part by NSF grants MCS 83-03925
and the Office of Naval Research and the Defense Advanced Research Projects Agency
under contract N00014-g3-K-0146 and ARPA Order No. 4786.
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
citation:
ama: Chazelle B, Edelsbrunner H. Optimal solutions for a class of point retrieval
problems. Journal of Symbolic Computation. 1985;1(1):47-56. doi:10.1016/S0747-7171(85)80028-6
apa: Chazelle, B., & Edelsbrunner, H. (1985). Optimal solutions for a class
of point retrieval problems. Journal of Symbolic Computation. Elsevier.
https://doi.org/10.1016/S0747-7171(85)80028-6
chicago: Chazelle, Bernard, and Herbert Edelsbrunner. “Optimal Solutions for a Class
of Point Retrieval Problems.” Journal of Symbolic Computation. Elsevier,
1985. https://doi.org/10.1016/S0747-7171(85)80028-6.
ieee: B. Chazelle and H. Edelsbrunner, “Optimal solutions for a class of point retrieval
problems,” Journal of Symbolic Computation, vol. 1, no. 1. Elsevier, pp.
47–56, 1985.
ista: Chazelle B, Edelsbrunner H. 1985. Optimal solutions for a class of point retrieval
problems. Journal of Symbolic Computation. 1(1), 47–56.
mla: Chazelle, Bernard, and Herbert Edelsbrunner. “Optimal Solutions for a Class
of Point Retrieval Problems.” Journal of Symbolic Computation, vol. 1,
no. 1, Elsevier, 1985, pp. 47–56, doi:10.1016/S0747-7171(85)80028-6.
short: B. Chazelle, H. Edelsbrunner, Journal of Symbolic Computation 1 (1985) 47–56.
date_created: 2018-12-11T12:07:03Z
date_published: 1985-03-01T00:00:00Z
date_updated: 2022-01-31T09:20:18Z
day: '01'
doi: 10.1016/S0747-7171(85)80028-6
extern: '1'
intvolume: ' 1'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.sciencedirect.com/science/article/pii/S0747717185800286?via%3Dihub
month: '03'
oa: 1
oa_version: Published Version
page: 47 - 56
publication: Journal of Symbolic Computation
publication_identifier:
eissn:
- 1095-855X
issn:
- 0747-7171
publication_status: published
publisher: Elsevier
publist_id: '2004'
quality_controlled: '1'
status: public
title: Optimal solutions for a class of point retrieval problems
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 1
year: '1985'
...
---
_id: '4241'
alternative_title:
- 'Progress in leukocyte biology '
article_processing_charge: No
author:
- first_name: C.
full_name: Curtis, C.
last_name: Curtis
- first_name: J.
full_name: Curtis, J.
last_name: Curtis
- 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: 'Curtis C, Curtis J, Barton NH. Methodology for testing the hypothesis of single
locus control of host resistance to infection and malignancy. In: Skamene E, ed.
Genetic Control of Host Resistance to Infection and Malignancy. Vol 3.
Progress in leukocyte biology. Liss; 1985.'
apa: Curtis, C., Curtis, J., & Barton, N. H. (1985). Methodology for testing
the hypothesis of single locus control of host resistance to infection and malignancy.
In E. Skamene (Ed.), Genetic Control of Host Resistance to Infection and Malignancy
(Vol. 3). Liss.
chicago: Curtis, C., J. Curtis, and Nicholas H Barton. “Methodology for Testing
the Hypothesis of Single Locus Control of Host Resistance to Infection and Malignancy.”
In Genetic Control of Host Resistance to Infection and Malignancy, edited
by Emil Skamene, Vol. 3. Progress in Leukocyte Biology. Liss, 1985.
ieee: C. Curtis, J. Curtis, and N. H. Barton, “Methodology for testing the hypothesis
of single locus control of host resistance to infection and malignancy,” in Genetic
Control of Host Resistance to Infection and Malignancy, vol. 3, E. Skamene,
Ed. Liss, 1985.
ista: 'Curtis C, Curtis J, Barton NH. 1985.Methodology for testing the hypothesis
of single locus control of host resistance to infection and malignancy. In: Genetic
Control of Host Resistance to Infection and Malignancy. Progress in leukocyte
biology , vol. 3.'
mla: Curtis, C., et al. “Methodology for Testing the Hypothesis of Single Locus
Control of Host Resistance to Infection and Malignancy.” Genetic Control of
Host Resistance to Infection and Malignancy, edited by Emil Skamene, vol.
3, Liss, 1985.
short: C. Curtis, J. Curtis, N.H. Barton, in:, E. Skamene (Ed.), Genetic Control
of Host Resistance to Infection and Malignancy, Liss, 1985.
date_created: 2018-12-11T12:07:48Z
date_published: 1985-01-01T00:00:00Z
date_updated: 2022-02-02T09:23:20Z
day: '01'
editor:
- first_name: Emil
full_name: Skamene, Emil
last_name: Skamene
extern: '1'
intvolume: ' 3'
language:
- iso: eng
month: '01'
oa_version: None
publication: Genetic Control of Host Resistance to Infection and Malignancy
publication_identifier:
isbn:
- '9780845141021'
publication_status: published
publisher: Liss
publist_id: '1872'
quality_controlled: '1'
series_title: Progress in leukocyte biology
status: public
title: Methodology for testing the hypothesis of single locus control of host resistance
to infection and malignancy
type: book_chapter
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 3
year: '1985'
...
---
_id: '4325'
article_processing_charge: No
article_type: original
author:
- first_name: Steve
full_name: Jones, Steve
last_name: Jones
- 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: Jones S, Barton NH. Haldane’s Rule OK. Nature. 1985;314:668-668. doi:10.1038/314668a0
apa: Jones, S., & Barton, N. H. (1985). Haldane’s Rule OK. Nature. Nature
Publishing Group. https://doi.org/10.1038/314668a0
chicago: Jones, Steve, and Nicholas H Barton. “Haldane’s Rule OK.” Nature.
Nature Publishing Group, 1985. https://doi.org/10.1038/314668a0.
ieee: S. Jones and N. H. Barton, “Haldane’s Rule OK,” Nature, vol. 314. Nature
Publishing Group, pp. 668–668, 1985.
ista: Jones S, Barton NH. 1985. Haldane’s Rule OK. Nature. 314, 668–668.
mla: Jones, Steve, and Nicholas H. Barton. “Haldane’s Rule OK.” Nature, vol.
314, Nature Publishing Group, 1985, pp. 668–668, doi:10.1038/314668a0.
short: S. Jones, N.H. Barton, Nature 314 (1985) 668–668.
date_created: 2018-12-11T12:08:16Z
date_published: 1985-04-25T00:00:00Z
date_updated: 2022-01-28T12:42:09Z
day: '25'
doi: 10.1038/314668a0
extern: '1'
external_id:
pmid:
- '3990801'
intvolume: ' 314'
language:
- iso: eng
month: '04'
oa_version: None
page: 668 - 668
pmid: 1
publication: Nature
publication_status: published
publisher: Nature Publishing Group
publist_id: '1716'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Haldane's Rule OK
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 314
year: '1985'
...
---
_id: '4326'
acknowledgement: We thank R. Butlin, D. Currie, R. A. Nichols , and S. Rouhani for
their thoughtful comments on the manuscript, and their help in preparing the Figures
and Tables; all those (too numerous to name) who gave us details of their unpublished
work; and T. Tsang and S. Ward for their patient typing. This work was supported
by grants from the NERC and SERC to G. M. Hewitt, and from the SERC and the Nuffield
Foundation to N. H. Barton.
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: Godfrey
full_name: Hewitt, Godfrey
last_name: Hewitt
citation:
ama: Barton NH, Hewitt G. Analysis of hybrid zones. Annual Review of Ecology
and Systematics. 1985;16:113-148. doi:10.1146/annurev.es.16.110185.000553
apa: Barton, N. H., & Hewitt, G. (1985). Analysis of hybrid zones. Annual
Review of Ecology and Systematics. Annual Reviews. https://doi.org/10.1146/annurev.es.16.110185.000553
chicago: Barton, Nicholas H, and Godfrey Hewitt. “Analysis of Hybrid Zones.” Annual
Review of Ecology and Systematics. Annual Reviews, 1985. https://doi.org/10.1146/annurev.es.16.110185.000553.
ieee: N. H. Barton and G. Hewitt, “Analysis of hybrid zones,” Annual Review of
Ecology and Systematics, vol. 16. Annual Reviews, pp. 113–148, 1985.
ista: Barton NH, Hewitt G. 1985. Analysis of hybrid zones. Annual Review of Ecology
and Systematics. 16, 113–148.
mla: Barton, Nicholas H., and Godfrey Hewitt. “Analysis of Hybrid Zones.” Annual
Review of Ecology and Systematics, vol. 16, Annual Reviews, 1985, pp. 113–48,
doi:10.1146/annurev.es.16.110185.000553.
short: N.H. Barton, G. Hewitt, Annual Review of Ecology and Systematics 16 (1985)
113–148.
date_created: 2018-12-11T12:08:16Z
date_published: 1985-11-01T00:00:00Z
date_updated: 2022-01-28T12:32:23Z
day: '01'
doi: 10.1146/annurev.es.16.110185.000553
extern: '1'
intvolume: ' 16'
language:
- iso: eng
month: '11'
oa_version: None
page: 113 - 148
publication: Annual Review of Ecology and Systematics
publication_identifier:
eissn:
- 1545-2069
issn:
- 0066-4162
publication_status: published
publisher: Annual Reviews
publist_id: '1714'
quality_controlled: '1'
status: public
title: Analysis of hybrid zones
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 16
year: '1985'
...