Mutations in CTC1, encoding conserved telomere maintenance component 1, cause Coats plus.

Coats plus is a highly pleiotropic disorder particularly affecting the eye, brain, bone and gastrointestinal tract. Here, we show that Coats plus results from mutations in CTC1, encoding conserved telomere maintenance component 1, a member of the mammalian homolog of the yeast heterotrimeric CST telomeric capping complex. Consistent with the observation of shortened telomeres in an Arabidopsis CTC1 mutant and the phenotypic overlap of Coats plus with the telomeric maintenance disorders comprising dyskeratosis congenita, we observed shortened telomeres in three individuals with Coats plus and an increase in spontaneous γH2AX-positive cells in cell lines derived from two affected individuals. CTC1 is also a subunit of the α-accessory factor (AAF) complex, stimulating the activity of DNA polymerase-α primase, the only enzyme known to initiate DNA replication in eukaryotic cells. Thus, CTC1 may have a function in DNA metabolism that is necessary for but not specific to telomeric integrity.

Vaccination with a recombinant protein encoding the tumor-specific antigen NY-ESO-1 elicits an A2/157-165-specific CTL repertoire structurally distinct and of reduced tumor reactivity than that elicited by spontaneous immune responses to NY-ESO-1-expressing Tumors.

In a recent vaccination trial assessing the immunogenicity of an NY-ESO-1 (ESO) recombinant protein administered with Montanide and CpG, we have obtained evidence that this vaccine induces specific cytolytic T lymphocytes (CTL) in half of the patients. Most vaccine-induced CTLs were directed against epitopes located in the central part of the protein, between amino acids 81 and 110. This immunodominant region, however, is distinct from another ESO CTL region, 157-165, that is a frequent target of spontaneous CTL responses in A2+ patients bearing ESO tumors. In this study, we have investigated the CTL responses to ESO 157-165 in A2+ patients vaccinated with the recombinant protein. Our data indicate that after vaccination with the protein, CTL responses to ESO 157-165 are induced in some, but not all, A2+ patients. ESO 157-165-specific CTLs induced by vaccination with the ESO protein were functionally heterogeneous in terms of tumor recognition and often displayed decreased tumor reactivity as compared with ESO 157-165-specific CTLs isolated from patients with spontaneous immune responses to ESO. Remarkably, protein-induced CTLs used T-cell receptors similar to those previously isolated from patients vaccinated with synthetic ESO peptides (Vbeta4.1) and distinct from those used by highly tumor-reactive CTLs isolated from patients with spontaneous immune responses (Vbeta1.1, Vbeta8.1, and Vbeta13.1). Together, these results demonstrate that vaccination with the ESO protein elicits a repertoire of ESO 157-165-specific CTLs bearing T-cell receptors that are structurally distinct from those of CTLs found in spontaneous immune responses to the antigen and that are heterogeneous in terms of tumor reactivity, being often poorly tumor reactive.

Application of fuzzy-rule-based postprocessing to correlation methods in pattern recognition

One of the most important problems in optical pattern recognition by correlation is the appearance of sidelobes in the correlation plane, which causes false alarms. We present a method that eliminate sidelobes of up to a given height if certain conditions are satisfied. The method can be applied to any generalized synthetic discriminant function filter and is capable of rejecting lateral peaks that are even higher than the central correlation. Satisfactory results were obtained in both computer simulations and optical implementation.

Ruling out coronary artery disease in primary care: development and validation of a simple prediction rule.

BACKGROUND: Chest pain can be caused by various conditions, with life-threatening cardiac disease being of greatest concern. Prediction scores to rule out coronary artery disease have been developed for use in emergency settings. We developed and validated a simple prediction rule for use in primary care. METHODS: We conducted a cross-sectional diagnostic study in 74 primary care practices in Germany. Primary care physicians recruited all consecutive patients who presented with chest pain (n = 1249) and recorded symptoms and findings for each patient (derivation cohort). An independent expert panel reviewed follow-up data obtained at six weeks and six months on symptoms, investigations, hospital admissions and medications to determine the presence or absence of coronary artery disease. Adjusted odds ratios of relevant variables were used to develop a prediction rule. We calculated measures of diagnostic accuracy for different cut-off values for the prediction scores using data derived from another prospective primary care study (validation cohort). RESULTS: The prediction rule contained five determinants (age/sex, known vascular disease, patient assumes pain is of cardiac origin, pain is worse during exercise, and pain is not reproducible by palpation), with the score ranging from 0 to 5 points. The area under the curve (receiver operating characteristic curve) was 0.87 (95% confidence interval [CI] 0.83-0.91) for the derivation cohort and 0.90 (95% CI 0.87-0.93) for the validation cohort. The best overall discrimination was with a cut-off value of 3 (positive result 3-5 points; negative result <or= 2 points), which had a sensitivity of 87.1% (95% CI 79.9%-94.2%) and a specificity of 80.8% (77.6%-83.9%). INTERPRETATION: The prediction rule for coronary artery disease in primary care proved to be robust in the validation cohort. It can help to rule out coronary artery disease in patients presenting with chest pain in primary care.

False recognition following frontal lobe damage: The role of encoding factors

This paper reports a series of experiments on patient JB, a man with memory difficulties following damage to the left frontal lobe. The primary characteristic of JB's recognition memory impairment is a high level of false recognition together with a normal hit rate. The hypothesis that JB's false recognition reflects an over-reliance on familiarity is considered, but discounted on the basis that the false alarm rate is not affected by increasing the similarity between distracters and targets, and remains high when nonword stimuli are used. It is suggested, instead, that JB relies on a poorly focused memory description, which lacks item-specific detail but contains more general, low-level properties of the target items-these properties being held by many distracter items as well. This deficit is considered to arise because of damage to frontally mediated control processes involved in the selection of elements for memory encoding. An encoding deficit is supported by the fact that JB's false recognition is significantly reduced by orienting instructions, and is eliminated when his remote memory is subjected to recognition testing. In contrast, it is shown that manipulations at the level of retrieval (e.g. restricting the number of "old" responses) have little effect on his false recognition.

Fine structure of the vaccinia virus gene encoding the precursor of the major core protein 4 a.

A 6008 base pair fragment of the vaccinia virus DNA containing the gene for the precursor of the major core protein 4 a, which has been designated P4 a, was sequenced. A long open reading frame (ORF) encoding a protein of molecular weight 102,157 started close to the position where the P4 a mRNA had been mapped. Analysis of the mRNA by S1 nuclease mapping and primer extension indicated that the 5' end defined by the former method is not the true 5' end. This suggests that the P4 a coding region is preceded by leader sequences that are not derived from the immediate vicinity of the gene, similar to what has been reported for another late vaccinia virus mRNA. The sequenced DNA contained several further ORFs on the same, or opposite DNA strand, providing further evidence for the close spacing of protein-coding sequences in the viral genome.

A quantitative test of Hamilton's rule for the evolution of altruism.

The evolution of altruism is a fundamental and enduring puzzle in biology. In a seminal paper Hamilton showed that altruism can be selected for when rb - c > 0, where c is the fitness cost to the altruist, b is the fitness benefit to the beneficiary, and r is their genetic relatedness. While many studies have provided qualitative support for Hamilton's rule, quantitative tests have not yet been possible due to the difficulty of quantifying the costs and benefits of helping acts. Here we use a simulated system of foraging robots to experimentally manipulate the costs and benefits of helping and determine the conditions under which altruism evolves. By conducting experimental evolution over hundreds of generations of selection in populations with different c/b ratios, we show that Hamilton's rule always accurately predicts the minimum relatedness necessary for altruism to evolve. This high accuracy is remarkable given the presence of pleiotropic and epistatic effects as well as mutations with strong effects on behavior and fitness (effects not directly taken into account in Hamilton's original 1964 rule). In addition to providing the first quantitative test of Hamilton's rule in a system with a complex mapping between genotype and phenotype, these experiments demonstrate the wide applicability of kin selection theory.

The extreme core allocations of the assignment game

Although assignment games are hardly ever convex, in this paper a characterization of their set or extreme points of the core is provided, which is also valid for the class of convex games. For each ordering in the player set, a payoff vector is defined where each player receives his marginal contribution to a certain reduced game played by his predecessors. We prove that the whole set of reduced marginal worth vectors, which for convex games coincide with the usual marginal worth vectors, is the set of extreme points of the core of the assignment game

On the dimension of the core of the assignment game

The set of optimal matchings in the assignment matrix allows to define a reflexive and symmetric binary relation on each side of the market, the equal-partner binary relation. The number of equivalence classes of the transitive closure of the equal-partner binary relation determines the dimension of the core of the assignment game. This result provides an easy procedure to determine the dimension of the core directly from the entries of the assignment matrix and shows that the dimension of the core is not as much determined by the number of optimal matchings as by their relative position in the assignment matrix.

Single-valued solutions for the Böhm-Bawerk horse market game

Single-valued solutions for the case of two-sided market games without product differentiation, also known as Böhm-Bawerk horse market games, are analyzed. The nucleolus is proved to coincide with the tau-value, and is thus the midpoint of the core. Moreover a characterization of this setof games in terms of the assignment matrix is provided.

An axiomatization of the nucleolus of the assignment game

[cat] En el domini dels jocs bilaterals d’assignació, es presenta una axiomàtica del nucleolus com l´unica solució que compleix les propietats de consistència respecte del joc derivat definit per Owen (1992) i monotonia de les queixes dels sectors respecte de la seva cardinalitat. Com a conseqüència obtenim una caracterització geomètrica del nucleolus mitjançant una propietat de bisecció més forta que la que satisfan els punts del kernel (Maschler et al, 1979).

A note on the coincidence between Stackelberg and Nash equilibria in a differential game between government and firms

[cat] A Navas i Marín Solano es va demostrar la coincidència entre els equilibris de Nash i de Stackelberg per a una versi´o modificada del joc diferencial proposat por Lancaster (1973). Amb l’objectiu d’obtenir una solució interior, es van imposar restriccions importants sobre el valors dels paràmetres del model. En aquest treball estenem aquest resultat, en el límit en que la taxa de descompte és igual a zero, eliminant les restriccions i considerant totes les solucions possibles.

The assignment game: core bounds for mixed-pair coalitions

In the assignment game framework, we try to identify those assignment matrices in which no entry can be increased without changing the coreof the game. These games will be called buyer¿seller exact games and satisfy the condition that each mixed¿pair coalition attains the corresponding matrix entry in the core of the game. For a given assignment game, a unique buyerseller exact assignment game with the same core is proved to exist. In order to identify this matrix and to provide a characterization of those assignment games which are buyer¿seller exact in terms of the assignment matrix, attainable upper and lower core bounds for the mixed¿pair coalitions are found. As a consequence, an open question posed in Quint (1991) regarding a canonical representation of a ¿45o¿lattice¿ by means of the core of an assignment game can now be answered