Clinical significance of lifetime panic disorder in the course of bipolar disorder type I

Objectives: The aim of the study was to analyze the impact of lifetime panic disorder (PD) diagnosis in a sample of patients with bipolar disorder type I (BPI), evaluating clinical and demographic variables. Methods: Ninety-five outpatients from the Bipolar Disorder Research Program at the Institute of Psychiatry of the University of Sao Paulo Medical School were enrolled. Twenty-seven BPI patients with PD were compared to 68 BPI patients without any anxiety disorders regarding clinical and demographic variables. Results: Compared to BPI patients without any anxiety disorders, patients with BPI + PD presented significantly higher number of mood episodes (18.9 +/- 13.8 vs 8.5 +/- 7.8; P < .001), depressive episodes (10.8 +/- 8.2 vs 4.6 +/- 4,8; P = .001), and manic episodes (7.4 +/- 7.3 vs 3.6 +/- 3.6; P = .008). Patients with BPI + PD had more frequently a depressive episode as their first one compared to BPI patients without anxiety disorders (94.1% vs 57.5%; P = .011). Patients with BPI + PD had more comorbidity with lifetime diagnosis of drug abuse or dependence (33.3% vs 8.8%; P = .010) and eating disorders (29.6% vs 6.0%; P = .004). Conclusions: The higher number of mood episodes in general presented by patients with BPI + PD when compared with BPI patients without any anxiety disorders, along with the higher frequencies of drug misuse and eating disorders, indicates that PD comorbidity is associated with a poorer Course and outcome of BPI. The higher frequency of depression as the onset mood episode and the higher number of manic episodes in the group with PD may have important treatment implications and should be further investigated. (C) 2009 Elsevier Inc. All rights reserved.

Approximation algorithms and hardness results for the clique packing problem

For a fixed family F of graphs, an F-packing in a graph G is a set of pairwise vertex-disjoint subgraphs of G, each isomorphic to an element of F. Finding an F-packing that maximizes the number of covered edges is a natural generalization of the maximum matching problem, which is just F = {K(2)}. In this paper we provide new approximation algorithms and hardness results for the K(r)-packing problem where K(r) = {K(2), K(3,) . . . , K(r)}. We show that already for r = 3 the K(r)-packing problem is APX-complete, and, in fact, we show that it remains so even for graphs with maximum degree 4. On the positive side, we give an approximation algorithm with approximation ratio at most 2 for every fixed r. For r = 3, 4, 5 we obtain better approximations. For r = 3 we obtain a simple 3/2-approximation, achieving a known ratio that follows from a more involved algorithm of Halldorsson. For r = 4, we obtain a (3/2 + epsilon)-approximation, and for r = 5 we obtain a (25/14 + epsilon)-approximation. (C) 2008 Elsevier B.V. All rights reserved.

Packing triangles in low degree graphs and indifference graphs

We consider the problems of finding the maximum number of vertex-disjoint triangles (VTP) and edge-disjoint triangles (ETP) in a simple graph. Both problems are NP-hard. The algorithm with the best approximation ratio known so far for these problems has ratio 3/2 + epsilon, a result that follows from a more general algorithm for set packing obtained by Hurkens and Schrijver [On the size of systems of sets every t of which have an SDR, with an application to the worst-case ratio of heuristics for packing problems, SIAM J. Discrete Math. 2(1) (1989) 68-72]. We present improvements on the approximation ratio for restricted cases of VTP and ETP that are known to be APX-hard: we give an approximation algorithm for VTP on graphs with maximum degree 4 with ratio slightly less than 1.2, and for ETP on graphs with maximum degree 5 with ratio 4/3. We also present an exact linear-time algorithm for VTP on the class of indifference graphs. (C) 2007 Elsevier B.V. All rights reserved.

Polymorphisms in genes involved in neurodevelopment may be associated with altered brain morphology in schizophrenia: Preliminary evidence

An abnormality in neurodevelopment is one of the most robust etiologic hypotheses in schizophrenia (SZ). There is also strong evidence that genetic factors may influence abnormal neurodevelopment in the disease. The present study evaluated in SZ patients, whose brain structural data had been obtained with magnetic resonance imaging (MRI), the possible association between structural brain measures, and 32 DNA polymorphisms,located in 30 genes related to neurogenesis and brain development. DNA was extracted from peripheral blood cells of 25 patients with schizophrenia, genotyping was performed using diverse procedures, and putative associations were evaluated by standard statistical methods (using the software Statistical Package for Social Sciences - SPSS) with a modified Bonferroni adjustment. For reelin (RELN), a protease that guides neurons in the developing brain and underlies neurotransmission and synaptic plasticity in adults, an association was found for a non-synonymous polymorphism (Va1997Leu) with left and right ventricular enlargement. A putative association was also found between protocadherin 12 (PCDH12), a cell adhesion molecule involved in axonal guidance and synaptic specificity, and cortical folding (asymmetry coefficient of gyrification index). Although our results are preliminary, due to the small number of individuals analyzed, such an approach could reveal new candidate genes implicated in anomalous neurodevelopment in schizophrenia. (c) 2007 Elsevier Ireland Ltd. All rights reserved.