TY - JOUR
AU - Chazelle, Bernard
AU - Herbert Edelsbrunner
AU - Guibas, Leonidas J
AU - Pollack, Richard
AU - Seidel, Raimund
AU - Sharir, Micha
AU - Snoeyink, Jack
ID - 3581
IS - 6
JF - Computational Geometry: Theory and Applications
TI - Counting and cutting cycles of lines and rods in space
VL - 1
ER -
TY - JOUR
AB - Three components of mating call (pulse duration, cycle length, and fundamental frequency) were measured and six diagnostic enzyme loci scored across the hybrid zone between the toads Bombina bombina and B. variegata. All three call components differ significantly, but only cycle length is diagnostic. The clines in call coincide with those for enzymes, and have similar widths. This suggests that there is no strong selection on any of these characters. There are significant correlations between electrophoretic markers and call components, but these are no stronger than would be expected if the electrophoretic loci and the genes causing mating call were neutral. The selection differential on the call is no greater than 6% of the difference in mean cycle length between the two taxa. There is a substantial increase in the variance of cycle length in the center of the zone, suggesting that a small number of loci are involved (≈ three). Recombination between these loci will hinder the evolution of reinforcement and may partly be responsible for the lack of premating isolation between B. bombina and B. variegata.
AU - Sanderson, Neil
AU - Szymura, Jacek M
AU - Nicholas Barton
ID - 3645
IS - 3
JF - Evolution
TI - Variation in mating call across the hybrid zone between the fire-bellied toads Bombina bombina and B. variegata
VL - 46
ER -
TY - JOUR
AB - 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.
AU - Masu, Masayuki
AU - Tanabe, Yasuto
AU - Tsuchida, Kunihiro
AU - Ryuichi Shigemoto
AU - Nakanishi, Shigetada
ID - 2482
IS - 6312
JF - Nature
TI - Sequence and expression of a metabotropic glutamate receptor
VL - 349
ER -
TY - JOUR
AB - 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.
AU - Moriyoshi, Koki
AU - Masu, Masayuki
AU - Ishii, Takahiro
AU - Ryuichi Shigemoto
AU - Mizuno, Noboru
AU - Nakanishi, Shigetada
ID - 2483
IS - 6348
JF - Nature
TI - Molecular cloning and characterization of the rat NMDA receptor
VL - 353
ER -
TY - JOUR
AB - 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.
AU - Yasui, Yukihiko
AU - Itoh, Kazuo
AU - Kaneko, Takeshi
AU - Ryuichi Shigemoto
AU - Mizuno, Noboru
ID - 2529
IS - 1
JF - Experimental Brain Research
TI - Topographical projections from the cerebral cortex to the nucleus of the solitary tract in the cat
VL - 85
ER -
TY - JOUR
AU - Nakanishi, Shigetada
AU - Ohkubo, Hiroaki
AU - Kakizuka, Akira
AU - Yokota, Yoshifumi
AU - Ryuichi Shigemoto
AU - Sasai, Yoshiki
AU - Takumi, Toru
ID - 2530
IS - 1
JF - Recent Progress in Hormone Research
TI - Molecular characterization of mammalian tachykinin receptors and a possible epithelial potassium channel
VL - 46
ER -
TY - JOUR
AB - An ultra-low dose (10-14 M) of opioid peptide [D-Ala2]methionine enkephalinamide (DAMEA) is found to exert an inhibitory effect on the production of reactive oxygen species (respiratory burst) in human neutrophils. The validity of this phenomenon has been verified in a series of studies that comprised 30 experiments. The inhibition has proved to be statistically significant (P<0.001). The dose-response dependence of the effect (10-15-10-9 M) followed a characteristic biphasic pattern (with the maximum effect at ultra-low doses). An opioid antagonist, naloxone partially blocks the inhibitory effect, which indicates that the DAMEA action is at least partially mediated by opioid receptors.
AU - Zaǐtsev, Sergei V
AU - Leonid Sazanov
AU - Koshkin, Aleksei A
AU - Sud'Ina, Galina F
AU - Varfolomeev, Sergei D
ID - 1946
IS - 1
JF - FEBS Letters
TI - Respiratory burst inhibition in human neutrophils by ultra-low doses of [D-Ala2] methionine enkephalinamide
VL - 291
ER -
TY - CONF
AU - Alur, Rajeev
AU - Feder, Tomás
AU - Thomas Henzinger
ID - 4621
TI - The benefits of relaxing punctuality
ER -
TY - JOUR
AB - An algorithm is presented that constructs the convex hull of a set of n points in three dimensions in worst-case time O(n log2h) and storage O(n), where h is the number of extreme points. This is an improvement of the O(nh) time gift-wrapping algorithm and, for certain values of h, of the O(n log n) time divide-and-conquer algorithm.
AU - Herbert Edelsbrunner
AU - Shi, Weiping
ID - 4051
IS - 2
JF - SIAM Journal on Computing
TI - An O(n log^2 h) time algorithm for the three-dimensional convex hull problem
VL - 20
ER -
TY - JOUR
AB - This paper describes an effective procedure for stratifying a real semi-algebraic set into cells of constant description size. The attractive feature of our method is that the number of cells produced is singly exponential in the number of input variables. This compares favorably with the doubly exponential size of Collins' decomposition. Unlike Collins' construction, however, our scheme does not produce a cell complex but only a smooth stratification. Nevertheless, we are able to apply our results in interesting ways to problems of point location and geometric optimization.
AU - Chazelle, Bernard
AU - Herbert Edelsbrunner
AU - Guibas, Leonidas J
AU - Sharir, Micha
ID - 4052
IS - 1
JF - Theoretical Computer Science
TI - A singly exponential stratification scheme for real semi-algebraic varieties and its applications
VL - 84
ER -
TY - CONF
AB - 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 ge 3, turned out to contain a serious and irreparable error. This paper presents a new proof of the theorem. Our proof is based on an inductive argument, which also applies in the case of pseudo-hyperplane arrangements. We also briefly discuss the fallacies of the old proof along with some ways of partially saving that approach.
AU - Herbert Edelsbrunner
AU - Seidel, Raimund
AU - Sharir, Micha
ID - 4054
TI - On the zone theorem for hyperplane arrangements
VL - 555
ER -
TY - CONF
AB - 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.
AU - Herbert Edelsbrunner
AU - Tan, Tiow Seng
ID - 4055
TI - A quadratic time algorithm for the minmax length triangulation
ER -
TY - JOUR
AB - 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.
AU - Herbert Edelsbrunner
AU - Hajnal, Péter
ID - 4056
IS - 2
JF - Journal of Combinatorial Theory Series A
TI - A lower bound on the number of unit distances between the vertices of a convex polygon
VL - 56
ER -
TY - JOUR
AU - Herbert Edelsbrunner
ID - 4057
IS - 2
JF - Journal of Computer and System Sciences
TI - Corrigendum
VL - 42
ER -
TY - CONF
AB - 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.
AU - Chazelle, Bernard
AU - Herbert Edelsbrunner
AU - Guibas, Leonidas
AU - Sharir, Micha
AU - Snoeyink, Jack
ID - 4058
TI - Computing a face in an arrangement of line segments
ER -
TY - CONF
AB - 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.
AU - Chazelle, Bernard
AU - Herbert Edelsbrunner
AU - Grigni, Michelangelo
AU - Guibas, Leonidas
AU - Hershberger, John
AU - Sharir, Micha
AU - Snoeyink, Jack
ID - 4059
TI - Ray shooting in polygons using geodesic triangulations
VL - 510
ER -
TY - JOUR
AB - 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}.
AU - Agarwal, Pankaj K
AU - Herbert Edelsbrunner
AU - Schwarzkopf, Otfried
AU - Welzl, Emo
ID - 4061
IS - 1
JF - Discrete & Computational Geometry
TI - Euclidean minimum spanning trees and bichromatic closest pairs
VL - 6
ER -
TY - JOUR
AB - 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.
AU - Aronov, Boris
AU - Chazelle, Bernard
AU - Herbert Edelsbrunner
AU - Guibas, Leonidas J
AU - Sharir, Micha
AU - Wenger, Rephael
ID - 4062
IS - 1
JF - Discrete & Computational Geometry
TI - Points and triangles in the plane and halving planes in space
VL - 6
ER -
TY - CONF
AB - 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 ...
AU - Thomas Henzinger
AU - Manna, Zohar
AU - Pnueli,Amir
ID - 4508
TI - Temporal proof methodologies for real-time systems
ER -
TY - THES
AU - Thomas Henzinger
ID - 4516
TI - The Temporal Specification and Verification of Real-time Systems
ER -
TY - JOUR
AU - Alur, Rajeev
AU - Thomas Henzinger
ID - 4592
IS - 3
JF - SIGACT News
TI - Time for logic
VL - 22
ER -
TY - JOUR
AB - Two types of metabolically regulated K channels have been identified for the first time in enzymatically demyelinated fibres of amphibian sciatic nerve using the patch-clamp technique. A maxi K channel with a single-channel conductance of 132 pS (105 mM K on both sides of the membrane, 15°C) is activated both by micromolar concentrations of internal Ca and by depolarization. A second type of K channel with a conductance of 44 pS is inhibited by intracellular adenosine 5'-triphosphate (ATP) with a half-maximal inhibitory concentration (IC50) of 35 μM. It is blocked by submicromolar concentrations of external glibenclamide. Both channels are sensitive to external tetraethylammonium chloride (IC50 = 0.2 mM for the maxi K channel and 4.2 mM for the ATP-sensitive channel). They may be part of a complex feedback system regulating axonal excitability under various metabolic conditions.
AU - Peter Jonas
AU - Koh, Duk S
AU - Kampe, Knut
AU - Hermsteiner, Markus
AU - Vogel, Werner
ID - 3468
IS - 1-2
JF - Pflugers Archiv : European Journal of Physiology
TI - ATP-sensitive and Ca-activated K channels in vertebrate axons: novel links between metabolism and excitability
VL - 418
ER -
TY - CHAP
AU - Herbert Edelsbrunner
AU - Sharir, Micha
ID - 3566
T2 - Applied Geometry and Discrete Mathematics: The Victor Klee Festschrift
TI - A hyperplane incidence problem with applications to counting distances
VL - 4
ER -
TY - CHAP
AU - Herbert Edelsbrunner
ID - 3567
T2 - Discrete & Computational Geometry
TI - Lines in space – A collection of results
VL - 6
ER -
TY - JOUR
AB - We compare the pattern of morphological and electrophoretic variation in the hybrid zone between Bombina bombina and B. variegata across two transects: one near Cracow and one 200 km away, near Przemysl in southeastern Poland. Morphological variation across the Przemysl transect had been surveyed more than 50 years ago; though we found a significant shift at one site, there is no evidence for gross movement over this period. Morphological and electrophoretic changes coincide, and the average shape of the clines is the same across both transects. At the center, most of the change in frequency of six diagnostic allozymes occurs within w = 6.05 km (2-unit support limits 5.56-6.54 km). These steep gradients are generated not by selection on the allozymes themselves, but by associations with other loci: though these markers are unlinked, they are in strong linkage disequilibrium with each other [R = D/ = 0.22 (0.15-0.29) at the center]. Disequilibria are broken up as alleles diffuse away from the zone and flow into the new genetic background. The net barrier to the flow of genes from bombina into variegata, which is generated by these disequilibria, is B = 51 (22-81) km. The fitness of hybrids must be substantially reduced to produce such a barrier [W̄H/W̄P = 0.58 (0.54-0.68)], and this selection must be spread over many loci [N = 55 (26-88)]. Alleles introgress significantly less far than would be expected from the age of the zone and the estimated dispersal rate [σ = 0.99 (0.82-1.14) km gen.-1/2]: this implies selection of se = 0.37 (0.15-0.58)% on the enzymes themselves. There is weak but significant linkage disequilibrium well away from the center of the zone; this, together with the presence of parental and F1 genotypes, suggests some long-range migration. However, such migration is not likely to cause significant introgression.
AU - Szymura, Jacek M
AU - Nicholas Barton
ID - 3646
IS - 2
JF - Evolution
TI - The genetic structure of the hybrid zone between the fire-bellied toads Bombina bombina and B. variegata: comparisons between transects and between loci
VL - 45
ER -
TY - JOUR
AB - A method is developed that describes the effects on an arbitrary number of autosomal loci of selection on haploid and diploid stages, of nonrandom mating between haploid individuals, and of recombination. We provide exact recursions for the dynamics of allele frequencies and linkage disequilibria (nonrandom associations of alleles across loci). When selection is weak relative to recombination, our recursions provide simple approximations for the linkage disequilibria among arbitrary combinations of loci. We show how previous models of sex-independent natural selection on diploids, assortative mating between haploids, and sexual selection on haploids can be analyzed in this framework. Using our weak-selection approximations, we derive new results concerning the coevolution of male traits and female preferences under natural and sexual selection. In particular, we provide general expressions for the intensity of linkage-disequilibrium induced selection experienced by loci that contribute to female preferences for specific male traits. Our general results support the previous observation that these indirect selection forces are so weak that they are unlikely to dominate the evolution of preference-producing loci.
AU - Nicholas Barton
AU - Turelli, Michael
ID - 3647
IS - 1
JF - Genetics
TI - Natural and sexual selection on many loci
VL - 127
ER -
TY - JOUR
AB - We investigate the probability of fixation of a chromosome rearrangement in a subdivided population, concentrating on the limit where migration is so large relative to selection (m ≫ s) that the population can be thought of as being continuously distributed. We study two demes, and one- and two-dimensional populations. For two demes, the probability of fixation in the limit of high migration approximates that of a population with twice the size of a single deme: migration therefore greatly reduces the fixation probability. However, this behavior does not extend to a large array of demes. Then, the fixation probability depends primarily on neighborhood size (Nb), and may be appreciable even with strong selection and free gene flow (≈exp(-B·Nb) in one dimension, ≈exp(-B\cdotNb) in two dimensions). Our results are close to those for the more tractable case of a polygenic character under disruptive selection.
AU - Nicholas Barton
AU - Rouhani, Shahin
ID - 3648
IS - 3
JF - Evolution
TI - The probability of fixation of a new karyotype in a continuous population
VL - 45
ER -
TY - JOUR
AB - Functional cDNA clones for rat neuromedin K receptor were isolated from a rat brain cDNA library by cross-hybridization with the bovine substance K recepor cDNA. Injection of the mRNA synthesized in vitro from the cloned cDNA into Xenopus oocytes elicited electrophysiological responses to tachykinins, with the most potent sensitivity being to neuromedin K. Ligand-binding displacement in membranes of mammalian COS cells transfected with the cDNA indicated the rank order of affinity of the receptor to tachykinins; neuromedin K > substance K > substance P. The hybridization analysis showed that the neuromedin K receptor mRNA is expressed in both the brain and the peripheral tissues at different levels. The rat neuromedin K receptor consists of 452 amino acid residues and belongs to the family of G protein-coupled receptors, which are thought to have seven transmembrane domains. The sequence comparison of the rat neuromedin K, substance P, and substance K receptors revealed that these receptors are highly conserved in the seven transmembrane domains and the cytoplasmic sides of the receptors. They also show some structural characteristics, including the common presence of histidine residues in transmembrane segments V and VI and the difference in the numbers and distributions of serine and threonine residues as possible phosphorylation sites in the cytoplasmic regions. This paper thus presents the first comprehensive analysis of the molecular nature of the multiple peptide receptors that exhibit similar but pharmacologically distinguishable activities.
AU - Ryuichi Shigemoto
AU - Yokota, Yoshifumi
AU - Tsuchida, Kunihiro
AU - Nakanishi, Shigetada
ID - 2480
IS - 2
JF - Journal of Biological Chemistry
TI - Cloning and expression of a rat neuromedin K receptor cDNA
VL - 265
ER -
TY - JOUR
AB - The family of mammalian tachykinin receptors consists of substance P receptor (SPR), neuromedin K receptor (NKR) and substance K receptor (SKR). In this investigation, tissue and regional distributions of the mRNAs for the three rat tachykinin receptors were investigated by blot-hybridization and RNase-protection analyses using the previously cloned receptor cDNAs. SPR mRNA is widely distributed in both the nervous system and peripheral tissues and is expressed abundantly in the hypothalamus and olfactory buld, as well as in the urinary bladder, salivary glands and small and large intestines. In contrast, NKR mRNA is predominantly expressed in the nervous system, particularly in the cortex, hypothalamus and cerebellum, whereas SKR mRNA expression is restricted to the peripheral tissues, being abundant in the urinary bladder, large intestine, stomach and adenal glands. Thus, the mRNAs for the three tachykinin receptors show distinct patterns of expression between the nervous system and peripheral tissues. Blot-hybridization analysis in combination with S1 nuclease protection and primer-extension analyses revealed that there are two large forms of SKR mRNA expressed commonly in the peripheral tissues, and two additional small forms of the mRNA expressed specifically in the adrenal gland and eye. These analyses also showed that the multiple forms of SKR mRNA differ in the lengths of the 5' mRNA portions, and that the two small forms of the mRNA, if translated, encode a truncated SKR polypeptide lacking the first two transmembrane domains. This investigation thus provides the comprehensive analysis of the distribution and mode of expression of the mRNAs for the multiple peptide receptors and offers a new basis on which to interpret the diverse functions of multiple tachykinin peptides in the CNS and peripheral tissues.
AU - Tsuchida, Kunihiro
AU - Ryuichi Shigemoto
AU - Yokota, Yoshifumi
AU - Nakanishi, Shigetada
ID - 2481
IS - 3
JF - European Journal of Biochemistry
TI - Tissue distribution and quantitation of the mRNAs for three rat tachykinin receptors
VL - 193
ER -
TY - JOUR
AB - We previously reported a novel rat membrane protein that exhibits a voltage-dependent potassium channel activity on the basis of molecular cloning combined with an electrophysiological assay. This protein, termed I(sK) protein, is small and different from the conventional potassium channel proteins but induces selective permeation of potassium ions on its expression in Xenopus oocytes. In this investigation, we examined cellular localization of rat I(sK) protein by preparing three different types of antibody that specifically reacts with a distinct part of rat I(sK) protein. Immunohistochemical analysis using these antibody preparations demonstrated that rat I(sK) protein is confined to the apical membrane portion of epithelial cells in the proximal tubule of the kidney, the submandibular duct and the uterine endometrium. The observed tissue distribution of rat I(sK) protein was consistent with that of the I(sK) protein mRNA determined by blot hybridization analysis. In epithelial cells, the sodium, potassium-ATPase pump in the basolateral membrane generates a sodium gradient across the epithelial cell and allows sodium ions to enter the cell through the apical membrane. Thus, taking into account the cellular localization of the I(sK) protein, together with its electrophysiological properties, we discussed a possible function of the I(sK) protein, namely that this protein is involved in potassium permeation in the apical membrane of epithelial cells through the depolarizing effect of sodium entry.
AU - Sugimoto, Tetsuo
AU - Tanabe, Yasuto
AU - Ryuichi Shigemoto
AU - Iwai, Masazumi
AU - Takumi, Toru
AU - Ohkubo, Hiroaki
AU - Nakanishi, Shigetada
ID - 2528
IS - 1
JF - Journal of Membrane Biology
TI - Immunohistochemical study of a rat membrane protein which induces a selective potassium permeation: Its localization in the apical membrane portion of epithelial cells
VL - 113
ER -
TY - JOUR
AB - We consider a multidimensional system consisting of a particle of mass M and radius r (molecule), surrounded by an infinite ideal gas of point particles of mass m (atoms). The molecule is confined to the unit ball and interacts with its boundary (barrier) via elastic collision, while the atoms are not affected by the boundary. We obtain convergence to equilibrium for the molecule from almost every initial distribution on its position and velocity. Furthermore, we prove that the infinite composite system of the molecule and the atoms is Bernoulli.
AU - László Erdös
AU - Tuyen, Dao Quang
ID - 2721
IS - 5-6
JF - Journal of Statistical Physics
TI - Ergodic properties of the multidimensional rayleigh gas with a semipermeable barrier
VL - 59
ER -
TY - JOUR
AB - This paper offers combinatorial results on extremum problems concerning the number of tetrahedra in a tetrahedrization of n points in general position in three dimensions, i.e. such that no four points are co-planar, It also presents an algorithm that in O(n log n) time constructs a tetrahedrization of a set of n points consisting of at most 3n-11 tetrahedra.
AU - Herbert Edelsbrunner
AU - Preparata, Franco P
AU - West, Douglas B
ID - 4060
IS - 3-4
JF - Journal of Symbolic Computation
TI - Tetrahedrizing point sets in three dimensions
VL - 10
ER -
TY - JOUR
AB - This paper describes a general-purpose programming technique, called Simulation of Simplicity, that can be used to cope with degenerate input data for geometric algorithms. It relieves the programmer from the task of providing a consistent treatment for every single special case that can occur. The programs that use the technique tend to be considerably smaller and more robust than those that do not use it. We believe that this technique will become a standard tool in writing geometric software.
AU - Herbert Edelsbrunner
AU - Mücke, Ernst P
ID - 4063
IS - 1
JF - ACM Transactions on Graphics
TI - Simulation of simplicity: A technique to cope with degenerate cases in geometric algorithms
VL - 9
ER -
TY - JOUR
AB - Given a set of data points pi = (xi, yi ) for 1 ≤ i ≤ n, the least median of squares regression line is a line y = ax + b for which the median of the squared residuals is a minimum over all choices of a and b. An algorithm is described that computes such a line in O(n 2) time and O(n) memory space, thus improving previous upper bounds on the problem. This algorithm is an application of a general method built on top of the topological sweep of line arrangements.
AU - Herbert Edelsbrunner
AU - Souvaine, Diane L
ID - 4064
IS - 409
JF - Journal of the American Statistical Association
TI - Computing least median of squares regression lines and guided topological sweep
VL - 85
ER -
TY - JOUR
AB - We prove that given n⩾3 convex, compact, and pairwise disjoint sets in the plane, they may be covered with n non-overlapping convex polygons with a total of not more than 6n−9 sides, and with not more than 3n−6 distinct slopes. Furthermore, we construct sets that require 6n−9 sides and 3n−6 slopes for n⩾3. The upper bound on the number of slopes implies a new bound on a recently studied transversal problem.
AU - Herbert Edelsbrunner
AU - Robison, Arch D
AU - Shen, Xiao-Jun
ID - 4065
IS - 2
JF - Discrete Mathematics
TI - Covering convex sets with non-overlapping polygons
VL - 81
ER -
TY - JOUR
AB - We consider several problems involving points and planes in three dimensions. Our main results are: (i) The maximum number of faces boundingm distinct cells in an arrangement ofn planes isO(m 2/3 n logn +n 2); we can calculatem such cells specified by a point in each, in worst-case timeO(m 2/3 n log3 n+n 2 logn). (ii) The maximum number of incidences betweenn planes andm vertices of their arrangement isO(m 2/3 n logn+n 2), but this number is onlyO(m 3/5– n 4/5+2 +m+n logm), for any>0, for any collection of points no three of which are collinear. (iii) For an arbitrary collection ofm points, we can calculate the number of incidences between them andn planes by a randomized algorithm whose expected time complexity isO((m 3/4– n 3/4+3 +m) log2 n+n logn logm) for any>0. (iv) Givenm points andn planes, we can find the plane lying immediately below each point in randomized expected timeO([m 3/4– n 3/4+3 +m] log2 n+n logn logm) for any>0. (v) The maximum number of facets (i.e., (d–1)-dimensional faces) boundingm distinct cells in an arrangement ofn hyperplanes ind dimensions,d>3, isO(m 2/3 n d/3 logn+n d–1). This is also an upper bound for the number of incidences betweenn hyperplanes ind dimensions andm vertices of their arrangement. The combinatorial bounds in (i) and (v) and the general bound in (ii) are almost tight.
AU - Herbert Edelsbrunner
AU - Guibas, Leonidas
AU - Sharir, Micha
ID - 4066
IS - 1
JF - Discrete & Computational Geometry
TI - The complexity of many cells in arrangements of planes and related problems
VL - 5
ER -
TY - CONF
AB - This paper proves an O(m 2/3 n 2/3+m+n) upper bound on the number of incidences between m points and n hyperplanes in four dimensions, assuming all points lie on one side of each hyperplane and the points and hyperplanes satisfy certain natural general position conditions. This result has application to various three-dimensional combinatorial distance problems. For example, it implies the same upper bound for the number of bichromatic minimum distance pairs in a set of m blue and n red points in three-dimensional space. This improves the best previous bound for this problem.
AU - Herbert Edelsbrunner
AU - Sharir, Micha
ID - 4067
TI - A hyperplane Incidence problem with applications to counting distances
VL - 450
ER -
TY - JOUR
AB - LetS be a collection ofn convex, closed, and pairwise nonintersecting sets in the Euclidean plane labeled from 1 ton. A pair of permutations
(i1i2in−1in)(inin−1i2i1)
is called ageometric permutation of S if there is a line that intersects all sets ofS in this order. We prove thatS can realize at most 2n–2 geometric permutations. This upper bound is tight.
AU - Herbert Edelsbrunner
AU - Sharir, Micha
ID - 4068
IS - 1
JF - Discrete & Computational Geometry
TI - The maximum number of ways to stabn convex nonintersecting sets in the plane is 2n−2
VL - 5
ER -
TY - JOUR
AB - Let C be a cell complex in d-dimensional Euclidean space whose faces are obtained by orthogonal projection of the faces of a convex polytope in d + 1 dimensions. For example, the Delaunay triangulation of a finite point set is such a cell complex. This paper shows that the in front/behind relation defined for the faces of C with respect to any fixed viewpoint x is acyclic. This result has applications to hidden line/surface removal and other problems in computational geometry.
AU - Herbert Edelsbrunner
ID - 4069
IS - 3
JF - Combinatorica
TI - An acyclicity theorem for cell complexes in d dimension
VL - 10
ER -
TY - JOUR
AB - Let S be a set of n closed intervals on the x-axis. A ranking assigns to each interval, s, a distinct rank, p(s) [1, 2,…,n]. We say that s can see t if p(s)<p(t) and there is a point ps∩t so that pu for all u with p(s)<p(u)<p(t). It is shown that a ranking can be found in time O(n log n) such that each interval sees at most three other intervals. It is also shown that a ranking that minimizes the average number of endpoints visible from an interval can be computed in time O(n 5/2). The results have applications to intersection problems for intervals, as well as to channel routing problems which arise in layouts of VLSI circuits.
AU - Herbert Edelsbrunner
AU - Overmars, Mark H
AU - Welzl, Emo
AU - Hartman, Irith Ben-Arroyo
AU - Feldman,Jack A
ID - 4070
IS - 3-4
JF - International Journal of Computer Mathematics
TI - Ranking intervals under visibility constraints
VL - 34
ER -
TY - CONF
AB - We show that a triangulation of a set of n points in the plane that minimizes the maximum angle can be computed in time O(n2 log n) and space O(n). In the same amount of time and space we can also handle the constrained case where edges are prescribed. The algorithm iteratively improves an arbitrary initial triangulation and is fairly easy to implement.
AU - Herbert Edelsbrunner
AU - Tan, Tiow Seng
AU - Waupotitsch, Roman
ID - 4071
TI - An O(n^2log n) time algorithm for the MinMax angle triangulation
ER -
TY - JOUR
AB - We show that the total number of edges ofm faces of an arrangement ofn lines in the plane isO(m 2/3– n 2/3+2 +n) for any>0. The proof takes an algorithmic approach, that is, we describe an algorithm for the calculation of thesem faces and derive the upper bound from the analysis of the algorithm. The algorithm uses randomization and its expected time complexity isO(m 2/3– n 2/3+2 logn+n logn logm). If instead of lines we have an arrangement ofn line segments, then the maximum number of edges ofm faces isO(m 2/3– n 2/3+2 +n (n) logm) for any>0, where(n) is the functional inverse of Ackermann's function. We give a (randomized) algorithm that produces these faces and takes expected timeO(m 2/3– n 2/3+2 log+n(n) log2 n logm).
AU - Herbert Edelsbrunner
AU - Guibas, Leonidas J
AU - Sharir, Micha
ID - 4072
IS - 1
JF - Discrete & Computational Geometry
TI - The complexity and construction of many faces in arrangements of lines and of segments
VL - 5
ER -
TY - CONF
AB - A number of rendering algorithms in computer graphics sort three-dimensional objects by depth and assume that there is no cycle that makes the sorting impossible. One way to resolve the problem caused by cycles is to cut the objects into smaller pieces. The problem of estimating how many such cuts are always sufficient is addressed. A few related algorithmic and combinatorial geometry problems are considered
AU - Chazelle, Bernard
AU - Herbert Edelsbrunner
AU - Guibas, Leonidas J
AU - Pollack, Richard
AU - Seidel, Raimund
AU - Sharir, Micha
AU - Snoeyink, Jack
ID - 4073
TI - Counting and cutting cycles of lines and rods in space
ER -
TY - JOUR
AU - Clarkson, Kenneth L
AU - Herbert Edelsbrunner
AU - Guibas, Leonidas J
AU - Sharir, Micha
AU - Welzl, Emo
ID - 4074
IS - 1
JF - Discrete & Computational Geometry
TI - Combinatorial complexity bounds for arrangements of curves and spheres
VL - 5
ER -
TY - JOUR
AB - A key problem in computational geometry is the identification of subsets of a point set having particular properties. We study this problem for the properties of convexity and emptiness. We show that finding empty triangles is related to the problem of determining pairs of vertices that see each other in a star-shaped polygon. A linear-time algorithm for this problem which is of independent interest yields an optimal algorithm for finding all empty triangles. This result is then extended to an algorithm for finding empty convex r-gons (r> 3) and for determining a largest empty convex subset. Finally, extensions to higher dimensions are mentioned.
AU - Dobkin, David P
AU - Herbert Edelsbrunner
AU - Overmars, Mark H
ID - 4075
IS - 4
JF - Algorithmica
TI - Searching for empty convex polygons
VL - 5
ER -
TY - CONF
AB - We present an algorithm to compute a Euclidean minimum spanning tree of a given set S of n points in Ed in time O(Td(N, N) logd N), where Td(n, m) is the time required to compute a bichromatic closest pair among n red and m blue points in Ed. If Td(N, N) = Ω(N1+ε), for some fixed ε > 0, then the running time improves to O(Td(N, N)). Furthermore, we describe a randomized algorithm to compute a bichromatic closets 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/3log4/3 N) expected time algorithm for computing a Euclidean minimum spanning tree of N points in E3.
AU - Agarwal, Pankaj K
AU - Herbert Edelsbrunner
AU - Schwarzkopf, Otfried
AU - Welzl, Emo
ID - 4076
TI - Euclidean minimum spanning trees and bichromatic closest pairs
ER -
TY - CONF
AB - We prove that for any set S of n points in the plane and n3-α triangles spanned by the points of S there exists a point (not necessarily of S) contained in at least n3-3α/(512 log25 n) of the triangles. This implies that any set of n points in three - dimensional space defines at most 6.4n8/3 log5/3 n halving planes.
AU - Aronov, Boris
AU - Chazelle, Bernard
AU - Herbert Edelsbrunner
AU - Guibas, Leonidas J
AU - Sharir, Micha
AU - Wenger, Rephael
ID - 4077
TI - Points and triangles in the plane and halving planes in space
ER -
TY - CONF
AB - In this paper we derived combinatorial point selection results for geometric objects defined by pairs of points. In a nutshell, the results say that if many pairs of a set of n points in some fixed dimension each define a geometric object of some type, then there is a point covered by many of these objects. Based on such a result for three-dimensional spheres we show that the combinatorial size of the Delaunay triangulation of a point set in space can be reduced by adding new points. We believe that from a practical point of view this is the most important result of this paper.
AU - Chazelle, Bernard
AU - Herbert Edelsbrunner
AU - Guibas, Leonidas J
AU - Hershberger, John E
AU - Seidel, Raimund
AU - Sharir, Micha
ID - 4078
TI - Slimming down by adding; selecting heavily covered points
ER -
TY - GEN
AU - Nicholas Barton
AU - Jones, Steve
ID - 4310
T2 - Nature
TI - The language of the genes
VL - 346
ER -
TY - CHAP
AU - Nicholas Barton
AU - Clark,A.
ED - Wöhrmann, Klaus
ED - Jain, Subodh K
ID - 4311
T2 - Population biology: ecological and evolutionary viewpoints
TI - Population structure
ER -