Spanning trees crossing few barriers

We consider the problem of finding low-cost spanning trees for sets of n points in the plane, where the cost of a spanning tree is defined as the total number of intersections of tree edges with a given set of m barriers. We obtain the following results: (i) if the barriers are possibly intersecting line segments, then there is always a spanning tree of cost O(min(m2,m SQRT(n))); (ii) if the barriers are disjoint line segments, then there is always a spanning tree of cost O(m); (iii) if the barriers are disjoint convex objects, then there is always a spanning tree of cost O(n + m). All our bounds are worst-case optimal

Covering many points with a small-area box

Let $P$ be a set of $n$ points in the plane. We show how to find, for a given integer $k>0$, the smallest-area axis-parallel rectangle that covers $k$ points of $P$ in $O(nk^2 \log n+ n\log^2 n)$ time. We also consider the problem of, given a value $\alpha>0$, covering as many points of $P$ as possible with an axis-parallel rectangle of area at most $\alpha$. For this problem we give a probabilistic $(1-\varepsilon)$-approximation that works in near-linear time: In $O((n/\varepsilon^4)\log^3 n \log (1/\varepsilon))$ time we find an axis-parallel rectangle of area at most $\alpha$ that, with high probability, covers at least $(1-\varepsilon)\mathrm{\kappa^*}$ points, where $\mathrm{\kappa^*}$ is the maximum possible number of points that could be covered

Shortcuts for the Circle

Let C be the unit circle in R^2. We can view C as a plane graph whose vertices are all the points on C, and the distance between any two points on C is the length of the smaller arc between them. We consider a graph augmentation problem on C, where we want to place k >= 1 shortcuts on C such that the diameter of the resulting graph is minimized. We analyze for each k with 1 <= k <= 7 what the optimal set of shortcuts is. Interestingly, the minimum diameter one can obtain is not a strictly decreasing function of k. For example, with seven shortcuts one cannot obtain a smaller diameter than with six shortcuts. Finally, we prove that the optimal diameter is 2 + Theta(1/k^(2/3)) for any k

Sparse geometric graphs with small dilation

Given a set S of n points in R^D, and an integer k such that 0 <= k < n, we show that a geometric graph with vertex set S, at most n - 1 + k edges, maximum degree five, and dilation O(n / (k+1)) can be computed in time O(n log n). For any k, we also construct planar n-point sets for which any geometric graph with n-1+k edges has dilation Omega(n/(k+1)); a slightly weaker statement holds if the points of S are required to be in convex position

Tractography of developing white matter of the internal capsule and corpus callosum in very preterm infants

To investigate in preterm infants associations between Diffusion Tensor Imaging (DTI) parameters of the posterior limb of the internal capsule (PLIC) and corpus callosum (CC) and age, white matter (WM) injury and clinical factors. In 84 preterm infants DTI was performed between 40-62 weeks postmenstrual age on 3 T MR. Fractional anisotropy (FA), apparent diffusion coefficient (ADC) values and fibre lengths through the PLIC and the genu and splenium were determined. WM injury was categorised as normal/mildly, moderately and severely abnormal. Associations between DTI parameters and age, WM injury and clinical factors were analysed. A positive association existed between FA and age at imaging for fibres through the PLIC (r = 0.48 p < 0.001) and splenium (r = 0.24 p < 0.01). A negative association existed between ADC and age at imaging for fibres through the PLIC (r = -0.65 p < 0.001), splenium (r = -0.35 p < 0.001) and genu (r = -0.53 p < 0.001). No association was found between DTI parameters and gestational age, degree of WM injury or categorical clinical factors. These results indicate that in our cohort of very preterm infants, at this young age, the development of the PLIC and CC is ongoing and independent of the degree of prematurity or WM injury.Neuro Imaging Researc

Comprehensive molecular characterization of gastric adenocarcinoma

Gastric cancer is a leading cause of cancer deaths, but analysis of its molecular and clinical characteristics has been complicated by histological and aetiological heterogeneity. Here we describe a comprehensive molecular evaluation of 295 primary gastric adenocarcinomas as part of The Cancer Genome Atlas (TCGA) project. We propose a molecular classification dividing gastric cancer into four subtypes: tumours positive for Epstein–Barr virus, which display recurrent PIK3CA mutations, extreme DNA hypermethylation, and amplification of JAK2, CD274 (also known as PD-L1) and PDCD1LG2 (also knownasPD-L2); microsatellite unstable tumours, which show elevated mutation rates, including mutations of genes encoding targetable oncogenic signalling proteins; genomically stable tumours, which are enriched for the diffuse histological variant and mutations of RHOA or fusions involving RHO-family GTPase-activating proteins; and tumours with chromosomal instability, which show marked aneuploidy and focal amplification of receptor tyrosine kinases. Identification of these subtypes provides a roadmap for patient stratification and trials of targeted therapies

Genetic correlation between amyotrophic lateral sclerosis and schizophrenia

A. Palotie on työryhmän Schizophrenia Working Grp Psychiat jäsen.We have previously shown higher-than-expected rates of schizophrenia in relatives of patients with amyotrophic lateral sclerosis (ALS), suggesting an aetiological relationship between the diseases. Here, we investigate the genetic relationship between ALS and schizophrenia using genome-wide association study data from over 100,000 unique individuals. Using linkage disequilibrium score regression, we estimate the genetic correlation between ALS and schizophrenia to be 14.3% (7.05-21.6; P = 1 x 10(-4)) with schizophrenia polygenic risk scores explaining up to 0.12% of the variance in ALS (P = 8.4 x 10(-7)). A modest increase in comorbidity of ALS and schizophrenia is expected given these findings (odds ratio 1.08-1.26) but this would require very large studies to observe epidemiologically. We identify five potential novel ALS-associated loci using conditional false discovery rate analysis. It is likely that shared neurobiological mechanisms between these two disorders will engender novel hypotheses in future preclinical and clinical studies.Peer reviewe

Integrated genomic characterization of oesophageal carcinoma

Oesophageal cancers are prominent worldwide; however, there are few targeted therapies and survival rates for these cancers remain dismal. Here we performed a comprehensive molecular analysis of 164 carcinomas of the oesophagus derived from Western and Eastern populations. Beyond known histopathological and epidemiologic distinctions, molecular features differentiated oesophageal squamous cell carcinomas from oesophageal adenocarcinomas. Oesophageal squamous cell carcinomas resembled squamous carcinomas of other organs more than they did oesophageal adenocarcinomas. Our analyses identified three molecular subclasses of oesophageal squamous cell carcinomas, but none showed evidence for an aetiological role of human papillomavirus. Squamous cell carcinomas showed frequent genomic amplifications of CCND1 and SOX2 and/or TP63, whereas ERBB2, VEGFA and GATA4 and GATA6 were more commonly amplified in adenocarcinomas. Oesophageal adenocarcinomas strongly resembled the chromosomally unstable variant of gastric adenocarcinoma, suggesting that these cancers could be considered a single disease entity. However, some molecular features, including DNA hypermethylation, occurred disproportionally in oesophageal adenocarcinomas. These data provide a framework to facilitate more rational categorization of these tumours and a foundation for new therapies

Computational geometry: algorithms and applications

Computational geometry emerged from the field of algorithms design and anal­ ysis in the late 1970s. It has grown into a recognized discipline with its own journals, conferences, and a large community of active researchers. The suc­ cess of the field as a research discipline can on the one hand be explained from the beauty of the problems studied and the solutions obtained, and, on the other hand, by the many application domains--computer graphics, geographic in­ formation systems (GIS), robotics, and others-in which geometric algorithms play a fundamental role. For many geometric problems the early algorithmic solutions were either slow or difficult to understand and implement. In recent years a number of new algorithmic techniques have been developed that improved and simplified many of the previous approaches. In this textbook we have tried to make these modem algorithmic solutions accessible to a large audience. The book has been written as a textbook for a course in computational geometry, but it can also be used for self-study