Compact routing schemes for chordal graphs using one tree

In this paper we present a two new compact routing schemes designed for chordal graphs, i.e. graphs containing no induced cycle of length greater than 3. The main idea of these two routing schemes is constructing one spanning tree and adding some shortucts. The first one, insures that the length of the route between all pairs of vertices never exceed their distance plus 2 (deviation at most 2), and uses addresses and local tables of O(log2 n) bits per node. The previous bests schemes in date that guarantees the same deviation has a memory requirement of O(log3 n/loglog n) bits per vertex [DG02,DYL04], and the previous one with the same memory requirement, guarantees only a deviation at most 4 [Douris04]. The second routing scheme guarantees a deviation 1, with addresses of O(log n) bits and local tables of O(klog n) bits per node, where k is the size of the maximum clique of the graph. The last routing scheme in date depending on k, has the same memory requirement, but guarantees only a deviation at most 2 [Douris02]

Extraction and classification of dense communities in the Web

The World Wide Web (WWW) is rapidly becoming important for society as a medium for sharing data, information and services, and there is a growing interest in tools for understanding collective behaviors and emerging phenomena in the WWW. In this paper we focus on the problem of searching and classifying communities in the web. Loosely speaking a community is a group of pages related to a common interest. More formally communities have been associated in the computer science literature with the existence of a locally dense sub-graph of the web-graph (where web pages are nodes and hyper-links are arcs of the web-graph) The core of our contribution is a new scalable algorithm for finding relatively dense subgraphs in massive graphs. We apply our algorithm on web-graphs built on three publicly available large crawls of the web (with raw sizes up to 120M nodes and 1G arcs). The effectiveness of our algorithm in finding dense subgraphs is demonstrated experimentally by embedding artificial communities in the web-graph and counting how many of these are blindly found. Effectiveness increases with the size and density of the communities: it is close to 100% for dense communities of a hundred nodes or more. Moreover it is still about 80% even for small communities of twenty nodes and density at 50% of the arcs present. We complete our Community Watch system by clustering the communities found in the web-graph into homogeneous groups by topic and labelling each group by representative keywords

A cautionary note: False homozygosity for BRCA2 6174delT mutation resulting from a single nucleotide polymorphism masking the wt allele

Sequencing an amplification product of the terminal segment of BRCA2 exon 11 showed apparent homozygosity for the 6174delT mutation in two healthy sisters. Subsequent sequencing of an alternate overlapping amplicon revealed the presence of the 5972C>T polymorphism, which is within the standard upstream amplification primer. This mismatch was responsible for the failure to amplify the normal (5972T) allele in both sisters who were heterozygous for the 6174delT mutation. Though the unexpected finding of apparent homozygosity for the 6174delT mutation prompted re-evaluation of the assay, the potential for false negative results due to masking of a mutation-bearing allele by such a circumstance should be a cautionary note for the testing and also in the interpretation of the results published under such assay conditions.Fil: Solano, Angela Rosario. Instituto Alexander Fleming; Argentina. Universidad de Buenos Aires. Facultad de Medicina; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Houssay. Instituto de Investigaciones Biomédicas. Universidad de Buenos Aires. Facultad de Medicina. Instituto de Investigaciones Biomédicas; ArgentinaFil: Dourisboure, Ricardo J.. Instituto Alexander Fleming; ArgentinaFil: Weitzel, Jeffrey. City of Hope Cancer Center; Estados UnidosFil: Podesta, Ernesto Jorge. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Houssay. Instituto de Investigaciones Biomédicas. Universidad de Buenos Aires. Facultad de Medicina. Instituto de Investigaciones Biomédicas; Argentin

Bahnar deithu Salbaiak

Dialecto : tetxo en euskera navarro-labortanoS. XX -- Periodo : último euskera modernoEuskalkia : nafar-lapurteraXX. md. -- Aroa : azken euskara modernoaDigitalización. Vitoria-Gasteiz : Fundación Sancho el Sabio, 200

Analysis of the RET protooncogene in multiple endocrine neoplasia 2A and in familial medullary thyroid carcinoma: Clinical-pathological findings in asymptomatic carriers

El 25% de los carcinomas medulares de tiroides son hereditarios. Se presentan en forma de familiar (CMTF 5%) o como neoplasia endocrina múltiple (MEN) tipo 2A (17%) o 2B (3%), y comparten la herencia, autosómica dominante, de una mutación germinal en el protooncogen RET en uno de 12 codones conocidos. Estudiamos 7 familias (5 CMTF y 2 MEN 2A) con el objeto de detectar la mutación familiar e identificar a los portadores asintomáticos. Seis de las siete mutaciones (4 CMTF y 2 MEN 2A) fueron en el codón más frecuente, el 634, y una familia con CMTF presentó una mutación germinal novel: una transición T>C en el codón 630, resultando el cambio C630A. De los 57 individuos estudiados, 25 (43.85 %) fueron portadores de la mutación, 7 de éstos (28%) eran portadores asintomáticos de los cuales 5 eran niños, con una edad X–=11±3.2 años y fueron tiroidectomizados. Presentaron hiperplasia de células C y focos de microcarcinoma en ambos lóbulos tiroideos aun cuando la calcitonina basal o estimulada con pentagastrina fueron normales. En conclusión, describimos una mutación germinal novel en el protooncogen RET: C630A y el hallazgo de enfermedad de la célula C en los portadores asintomáticos, que enfatiza la importancia de la tiroidectomía profiláctica tan pronto como se confirma el diagnóstico molecular.Twenty five percent of the medullary thyroid carcinoma (MTC) is hereditary and 5% is familiar (FMTC), or considered as multiple endocrine neoplasia (MEN) type 2A (17%) or 2B (3%). These diseases are the result of the autosomic dominant inheritance of a mutation in the RET protooncogene, in one out of 12 different known codons. We analyzed 7 families (2 MEN 2A and 5 FMTC). Six mutations were detected in the most frequent codon, 634 (2 MEN 2A y 4 FMTC) and one family with FMTC presented a novel mutation: a transition T>C at codon 630, resulting a C630A change. Among 57 individuals studied, 25 (43.85%) presented the mutation. Seven (28%) were asymptomatic carriers, including 5 children aged 11±3.2 years. The children underwent total thyroidectomy. The histopathologic examination showed C cells hyperplasia and microcarcinoma focus in both lobes, even in the presence of normal, basal or pentagastrine stimulated, calcitonine levels. In conclusion, we describe a germline novel mutation in the RET protooncogene: C630A; and the corresponding findings of C-cell disease in gene mutated carriers that emphasize the importance of prophylactic thyroidectomy as soon as the molecular diagnosis is confirmed.Fil: Belli, Susana Haydee. Instituto Alexander Fleming; Argentina. Gobierno de la Ciudad Autónoma de Buenos Aires. Hospital General de Agudos Carlos Durand; ArgentinaFil: Storani, María E.. Hospital de San Isidro; ArgentinaFil: Dourisboure, Ricardo J.. Hospital de San Isidro; ArgentinaFil: Podesta, Ernesto Jorge. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Houssay. Instituto de Investigaciones Biomédicas. Universidad de Buenos Aires. Facultad de Medicina. Instituto de Investigaciones Biomédicas; ArgentinaFil: Solano, Angela Rosario. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Houssay. Instituto de Investigaciones Biomédicas. Universidad de Buenos Aires. Facultad de Medicina. Instituto de Investigaciones Biomédicas; Argentin

Line-distortion, Bandwidth and Path-length of a graph

We investigate the minimum line-distortion and the minimum bandwidth problems on unweighted graphs and their relations with the minimum length of a Robertson-Seymour's path-decomposition. The length of a path-decomposition of a graph is the largest diameter of a bag in the decomposition. The path-length of a graph is the minimum length over all its path-decompositions. In particular, we show: - if a graph $G$ can be embedded into the line with distortion $k$, then $G$ admits a Robertson-Seymour's path-decomposition with bags of diameter at most $k$ in $G$; - for every class of graphs with path-length bounded by a constant, there exist an efficient constant-factor approximation algorithm for the minimum line-distortion problem and an efficient constant-factor approximation algorithm for the minimum bandwidth problem; - there is an efficient 2-approximation algorithm for computing the path-length of an arbitrary graph; - AT-free graphs and some intersection families of graphs have path-length at most 2; - for AT-free graphs, there exist a linear time 8-approximation algorithm for the minimum line-distortion problem and a linear time 4-approximation algorithm for the minimum bandwidth problem

Fast approximation of centrality and distances in hyperbolic graphs

We show that the eccentricities (and thus the centrality indices) of all vertices of a $\delta$-hyperbolic graph $G=(V,E)$ can be computed in linear time with an additive one-sided error of at most $c\delta$, i.e., after a linear time preprocessing, for every vertex $v$ of $G$ one can compute in $O(1)$ time an estimate $\hat{e}(v)$ of its eccentricity $ecc_G(v)$ such that $ecc_G(v)\leq \hat{e}(v)\leq ecc_G(v)+ c\delta$ for a small constant $c$. We prove that every $\delta$-hyperbolic graph $G$ has a shortest path tree, constructible in linear time, such that for every vertex $v$ of $G$, $ecc_G(v)\leq ecc_T(v)\leq ecc_G(v)+ c\delta$. These results are based on an interesting monotonicity property of the eccentricity function of hyperbolic graphs: the closer a vertex is to the center of $G$, the smaller its eccentricity is. We also show that the distance matrix of $G$ with an additive one-sided error of at most $c'\delta$ can be computed in $O(|V|^2\log^2|V|)$ time, where $c'< c$ is a small constant. Recent empirical studies show that many real-world graphs (including Internet application networks, web networks, collaboration networks, social networks, biological networks, and others) have small hyperbolicity. So, we analyze the performance of our algorithms for approximating centrality and distance matrix on a number of real-world networks. Our experimental results show that the obtained estimates are even better than the theoretical bounds.Comment: arXiv admin note: text overlap with arXiv:1506.01799 by other author

Microsatellite instability analysis in hereditary non-polyposis colon cancer using the Bethesda consensus panel of microsatellite markers in the absence of proband normal tissue

BACKGROUND: Hereditary non-polyposis colon cancer (HNPCC) is an autosomal dominant syndrome predisposing to the early development of various cancers including those of colon, rectum, endometrium, ovarium, small bowel, stomach and urinary tract. HNPCC is caused by germline mutations in the DNA mismatch repair genes, mostly hMSH2 or hMLH1. In this study, we report the analysis for genetic counseling of three first-degree relatives (the mother and two sisters) of a male who died of colorectal adenocarcinoma at the age of 23. The family fulfilled strict Amsterdam-I criteria (AC-I) with the presence of extracolonic tumors in the extended pedigree. We overcame the difficulty of having a proband post-mortem non-tumor tissue sample for MSI testing by studying the alleles carried by his progenitors. METHODS: Tumor MSI testing is described as initial screening in both primary and metastasis tumor tissue blocks, using the reference panel of 5 microsatellite markers standardized by the National Cancer Institute (NCI) for the screening of HNPCC (BAT-25, BAT-26, D2S123, D5S346 and D17S250). Subsequent mutation analysis of the hMLH1 and hMSH2 genes was performed. RESULTS: Three of five microsatellite markers (BAT-25, BAT-26 and D5S346) presented different alleles in the proband's tumor as compared to those inherited from his parents. The tumor was classified as high frequency microsatellite instability (MSI-H). We identified in the HNPCC family a novel germline missense (c.1864C>A) mutation in exon 12 of hMSH2 gene, leading to a proline 622 to threonine (p.Pro622Thr) amino acid substitution. CONCLUSION: This approach allowed us to establish the tumor MSI status using the NCI recommended panel in the absence of proband's non-tumor tissue and before sequencing the obligate carrier. According to the Human Gene Mutation Database (HGMD) and the International Society for Gastrointestinal Hereditary Tumors (InSiGHT) Database this is the first report of this mutation

Community detection in graphs

The modern science of networks has brought significant advances to our understanding of complex systems. One of the most relevant features of graphs representing real systems is community structure, or clustering, i. e. the organization of vertices in clusters, with many edges joining vertices of the same cluster and comparatively few edges joining vertices of different clusters. Such clusters, or communities, can be considered as fairly independent compartments of a graph, playing a similar role like, e. g., the tissues or the organs in the human body. Detecting communities is of great importance in sociology, biology and computer science, disciplines where systems are often represented as graphs. This problem is very hard and not yet satisfactorily solved, despite the huge effort of a large interdisciplinary community of scientists working on it over the past few years. We will attempt a thorough exposition of the topic, from the definition of the main elements of the problem, to the presentation of most methods developed, with a special focus on techniques designed by statistical physicists, from the discussion of crucial issues like the significance of clustering and how methods should be tested and compared against each other, to the description of applications to real networks.Comment: Review article. 103 pages, 42 figures, 2 tables. Two sections expanded + minor modifications. Three figures + one table + references added. Final version published in Physics Report

Les sauvages Ba-Hnars (cochinchine orientale) souvenirs d'un missionnaire

xvi, 341 p. ; 21 cm