Prognostic markers in head and neck carcinoma

Head and neck squamous cell carcinoma (HNSCC) is the sixth most common cancer worldwide. Well-known risk factors include tobacco smoking and alcohol consumption. Overall survival has improved, but is still low especially in developing countries. One reason for this is the often advanced stage of the disease at the time of diagnosis, but also lack of reliable prognostic tools to enable individualized patient treatment to improve outcome. To date, the TNM classification still serves as the best disease evaluation criterion, although it does not take into account the molecular basis of the tumor. The need for surrogate molecular markers for more accurate disease prediction has increased research interests in this field. We investigated the prevalence, physical status, and viral load of human papillomavirus (HPV) in HNSCC to determine the impact of HPV on head and neck carcinogenesis. The prevalence and genotyping of HPV were assessed with an SPF10 PCR microtiter plate-based hybridization assay (DEIA), followed by a line probe-based genotyping assay. More than half of the patients had HPV DNA in their tumor specimens. Oncogenic HPV-16 was the most common type, and coinfections with other oncogenic and benign associated types also existed. HPV-16 viral load was unevenly distributed among different tumor sites; the tonsils harbored significantly greater amounts of virus than other sites. Episomal location of HPV-16 was associated with large tumors, and both integrated and mixed forms of viral DNA were detected. In this series, we could not show that the presence of HPV DNA correlated with survival. In addition, we investigated the prevalence and genotype of HPV in laryngeal carcinoma patients in a prospective Nordic multicenter study based on fresh-frozen laryngeal tumor samples to determine whether the tumors were HPV-associated. These patients were also examined and interviewed at diagnosis for known risk factors, such as tobacco smoking and alcohol consumption, and for several other habituations to elucidate their effects on patient survival. HPV analysis was performed with the same protocols as in the first study. Only 4% of the specimens harbored HPV DNA. Heavy drinking was associated with poor survival. Heavy drinking patients were also younger than nonheavy drinkers and had a more advanced stage of disease at diagnosis. Heavy drinkers had worse oral hygiene than nonheavy drinkers; however, poor oral hygiene did not have prognostic significance. History of chronic laryngitis, gastroesophageal reflux disease, and orogenital sex contacts were rare in this series. To clarify why vocal cord carcinomas seldom metastasize, we determined tumor lymph vessel (LVD) and blood vessel (BVD) densities in HNSCC patients. We used a novel lymphatic vessel endothelial marker (LYVE-1 antibody) to locate the lymphatic vessels in HNSCC samples and CD31 to detect the blood microvessels. We found carcinomas of the vocal cords to harbor less lymphatic and blood microvessels than carcinomas arising from sites other than vocal cords. The lymphatic and blood microvessel densities did not correlate with tumor size. High BVD was strongly correlated with high LVD. Neither BVD nor LVD showed any association with survival in our series. The immune system plays an important role in tumorigenesis, as neoplastic cells have to escape the cytotoxic lymphocytes in order to survive. Several candidate HLA class II alleles have been reported to be prognostic in cervical carcinomas, an epithelial malignancy resembling HNSCC. These alleles may have an impact on head and neck carcinomas as well. We determined HLA-DRB1* and -DQB1* alleles in HNSCC patients. Healthy organ donors served as controls. The Inno-LiPA reverse dot-blot kit was used to identify alleles in patient samples. No single haplotype was found to be predictive of either the risk for head and neck cancer, or the clinical course of the disease. However, alleles observed to be prognostic in cervical carcinomas showed a similar tendency in our series. DRB1*03 was associated with node-negative disease at diagnosis. DRB1*08 and DRB1*13 were associated with early-stage disease; DRB1*04 had a lower risk for tumor relapse; and DQB1*03 and DQB1*0502 were more frequent in controls than in patients. However, these associations reached only borderline significance in our HNSCC patients.

Probiotics in the prevention of clinical manifestations of common infectious diseases in children and in the elderly

Infectious diseases put an enormous burden on both children and the elderly in the forms of respiratory, gastrointestinal and oral infections. There is evidence suggesting that specific probiotics may be antagonistic to pathogens and may enhance the immune system, but the clinical evidence is still too sparce to make general conclusions on the disease-preventive effects of probiotics. This thesis, consisting of four independent, double-blind, placebo-controlled clinical trials, investigated whether Lactobacillus GG (LGG) or a specific probiotic combination containing LGG would reduce the risk of common infections or the prevalence of pathogens in healthy and infection-prone children and in independent and institutionalised elderly people. In healthy day-care children, the 7-month consumption of probiotic milk containing Lactobacillus GG appeared to postpone the first acute respiratory infection (ARI) by one week (p=0.03, adjusted p=0.16), and to reduce complicated infections (39% vs. 47%, p<0.05, adjusted p=0.13), as well as the need for antibiotic treatment (44% vs. 54%, p=0.03, adjusted p=0.08) and day-care absences (4.9 vs. 5.8 days, p=0.03, adjusted p=0.09) compared to the placebo milk. In infection-prone children, the 6-month consumption of a combination of four probiotic bacteria (LGG, L. rhamnosus LC705, Propionibacterium freudenreichii JS, Bifidobacterium breve 99) taken in capsules appeared to reduce recurrent ARIs (72% vs. 82%, p<0.05; adjusted p=0.06), and the effect was particularly noticeable in a subgroup of children with allergic diseases (12% vs. 33%, p=0.03), although no effect on the presence of nasopharyngeal rhinovirus or enterovirus was seen. The 5-month consumption of the same probiotic combination did not show any beneficial effects on the respiratory infections in frail, institutionalised elderly subjects. In healthy children receiving Lactobacillus GG, the reduction in complications resulted in a marginal reduction in the occurrence of acute otitis media (AOM) (31% vs. 39%, p=0.08; adjusted p=0.19), and the postponement of the first AOM episode by 12 days (p=0.04; adjusted p=0.09). However, in otitis-prone children, a probiotic combination did not reduce the occurrence of AOM or the total prevalence of common AOM pathogens (Streptococcus pneumoniae, Haemophilus influenzae, Moraxella catarrhalis), except in the case of children with allergic diseases, in whom probiotics reduced recurrent AOM episodes (0% vs. 14%, p=0.03). In addition, interaction between probiotics and bacterial carriage was seen: probiot-ics reduced AOM in children who did not carry any bacterial pathogens (63% vs. 83%), but the effect was the reverse in children carrying bacteria in the nasopharynx (74% vs 62%) (p<0.05). Long-term probiotic treatment, either LGG given in milk to healthy children for 7 months or a combination of probiotics given in capsules to institutionalised elderly subjects for 5 months, did not reduce the occurrence of acute diarrhoea. However, when the probiotic combination (LGG, L. rhamnosus LC705, Propionibacterium JS) was given in cheese to independent elderly subjects for 4 months, the oral carriage of high Candida counts was reduced in the probiotic group vs. the placebo group (21% vs. 34%, p=0.01, adjusted p=0.004). The risk of hyposalivation was also reduced in the probiotic group (p=0.05). In conclusion, probiotics appear to slightly alleviate the severity of infections by postponing their appearance, by reducing complications and the need for antimicrobial treatments. In addition, they appear to prevent recurrent infections in certain subgroups of children, such as in infection-prone children with allergic diseases. Alleviating ARI by probiotics may lead to a marginal reduction in the occurrence of AOM in healthy children but not in infection-prone children with disturbed nasopharyngeal microbiota. On the basis of these results it could be supposed that Lactobacillus GG or a specific combination containing LGG are effective against viral but not against bacterial otitis, and the mechanism is probably mediated through the stimulation of the immune system. A specific probiotic combination does not reduce respiratory infections in frail elderly subjects. Acute diarrhoea, either in children or in the elderly, is not prevented by the continuous, long-term consumption of probiotics, but the consumption of a specific probiotic combination in a food matrix is beneficial to the oral health of the elderly, through the reduction of the carriage of Candida.

Merkel cell carcinoma : Epidemiological study with special reference to polyomavirus and vascular factors in pathogenesis

Merkel cell carcinoma (MCC) is a rare cutaneous malignancy that occurs predominantly on sun exposed skin areas. A new polyomavirus (MCPyV) was identified in MCC tumor tissues in 2008 suggesting that a viral infection might be an etiological factor. A typical MCC is a rapidly growing painless purple nodule. In its early stage it can be misjudged by its appearance as a cyst or abscess. Recurrences are common and approximately half of the patients will develop lymph node metastases and third of the patents will have distant metastases. It affects mostly elderly persons at an average age of 70 at the time of diagnosis. MCC was first described in 1972 and the first MCC patient in Finland was identified in 1983. MCC has been poorly recognized, but increased awareness and better diagnostic accuracy has increased the incidence since the early years. In this study, all cases with a notation of MCC during 1979 2008 were obtained from the Finnish Cancer Registry. Based on this data, the incidence is 0.11 for men and 0.12 for women. It is similar than that of other Nordic countries, but lower than in the USA. For clinical series, the files of patients diagnosed with MCC during 1983 2004 were reviewed, and the tissue samples were re-evaluated, if available (n=181). Third of the patients were men, and the most common site of the primary tumor was the head and neck (53%). The majority of the patients (86%) presented with a clinically node-negative (Stage I or II) disease, but the disease recurred in 38% of them. The treatment schemes were heterogeneous. No additional benefit from a wide margin (≥2 cm) was found compared to a margin of 0.1-1.9 cm, but intralesional excision was more often associated with local recurrence. None of the patients with Stage I-II disease who had received postoperative radiotherapy had local recurrence during the follow-up period. The 5-year relative survival ratio for Stage I disease was 68%, for Stage II 67%, for Stage III 16%, and for Stage IV 0%. The relative excess risk of death was significantly lower among women than among men. Some of these tissue samples were further analyzed for vascular invasion (n=126) by immunohistochemistry using vascular endothelial markers CD-31 and D2-40. Vascular invasion was seen in 93% of the samples and it was observed already in very small, <5mm tumors. The tissue samples were also analyzed for the presence of MCPyV by using a polymerase chain reaction (PCR) and quantitative PCR. MCPyV DNA was present in 80% of 114 samples studied. The patients with virus-positive tumors had better overall survival than patients with virus-negative tumors. Immunohistochemical analyses were performed for the expression of VEGFR-2 (n=21) and endostatin (n=19), but they had no prognostic value. Our results support the concept of treating MCC with margin-negative excision and radiotherapy to the tumor bed to reduce local recurrence. The finding of a high frequency of lymphovascular invasion reduces its value as a prognostic factor, but emphasizes the role of sentinel node biopsy even in very small primary MCC.

mRNA-binding protein HuR in breast carcinogenesis

Breast cancer is the most common cancer among women. Although its prognosis has improved nowadays, methods to predict the progression of the disease or to treat it are not comprehensive. This thesis work was initiated to elucidate in breast carcinogenesis the role of HuR, a ubiquitously expressed mRNA-binding protein that regulates gene expression posttranscriptionally. HuR is predominantly nuclear, but it shuttles between the nucleus and the cytoplasm, and this nucleocytoplasmic translocation is important for its function as a RNA-stabilizing and translational regulator. HuR has been associated with diverse cellular processes, for example carcinogenesis. The specific aims of my thesis work were to study the prognostic value of HuR in breast cancer and to clarify the mechanisms by which HuR contributes to breast carcinogenesis. My ultimate goal is, by better understanding the role of HuR in breast carcinogenesis, to aid in the discovery of novel targets for cancer therapies. HuR expression and localization was studied in paraffin-embedded preinvasive (atypical ductal hyperplasia, ADH, and ductal carcinoma in situ, DCIS) specimens as well in sporadic and familial breast cancer specimens. Our results show that cytoplasmic HuR expression was already elevated in ADH and remained elevated in DCIS as well as in cancer specimens. Clinicopathological analysis showed that cytoplasmic HuR expression associated with the more aggressive form of the disease in DCIS, and in cancer specimens it proved an independent marker for poor prognosis. Importantly, cytoplasmic HuR expression was significantly associated with poor outcome in the subgroups of small (2 cm) and axillary lymph node-negative breast cancers. HuR proved to be the first mRNA stability protein the expression of which is associated in breast cancer with poor outcome. To explore the mechanisms of HuR in breast carcinogenesis, lentiviral constructs were developed to inhibit and to overexpress the HuR expression in a breast epithelial cell line (184B5Me). Our results suggest that HuR mediates breast carcinogenesis by participating in processes important in cell transformation, in programmed cell death, and in cell invasion. Global gene expression analysis shows that HuR regulates genes participating in diverse cellular processes, and affects several pathways important in cancer development. In addition, we identified two novel target transcripts (connective tissue growth factor, CTGF, and Ras oncogene family member 31, RAB31) for HuR. In conclusion, because cytoplasmic HuR expression in breast cancer can predict the outcome of the disease it could serve in clinics as a prognostic marker. HuR accumulates in the cytoplasm even at its non-invasive stage (ADH and DCIS) of the carcinogenic process and supports functions essential in cell alteration. These data suggest that HuR contributes to carcinogenesis of the breast epithelium.

Exact bounds for distributed graph colouring

A distributed system is a collection of networked autonomous processing units which must work in a cooperative manner. Currently, large-scale distributed systems, such as various telecommunication and computer networks, are abundant and used in a multitude of tasks. The field of distributed computing studies what can be computed efficiently in such systems. Distributed systems are usually modelled as graphs where nodes represent the processors and edges denote communication links between processors. This thesis concentrates on the computational complexity of the distributed graph colouring problem. The objective of the graph colouring problem is to assign a colour to each node in such a way that no two nodes connected by an edge share the same colour. In particular, it is often desirable to use only a small number of colours. This task is a fundamental symmetry-breaking primitive in various distributed algorithms. A graph that has been coloured in this manner using at most k different colours is said to be k-coloured. This work examines the synchronous message-passing model of distributed computation: every node runs the same algorithm, and the system operates in discrete synchronous communication rounds. During each round, a node can communicate with its neighbours and perform local computation. In this model, the time complexity of a problem is the number of synchronous communication rounds required to solve the problem. It is known that 3-colouring any k-coloured directed cycle requires at least ½(log* k - 3) communication rounds and is possible in ½(log* k + 7) communication rounds for all k ≥ 3. This work shows that for any k ≥ 3, colouring a k-coloured directed cycle with at most three colours is possible in ½(log* k + 3) rounds. In contrast, it is also shown that for some values of k, colouring a directed cycle with at most three colours requires at least ½(log* k + 1) communication rounds. Furthermore, in the case of directed rooted trees, reducing a k-colouring into a 3-colouring requires at least log* k + 1 rounds for some k and possible in log* k + 3 rounds for all k ≥ 3. The new positive and negative results are derived using computational methods, as the existence of distributed colouring algorithms corresponds to the colourability of so-called neighbourhood graphs. The colourability of these graphs is analysed using Boolean satisfiability (SAT) solvers. Finally, this thesis shows that similar methods are applicable in capturing the existence of distributed algorithms for other graph problems, such as the maximal matching problem.

Lower Gastrointestinal Microbiota in Health and Irritable Bowel Syndrome : Characterisation and Effect of Probiotic Intervention

The human gastrointestinal (GI) microbiota is a complex ecosystem that lives in symbiosis with its host. The growing awareness of the importance of the microbiota to the host as well as the development of culture-free laboratory techniques and computational methods has enormously expanded our knowledge of this microbial community. Irritable bowel syndrome (IBS) is a common functional bowel disorder affecting up to a fifth of the Western population. To date, IBS diagnosis has been based on GI symptoms and the exclusion of organic diseases. The GI microbiota has been found to be altered in this syndrome and probiotics can alleviate the symptoms, although clear links between the symptoms and the microbiota have not been demonstrated. The aim of the present work was to characterise IBS related alterations in the intestinal microbiota, their relation to IBS symptoms and their responsiveness to probiotic theraphy. In this thesis research, the healthy human microbiota was characterised by cloning and sequencing 16S rRNA genes from a faecal microbial community DNA pool that was first profiled and fractionated according to its guanine and cytosine content (%G+C). The most noticeable finding was that the high G+C Gram-positive bacteria (the phylum Actinobacteria) were more abundant compared to a corresponding library constructed from the unfractionated DNA pool sample. Previous molecular analyses of the gut microbiota have also shown comparatively low amounts of high G+C bacteria. Furthermore, the %G+C profiling approach was applied to a sample constructed of faecal DNA from diarrhea-predominant IBS (IBS-D) subjects. The phylogenetic microbial community comparison performed for healthy and IBS-D sequence libraries revealed that the IBS-D sample was rich in representatives of the phyla Firmicutes and Proteobacteria whereas Actinobacteria and Bacteroidetes were abundant in the healthy subjects. The family Lachnospiraceae within the Firmicutes was especially prevalent in the IBS-D sample. Moreover, associations of the GI microbiota with intestinal symptoms and the quality of life (QOL) were investigated, as well as the effect of probiotics on these factors. The microbial targets that were analysed with the quantitative real-time polymerase chain reaction (qPCR) in this study were phylotypes (species definition according to 16S rRNA gene sequence similarity) previously associated with either health or IBS. With a set of samples, the presence or abundance of a phylotype that had 94% 16S rRNA gene sequence similarity to Ruminococcus torques (R. torques 94%) was shown to be associated with the severity of IBS symptoms. The qPCR analyses for selected phylotypes were also applied to samples from a six-month probiotic intervention with a mixture of Lactobacillus rhamnosus GG, L. rhamnosus Lc705, Propionibacterium freudenreichii ssp. shermanii JS and Bifidobacterium breve Bb99. The intervention had been previously reported to alleviate IBS symptoms, but no associations with the analysed microbiota representatives were shown. However, with the phylotype-specific assays applied here, the abundance of the R. torques 94% -phylotype was shown to be lowered in the probiotic-receiving group during the probiotic supplementation, whereas a Clostridium thermosuccinogenes 85% phylotype, previously associated with a healthy microbiota, was found to be increased compared to the placebo group. To conclude, with the combination of methods applied, higher abundance of Actinobacteria was detected in the healthy gut than found in previous studies, and significant phylum-level microbiota alterations could be shown in IBS-D. Thus, the results of this study provide a detailed overview of the human GI microbiota in healthy subjects and in subjects with IBS. Furthermore, the IBS symptoms were linked to a particular clostridial phylotype, and probiotic supplementation was demonstrated to alter the GI microbiota towards a healthier state with regard to this and an additional bacterial phylotype. For the first time, distinct phylotype-level alterations in the microbiota were linked to IBS symptoms and shown to respond to probiotic therapy.

Distributed algorithms for edge dominating sets

An edge dominating set for a graph G is a set D of edges such that each edge of G is in D or adjacent to at least one edge in D. This work studies deterministic distributed approximation algorithms for finding minimum-size edge dominating sets. The focus is on anonymous port-numbered networks: there are no unique identifiers, but a node of degree d can refer to its neighbours by integers 1, 2, ..., d. The present work shows that in the port-numbering model, edge dominating sets can be approximated as follows: in d-regular graphs, to within 4 − 6/(d + 1) for an odd d and to within 4 − 2/d for an even d; and in graphs with maximum degree Δ, to within 4 − 2/(Δ − 1) for an odd Δ and to within 4 − 2/Δ for an even Δ. These approximation ratios are tight for all values of d and Δ: there are matching lower bounds.

Optimisation problems in wireless sensor networks

This thesis studies optimisation problems related to modern large-scale distributed systems, such as wireless sensor networks and wireless ad-hoc networks. The concrete tasks that we use as motivating examples are the following: (i) maximising the lifetime of a battery-powered wireless sensor network, (ii) maximising the capacity of a wireless communication network, and (iii) minimising the number of sensors in a surveillance application. A sensor node consumes energy both when it is transmitting or forwarding data, and when it is performing measurements. Hence task (i), lifetime maximisation, can be approached from two different perspectives. First, we can seek for optimal data flows that make the most out of the energy resources available in the network; such optimisation problems are examples of so-called max-min linear programs. Second, we can conserve energy by putting redundant sensors into sleep mode; we arrive at the sleep scheduling problem, in which the objective is to find an optimal schedule that determines when each sensor node is asleep and when it is awake. In a wireless network simultaneous radio transmissions may interfere with each other. Task (ii), capacity maximisation, therefore gives rise to another scheduling problem, the activity scheduling problem, in which the objective is to find a minimum-length conflict-free schedule that satisfies the data transmission requirements of all wireless communication links. Task (iii), minimising the number of sensors, is related to the classical graph problem of finding a minimum dominating set. However, if we are not only interested in detecting an intruder but also locating the intruder, it is not sufficient to solve the dominating set problem; formulations such as minimum-size identifying codes and locating–dominating codes are more appropriate. This thesis presents approximation algorithms for each of these optimisation problems, i.e., for max-min linear programs, sleep scheduling, activity scheduling, identifying codes, and locating–dominating codes. Two complementary approaches are taken. The main focus is on local algorithms, which are constant-time distributed algorithms. The contributions include local approximation algorithms for max-min linear programs, sleep scheduling, and activity scheduling. In the case of max-min linear programs, tight upper and lower bounds are proved for the best possible approximation ratio that can be achieved by any local algorithm. The second approach is the study of centralised polynomial-time algorithms in local graphs – these are geometric graphs whose structure exhibits spatial locality. Among other contributions, it is shown that while identifying codes and locating–dominating codes are hard to approximate in general graphs, they admit a polynomial-time approximation scheme in local graphs.

Analysing local algorithms in location-aware quasi-unit-disk graphs

A local algorithm with local horizon r is a distributed algorithm that runs in r synchronous communication rounds; here r is a constant that does not depend on the size of the network. As a consequence, the output of a node in a local algorithm only depends on the input within r hops from the node. We give tight bounds on the local horizon for a class of local algorithms for combinatorial problems on unit-disk graphs (UDGs). Most of our bounds are due to a refined analysis of existing approaches, while others are obtained by suggesting new algorithms. The algorithms we consider are based on network decompositions guided by a rectangular tiling of the plane. The algorithms are applied to matching, independent set, graph colouring, vertex cover, and dominating set. We also study local algorithms on quasi-UDGs, which are a popular generalisation of UDGs, aimed at more realistic modelling of communication between the network nodes. Analysing the local algorithms on quasi-UDGs allows one to assume that the nodes know their coordinates only approximately, up to an additive error. Despite the localisation error, the quality of the solution to problems on quasi-UDGs remains the same as for the case of UDGs with perfect location awareness. We analyse the increase in the local horizon that comes along with moving from UDGs to quasi-UDGs.

Locally checkable proofs

This work studies decision problems from the perspective of nondeterministic distributed algorithms. For a yes-instance there must exist a proof that can be verified with a distributed algorithm: all nodes must accept a valid proof, and at least one node must reject an invalid proof. We focus on locally checkable proofs that can be verified with a constant-time distributed algorithm. For example, it is easy to prove that a graph is bipartite: the locally checkable proof gives a 2-colouring of the graph, which only takes 1 bit per node. However, it is more difficult to prove that a graph is not bipartite—it turns out that any locally checkable proof requires Ω(log n) bits per node. In this work we classify graph problems according to their local proof complexity, i.e., how many bits per node are needed in a locally checkable proof. We establish tight or near-tight results for classical graph properties such as the chromatic number. We show that the proof complexities form a natural hierarchy of complexity classes: for many classical graph problems, the proof complexity is either 0, Θ(1), Θ(log n), or poly(n) bits per node. Among the most difficult graph properties are symmetric graphs, which require Ω(n2) bits per node, and non-3-colourable graphs, which require Ω(n2/log n) bits per node—any pure graph property admits a trivial proof of size O(n2).