Computational problems in perfect phylogeny haplotyping: typing without calling the allele.

A haplotype is an m-long binary vector. The XOR-genotype of two haplotypes is the m-vector of their coordinate-wise XOR. We study the following problem: Given a set of XOR-genotypes, reconstruct their haplotypes so that the set of resulting haplotypes can be mapped onto a perfect phylogeny (PP) tree. The question is motivated by studying population evolution in human genetics, and is a variant of the perfect phylogeny haplotyping problem that has received intensive attention recently. Unlike the latter problem, in which the input is "full" genotypes, here we assume less informative input, and so may be more economical to obtain experimentally. Building on ideas of Gusfield, we show how to solve the problem in polynomial time, by a reduction to the graph realization problem. The actual haplotypes are not uniquely determined by that tree they map onto, and the tree itself may or may not be unique. We show that tree uniqueness implies uniquely determined haplotypes, up to inherent degrees of freedom, and give a sufficient condition for the uniqueness. To actually determine the haplotypes given the tree, additional information is necessary. We show that two or three full genotypes suffice to reconstruct all the haplotypes, and present a linear algorithm for identifying those genotypes.

Internal and external fluctuations around nonequilibrium steady states in one-dimensional heat-conduction problems

Thermal fluctuations around inhomogeneous nonequilibrium steady states of one-dimensional rigid heat conductors are analyzed in the framework of generalized fluctuating hydrodynamics. The effect of an external source of noise is also considered. External fluctuations come from temperature and position fluctuations of the source. Contributions of each kind of noise to the temperature correlation function are computed and compared through the study of its asymptotic behavior.

Sequential decisions in allocation problems

[eng] In the context of cooperative TU-games, and given an order of players, we consider the problem of distributing the worth of the grand coalition as a sequentia decision problem. In each step of process, upper and lower bounds for the payoff of the players are required related to successive reduced games. Sequentially compatible payoffs are defined as those allocation vectors that meet these recursive bounds. The core of the game is reinterpreted as a set of sequentally compatible payoffs when the Davis-Maschler reduced game is considered (Th.1). Independently of the reduction, the core turns out to be the intersections of the family of the sets of sequentially compatible payoffs corresponding to the different possible orderings (Th.2), so it is in some sense order-independent. Finally, we analyze advantagenous properties for the first player

Heterogeneous discounting in consumption-investment problems. Time consistent solutions

[cat] En aquest treball s'analitza un model estocàstic en temps continu en el que l'agent decisor descompta les utilitats instantànies i la funció final amb taxes de preferència temporal constants però diferents. En aquest context es poden modelitzar problemes en els quals, quan el temps s'acosta al moment final, la valoració de la funció final incrementa en comparació amb les utilitats instantànies. Aquest tipus d'asimetria no es pot descriure ni amb un descompte estàndard ni amb un variable. Per tal d'obtenir solucions consistents temporalment es deriva l'equació de programació dinàmica estocàstica, les solucions de la qual són equilibris Markovians. Per a aquest tipus de preferències temporals, s'estudia el model clàssic de consum i inversió (Merton, 1971) per a les funcions d'utilitat del tipus CRRA i CARA, comparant els equilibris Markovians amb les solucions inconsistents temporalment. Finalment es discuteix la introducció del temps final aleatori.

Collaboration entre médecin de famille et psychiatre pour les problèmes de santé mentale [Family physicians and psychiatrists' collaborative care for mental health problems].

The burden of disease linked to mental disorders represents more than one-fifth of years lived with disability in the world. Less than half of people suffering from mental disorders are adequately treated. Three quarter of those who receive treatment are followed by primary care. Collaborative care aims to increase the efficiency of direct general practitioner's treatment. Main components are sustainable and individualized consultation-liaison relationship (1/2 day of psychiatrist by 15 days for 10-15 general practitioners), and support of a clinical case manager for complex situations. Collaboration is bidirectional: early or crisis access to specialist care and long-term followup by general practitioner. This model is a challenge for the doctor-patient dual relationship and requires incentives in a public health perspective.

Prise en charge des patients avec des problèmes d'alcool: quelle efficacité? Quelques éléments de réponse à partir d'une revue de la littérature [Management of patients with alcohol problems: how effective? Several response factors based on a review of the literature]

What do we know about the effectiveness of various treatments of alcoholism? This review of literature shows that lack--or weaknesses--of published studies make it impossible to draw definite conclusions. Rigorous controlled studies show high rates of spontaneous remission and important uncertainties about specialised treatments of alcoholism. However, except for severe dependence that may well require a different approach, brief interventions conducted by non-specialists have proved highly effective for at-risk alcohol drinkers: based on minimal medical advice, they increase the chances of lowering alcohol consumption. General practitioners may thus represent on important link in the therapeutic chain.