Range-Wide Sex-Chromosome Sequence Similarity Supports Occasional XY Recombination in European Tree Frogs (Hyla arborea).

In contrast with mammals and birds, most poikilothermic vertebrates feature structurally undifferentiated sex chromosomes, which may result either from frequent turnovers, or from occasional events of XY recombination. The latter mechanism was recently suggested to be responsible for sex-chromosome homomorphy in European tree frogs (Hyla arborea). However, no single case of male recombination has been identified in large-scale laboratory crosses, and populations from NW Europe consistently display sex-specific allelic frequencies with male-diagnostic alleles, suggesting the absence of recombination in their recent history. To address this apparent paradox, we extended the phylogeographic scope of investigations, by analyzing the sequences of three sex-linked markers throughout the whole species distribution. Refugial populations (southern Balkans and Adriatic coast) show a mix of X and Y alleles in haplotypic networks, and no more within-individual pairwise nucleotide differences in males than in females, testifying to recurrent XY recombination. In contrast, populations of NW Europe, which originated from a recent postglacial expansion, show a clear pattern of XY differentiation; the X and Y gametologs of the sex-linked gene Med15 present different alleles, likely fixed by drift on the front wave of expansions, and kept differentiated since. Our results support the view that sex-chromosome homomorphy in H. arborea is maintained by occasional or historical events of recombination; whether the frequency of these events indeed differs between populations remains to be clarified.

Networks of Coordination : Swiss Business Associations as an Intermediary between Business, Politics and Administration during the 20th Century

Until the 1990's, Switzerland could be classified as either a corporatist, cooperative or coordinated market economy where non-market mechanisms of coordination among economic and political actors were very important. In this respect, Business Interest Associations (BIAs) played a key role. The aim of this paper is to look at the historical evolution of the five main peak Swiss BIAs through network analysis for five assorted dates during the 20th century (1910, 1937, 1957, 1980 and 2000) while relying on a database that includes more than 12,000 people. First, we examine the logic of membership in these associations, which allows us to analyze their position and function within the network of the Swiss economic elite. Until the 1980's, BIAs took part in the emergence and consolidation of a closely meshed national network, which declined during the two last decades of the 20th century. Second, we investigate the logic of influence of these associations by looking at the links they maintained with the political and administrative worlds through their links to the political parties and Parliament, and to the administration via the extra-parliamentary commissions (corporatist bodies). In both cases, the recent dynamic of globalization called into question the traditional role of BIAs.

Error and attack tolerance of layered complex networks.

Many complex systems may be described by not one but a number of complex networks mapped on each other in a multi-layer structure. Because of the interactions and dependencies between these layers, the state of a single layer does not necessarily reflect well the state of the entire system. In this paper we study the robustness of five examples of two-layer complex systems: three real-life data sets in the fields of communication (the Internet), transportation (the European railway system), and biology (the human brain), and two models based on random graphs. In order to cover the whole range of features specific to these systems, we focus on two extreme policies of system's response to failures, no rerouting and full rerouting. Our main finding is that multi-layer systems are much more vulnerable to errors and intentional attacks than they appear from a single layer perspective.

Evolutionary games on complex networks : the emergence and maintenance of cooperation

Abstract The object of game theory lies in the analysis of situations where different social actors have conflicting requirements and where their individual decisions will all influence the global outcome. In this framework, several games have been invented to capture the essence of various dilemmas encountered in many common important socio-economic situations. Even though these games often succeed in helping us understand human or animal behavior in interactive settings, some experiments have shown that people tend to cooperate with each other in situations for which classical game theory strongly recommends them to do the exact opposite. Several mechanisms have been invoked to try to explain the emergence of this unexpected cooperative attitude. Among them, repeated interaction, reputation, and belonging to a recognizable group have often been mentioned. However, the work of Nowak and May (1992) showed that the simple fact of arranging the players according to a spatial structure and only allowing them to interact with their immediate neighbors is sufficient to sustain a certain amount of cooperation even when the game is played anonymously and without repetition. Nowak and May's study and much of the following work was based on regular structures such as two-dimensional grids. Axelrod et al. (2002) showed that by randomizing the choice of neighbors, i.e. by actually giving up a strictly local geographical structure, cooperation can still emerge, provided that the interaction patterns remain stable in time. This is a first step towards a social network structure. However, following pioneering work by sociologists in the sixties such as that of Milgram (1967), in the last few years it has become apparent that many social and biological interaction networks, and even some technological networks, have particular, and partly unexpected, properties that set them apart from regular or random graphs. Among other things, they usually display broad degree distributions, and show small-world topological structure. Roughly speaking, a small-world graph is a network where any individual is relatively close, in terms of social ties, to any other individual, a property also found in random graphs but not in regular lattices. However, in contrast with random graphs, small-world networks also have a certain amount of local structure, as measured, for instance, by a quantity called the clustering coefficient. In the same vein, many real conflicting situations in economy and sociology are not well described neither by a fixed geographical position of the individuals in a regular lattice, nor by a random graph. Furthermore, it is a known fact that network structure can highly influence dynamical phenomena such as the way diseases spread across a population and ideas or information get transmitted. Therefore, in the last decade, research attention has naturally shifted from random and regular graphs towards better models of social interaction structures. The primary goal of this work is to discover whether or not the underlying graph structure of real social networks could give explanations as to why one finds higher levels of cooperation in populations of human beings or animals than what is prescribed by classical game theory. To meet this objective, I start by thoroughly studying a real scientific coauthorship network and showing how it differs from biological or technological networks using divers statistical measurements. Furthermore, I extract and describe its community structure taking into account the intensity of a collaboration. Finally, I investigate the temporal evolution of the network, from its inception to its state at the time of the study in 2006, suggesting also an effective view of it as opposed to a historical one. Thereafter, I combine evolutionary game theory with several network models along with the studied coauthorship network in order to highlight which specific network properties foster cooperation and shed some light on the various mechanisms responsible for the maintenance of this same cooperation. I point out the fact that, to resist defection, cooperators take advantage, whenever possible, of the degree-heterogeneity of social networks and their underlying community structure. Finally, I show that cooperation level and stability depend not only on the game played, but also on the evolutionary dynamic rules used and the individual payoff calculations. Synopsis Le but de la théorie des jeux réside dans l'analyse de situations dans lesquelles différents acteurs sociaux, avec des objectifs souvent conflictuels, doivent individuellement prendre des décisions qui influenceront toutes le résultat global. Dans ce cadre, plusieurs jeux ont été inventés afin de saisir l'essence de divers dilemmes rencontrés dans d'importantes situations socio-économiques. Bien que ces jeux nous permettent souvent de comprendre le comportement d'êtres humains ou d'animaux en interactions, des expériences ont montré que les individus ont parfois tendance à coopérer dans des situations pour lesquelles la théorie classique des jeux prescrit de faire le contraire. Plusieurs mécanismes ont été invoqués pour tenter d'expliquer l'émergence de ce comportement coopératif inattendu. Parmi ceux-ci, la répétition des interactions, la réputation ou encore l'appartenance à des groupes reconnaissables ont souvent été mentionnés. Toutefois, les travaux de Nowak et May (1992) ont montré que le simple fait de disposer les joueurs selon une structure spatiale en leur permettant d'interagir uniquement avec leurs voisins directs est suffisant pour maintenir un certain niveau de coopération même si le jeu est joué de manière anonyme et sans répétitions. L'étude de Nowak et May, ainsi qu'un nombre substantiel de travaux qui ont suivi, étaient basés sur des structures régulières telles que des grilles à deux dimensions. Axelrod et al. (2002) ont montré qu'en randomisant le choix des voisins, i.e. en abandonnant une localisation géographique stricte, la coopération peut malgré tout émerger, pour autant que les schémas d'interactions restent stables au cours du temps. Ceci est un premier pas en direction d'une structure de réseau social. Toutefois, suite aux travaux précurseurs de sociologues des années soixante, tels que ceux de Milgram (1967), il est devenu clair ces dernières années qu'une grande partie des réseaux d'interactions sociaux et biologiques, et même quelques réseaux technologiques, possèdent des propriétés particulières, et partiellement inattendues, qui les distinguent de graphes réguliers ou aléatoires. Entre autres, ils affichent en général une distribution du degré relativement large ainsi qu'une structure de "petit-monde". Grossièrement parlant, un graphe "petit-monde" est un réseau où tout individu se trouve relativement près de tout autre individu en termes de distance sociale, une propriété également présente dans les graphes aléatoires mais absente des grilles régulières. Par contre, les réseaux "petit-monde" ont, contrairement aux graphes aléatoires, une certaine structure de localité, mesurée par exemple par une quantité appelée le "coefficient de clustering". Dans le même esprit, plusieurs situations réelles de conflit en économie et sociologie ne sont pas bien décrites ni par des positions géographiquement fixes des individus en grilles régulières, ni par des graphes aléatoires. De plus, il est bien connu que la structure même d'un réseau peut passablement influencer des phénomènes dynamiques tels que la manière qu'a une maladie de se répandre à travers une population, ou encore la façon dont des idées ou une information s'y propagent. Ainsi, durant cette dernière décennie, l'attention de la recherche s'est tout naturellement déplacée des graphes aléatoires et réguliers vers de meilleurs modèles de structure d'interactions sociales. L'objectif principal de ce travail est de découvrir si la structure sous-jacente de graphe de vrais réseaux sociaux peut fournir des explications quant aux raisons pour lesquelles on trouve, chez certains groupes d'êtres humains ou d'animaux, des niveaux de coopération supérieurs à ce qui est prescrit par la théorie classique des jeux. Dans l'optique d'atteindre ce but, je commence par étudier un véritable réseau de collaborations scientifiques et, en utilisant diverses mesures statistiques, je mets en évidence la manière dont il diffère de réseaux biologiques ou technologiques. De plus, j'extrais et je décris sa structure de communautés en tenant compte de l'intensité d'une collaboration. Finalement, j'examine l'évolution temporelle du réseau depuis son origine jusqu'à son état en 2006, date à laquelle l'étude a été effectuée, en suggérant également une vue effective du réseau par opposition à une vue historique. Par la suite, je combine la théorie évolutionnaire des jeux avec des réseaux comprenant plusieurs modèles et le réseau de collaboration susmentionné, afin de déterminer les propriétés structurelles utiles à la promotion de la coopération et les mécanismes responsables du maintien de celle-ci. Je mets en évidence le fait que, pour ne pas succomber à la défection, les coopérateurs exploitent dans la mesure du possible l'hétérogénéité des réseaux sociaux en termes de degré ainsi que la structure de communautés sous-jacente de ces mêmes réseaux. Finalement, je montre que le niveau de coopération et sa stabilité dépendent non seulement du jeu joué, mais aussi des règles de la dynamique évolutionnaire utilisées et du calcul du bénéfice d'un individu.

Recurrent Hepatitis C After Liver Transplantation Experience of the First 21 Patients Treated in Lausanne

BACKGROUND AND AIM: Recurrent hepatitis C is a major cause of morbidity and mortality after liver transplantation (LT), and optimal treatment algorithms have yet to be defined. Here, we present our experience of the first 21 patients with recurrent hepatitis C treated in Lausanne. PATIENTS AND METHODS: Twenty-one patients with histologyproven recurrent hepatitis C after LT were treated since 2003. Treatment was initiated with pegylated interferon-α2a 135 μg per week and ribavirin 400 mg per day in the majority of patients, and subsequent doses were adapted individually based on on-treatment virological responses and clinical and/or biochemical side effects. RESULTS: On an intention-to-treat basis, sustained virological response (SVR) was achieved in 12/21 (57%) patients (5/11 [45%], 2/3 [67%], 4/5 [80%] and 1/2 [50%] of patients infected with genotypes 1, 2, 3 and 4, respectively). Two patients experienced relapse and 6 did not respond to treatment (NR). Treatment duration ranged from 24 to 90 weeks. It was stopped prematurely due to adverse events in 5/21 (24%) patients (with SVR achieved in 2 patients, NR in 2 patients, and death of one patient awaiting re-transplantation). Of note, SVR was achieved in a patient with combined liver and kidney transplantation. Importantly, SVR was achieved in some patients despite the lack of an early virological response or HCV RNA negativity at week 24. Darbepoetin α and filgrastim were used in 33% and 14%, respectively. CONCLUSION: Individually adapted treatment of recurrent hepatitis C can achieve SVR in a substantial proportion of LT patients. Conventional stopping rules do not apply in this setting so that prolonged therapy may be useful in selected patients.

Video-assisted right supradiaphragmatic thoracic duct ligation for non-traumatic recurrent chylothorax

BACKGROUND: Chylothorax is an uncommon disorder with respiratory, nutritional and immunological manifestations. Surgical management is indicated in case of recurrence or failure after conservative treatment. We report our experience with video-assisted right-sided supradiaphragmatic thoracic duct ligation for non-traumatic, non-postoperative persistent or recurrent chylothorax. PATIENTS AND METHODS: The medical records of six patients operated at our institution between 1999 and 2004 were retrospectively reviewed. A right-sided chylothorax was found in four patients, a left-sided in one, and a bilateral in one. Three patients developed chylothorax after chemotherapy and chest irradiation for malignant diseases (lymphoma in two patients and breast cancer in one), one in the context of lymphangioleiomyomatosis, one due to a non-diagnosed lymphoma, and one after heart transplantation. RESULTS: The mean operative time was 102 min, with an average length of hospital stay of 14 days. Persistent cessation of chylous effusion within 7 days after surgery was observed in 5/6 patients without recurrence during a mean follow-up time of 41 months. One patient with undiagnosed mediastinal lymphoma required re-operation and thoracic duct ligation on day 8 by right-sided thoracotomy due to persistent chylothorax. No 30-day mortality was recorded. Two patients presented postoperative complications including respiratory insufficiency requiring mechanical ventilation in one, and chylous ascites development requiring peritoneo-venous LeVeen shunting in one patient. CONCLUSIONS: Recurrent or persistent non-traumatic chylothorax may be successfully treated by video-assisted right supradiaphragmatic thoracic duct ligation.

Recurrent stroke predictors differ in medically treated patients with pathogenic vs. other PFOs.

OBJECTIVE: To examine predictors of stroke recurrence in patients with a high vs a low likelihood of having an incidental patent foramen ovale (PFO) as defined by the Risk of Paradoxical Embolism (RoPE) score. METHODS: Patients in the RoPE database with cryptogenic stroke (CS) and PFO were classified as having a probable PFO-related stroke (RoPE score of >6, n = 647) and others (RoPE score of ≤6 points, n = 677). We tested 15 clinical, 5 radiologic, and 3 echocardiographic variables for associations with stroke recurrence using Cox survival models with component database as a stratification factor. An interaction with RoPE score was checked for the variables that were significant. RESULTS: Follow-up was available for 92%, 79%, and 57% at 1, 2, and 3 years. Overall, a higher recurrence risk was associated with an index TIA. For all other predictors, effects were significantly different in the 2 RoPE score categories. For the low RoPE score group, but not the high RoPE score group, older age and antiplatelet (vs warfarin) treatment predicted recurrence. Conversely, echocardiographic features (septal hypermobility and a small shunt) and a prior (clinical) stroke/TIA were significant predictors in the high but not low RoPE score group. CONCLUSION: Predictors of recurrence differ when PFO relatedness is classified by the RoPE score, suggesting that patients with CS and PFO form a heterogeneous group with different stroke mechanisms. Echocardiographic features were only associated with recurrence in the high RoPE score group.

Exome sequencing identifies recurrent somatic MAP2K1 and MAP2K2 mutations in melanoma.

We performed exome sequencing to detect somatic mutations in protein-coding regions in seven melanoma cell lines and donor-matched germline cells. All melanoma samples had high numbers of somatic mutations, which showed the hallmark of UV-induced DNA repair. Such a hallmark was absent in tumor sample-specific mutations in two metastases derived from the same individual. Two melanomas with non-canonical BRAF mutations harbored gain-of-function MAP2K1 and MAP2K2 (MEK1 and MEK2, respectively) mutations, resulting in constitutive ERK phosphorylation and higher resistance to MEK inhibitors. Screening a larger cohort of individuals with melanoma revealed the presence of recurring somatic MAP2K1 and MAP2K2 mutations, which occurred at an overall frequency of 8%. Furthermore, missense and nonsense somatic mutations were frequently found in three candidate melanoma genes, FAT4, LRP1B and DSC1.

Adolescent support networks in a health care context: the interface between health, family and education

AbstractOBJECTIVEAnalyze adolescents' perceptions about support networks and their health needs.METHODAnalytical and interpretive study using focus groups conducted in municipal state schools in Fortaleza, in the State of Ceará during the first semester of 2012. The sample comprised 36 male and female adolescents aged between 13 and 16 years attending the ninth grade of the second phase of elementary school.RESULTSThematic analysis revealed that the health care support network and interaction between health professionals, education professionals and family members was insufficient, constituting a lack of an integrated network to enable and provide support for health promotion.CONCLUSIONCoordination between education, health and family services has the potential to act as a support network to help meet adolescents' healthcare needs and demands.

Reconciliation of metabolites and biochemical reactions for metabolic networks.

Genome-scale metabolic network reconstructions are now routinely used in the study of metabolic pathways, their evolution and design. The development of such reconstructions involves the integration of information on reactions and metabolites from the scientific literature as well as public databases and existing genome-scale metabolic models. The reconciliation of discrepancies between data from these sources generally requires significant manual curation, which constitutes a major obstacle in efforts to develop and apply genome-scale metabolic network reconstructions. In this work, we discuss some of the major difficulties encountered in the mapping and reconciliation of metabolic resources and review three recent initiatives that aim to accelerate this process, namely BKM-react, MetRxn and MNXref (presented in this article). Each of these resources provides a pre-compiled reconciliation of many of the most commonly used metabolic resources. By reducing the time required for manual curation of metabolite and reaction discrepancies, these resources aim to accelerate the development and application of high-quality genome-scale metabolic network reconstructions and models.

Biana: a software framework for compiling biological interactions and analyzing networks

Background: The analysis and usage of biological data is hindered by the spread of information across multiple repositories and the difficulties posed by different nomenclature systems and storage formats. In particular, there is an important need for data unification in the study and use of protein-protein interactions. Without good integration strategies, it is difficult to analyze the whole set of available data and its properties.Results: We introduce BIANA (Biologic Interactions and Network Analysis), a tool for biological information integration and network management. BIANA is a Python framework designed to achieve two major goals: i) the integration of multiple sources of biological information, including biological entities and their relationships, and ii) the management of biological information as a network where entities are nodes and relationships are edges. Moreover, BIANA uses properties of proteins and genes to infer latent biomolecular relationships by transferring edges to entities sharing similar properties. BIANA is also provided as a plugin for Cytoscape, which allows users to visualize and interactively manage the data. A web interface to BIANA providing basic functionalities is also available. The software can be downloaded under GNU GPL license from http://sbi.imim.es/web/BIANA.php.Conclusions: BIANA's approach to data unification solves many of the nomenclature issues common to systems dealing with biological data. BIANA can easily be extended to handle new specific data repositories and new specific data types. The unification protocol allows BIANA to be a flexible tool suitable for different user requirements: non-expert users can use a suggested unification protocol while expert users can define their own specific unification rules.

On the distribution of income and worker assignment under intra-firm spillovers, with an application to ideas and networks

We study the earnings structure and the equilibrium assignment of workers when workers exert intra-firm spillovers on each other.We allow for arbitrary spillovers provided output depends on some aggregate index of workers' skill. Despite the possibility of increasing returns to skills, equilibrium typically exists. We show that equilibrium will typically be segregated; that the skill space can be partitioned into a set of segments and any firm hires from only one segment. Next, we apply the model to analyze the effect of information technology on segmentation and the distribution of income. There are two types of human capital, productivity and creativity, i.e. the ability to produce ideas that may be duplicated over a network. Under plausible assumptions, inequality rises and then falls when network size increases, and the poorest workers cannot lose. We also analyze the impact of an improvement in worker quality and of an increased international mobility of ideas.

Recurrent dominant mutations affecting two adjacent residues in the motor domain of the monomeric kinesin KIF22 result in skeletal dysplasia and joint laxity.

Spondyloepimetaphyseal dysplasia with joint laxity, leptodactylic type (lepto-SEMDJL, aka SEMDJL, Hall type), is an autosomal dominant skeletal disorder that, in spite of being relatively common among skeletal dysplasias, has eluded molecular elucidation so far. We used whole-exome sequencing of five unrelated individuals with lepto-SEMDJL to identify mutations in KIF22 as the cause of this skeletal condition. Missense mutations affecting one of two adjacent amino acids in the motor domain of KIF22 were present in 20 familial cases from eight families and in 12 other sporadic cases. The skeletal and connective tissue phenotype produced by these specific mutations point to functions of KIF22 beyond those previously ascribed functions involving chromosome segregation. Although we have found Kif22 to be strongly upregulated at the growth plate, the precise pathogenetic mechanisms remain to be elucidated.