Unique Breast Cancer Features Within the Vietnamese Population

BACKGROUND: Breast cancer is known to be a heterogeneous disease across women, and even within individual tumors. However, relatively little is known about heterogeneity across cultures. There has been some evidence to suggest that Asian women are more likely to have HER2+ breast cancer than their Caucasian counterparts. PURPOSE: The aim of this study was to further investigate the unique pattern of breast cancer incidence and subtype in the Vietnamese population. METHODS: We retrospectively collected data on all Vietnamese women diagnosed with invasive breast cancer at the Lester & Sue Smith Breast Center in Houston, Texas over a four year period. We recorded the subtype of breast cancer, tumor grade, age at diagnosis, and menopausal status for each woman. We then compared these characteristics between our population of Vietnamese breast cancer patients, and an ethnically diverse group of American women from the 2010 SEER registry. RESULTS: We discovered that 15 of 33 Vietnamese patients diagnosed in our breast center had HER2 over-expressing breast cancer, resulting in a 45% rate of HER2 positivity. Compared with the 2010 Surveillance, Epidemiology, and End Results (SEER) registry data that encompasses 28% of all US breast cancer patients diagnosed that year, regardless of race, the Smith Clinic Vietnamese cohort had a statistically significant higher rate of HER2+ breast cancer, with an odds ratio of 4.7 (45% vs. 15%, p CONCLUSIONS: Vietnamese breast cancer patients, especially those older than 50 years old, tend to have higher rates of HER2+ breast cancer than the general population. This unique pattern of breast cancer merits further study, as it may reflect a genetic mutation or environmental exposure which is more common among Vietnamese women

Impulsive traits and 5-HT2A receptor promoter polymorphism in alcohol dependents: Possible association but no influence of personality disorders

Objective: Impulsive behavior in alcoholics puts them at serious risk of severer course of disease and has been related to the serotonergic neurotransmission dysfunction. The aim of this study is to investigate the association between impulsive aggression in alcohol dependents with regard to the G-1438A polymorphism in the promoter region of the 5-HT2A receptor gene. Furthermore, we investigated the statistical interaction between 5-HT2A alleles, antisocial personality disorder (APD) and impulsive aggression in alcohol dependents. Alcohol dependents were investigated because these personality disorders and impulsive behavior are very frequent in alcohol dependence anf of clinical relevance. Methods: One hundred and thirty-five patients of German descent meeting DSM-IV criteria of alcohol dependence were recruited. Blood samples were taken from alcohol dependents to determine 5-HT2A promoter polymorphisms using PCR (polymerase chain reaction) of lymphocyte DNA. Impulsive aggression was assessed using a German version of the Barratt Impulsiveness Scale which was translated and backtranslated. Alcohol dependents were subdivided into low- or high-impulsivity groups using a median split of the Barratt score. APD and borderline personality disorder (BPD) were assessed using the SCID-II interview. Results: The low-impulsivity group was slightly older and showed a later age at alcoholism onset than the highly impulsive group. Alcohol dependents with high impulsive traits showed a significant association with 5-HT2A 1438 A alleles. After excluding alcohol dependents with APD or BPD from the analysis, this association remained significant. Furthermore, no association between APD, BPD and 5-HT2A alleles was noted. Conclusions: Inpatient alcohol dependents showed a significant association between 5-HT2A A alleles and impulsive traits, independent of the presence of APD or BPD. No association was noted between personality disorders and the polymorphism. This is the first report about an association of 5-HT2A promoter polymorphism and impulsive behavior in alcohol dependents. This finding may refer only to impulsive traits and may be independent of personality disorders in this sample. These results have to be confirmed in larger samples and in healthy control subjects to determine whether this association is of general validity. Copyright (C) 2001 S. Karger AG, Basel

Colourings of cubic graphs inducing isomorphic monochromatic subgraphs

A $k$-bisection of a bridgeless cubic graph $G$ is a $2$-colouring of its vertex set such that the colour classes have the same cardinality and all connected components in the two subgraphs induced by the colour classes (monochromatic components in what follows) have order at most $k$. Ban and Linial conjectured that every bridgeless cubic graph admits a $2$-bisection except for the Petersen graph. A similar problem for the edge set of cubic graphs has been studied: Wormald conjectured that every cubic graph $G$ with $|E(G)| \equiv 0 \pmod 2$ has a $2$-edge colouring such that the two monochromatic subgraphs are isomorphic linear forests (i.e. a forest whose components are paths). Finally, Ando conjectured that every cubic graph admits a bisection such that the two induced monochromatic subgraphs are isomorphic. In this paper, we give a detailed insight into the conjectures of Ban-Linial and Wormald and provide evidence of a strong relation of both of them with Ando's conjecture. Furthermore, we also give computational and theoretical evidence in their support. As a result, we pose some open problems stronger than the above mentioned conjectures. Moreover, we prove Ban-Linial's conjecture for cubic cycle permutation graphs. As a by-product of studying $2$-edge colourings of cubic graphs having linear forests as monochromatic components, we also give a negative answer to a problem posed by Jackson and Wormald about certain decompositions of cubic graphs into linear forests.Comment: 33 pages; submitted for publicatio

Parameterized Study of the Test Cover Problem

We carry out a systematic study of a natural covering problem, used for identification across several areas, in the realm of parameterized complexity. In the {\sc Test Cover} problem we are given a set $[n]=\{1,...,n\}$ of items together with a collection, $\cal T$, of distinct subsets of these items called tests. We assume that $\cal T$ is a test cover, i.e., for each pair of items there is a test in $\cal T$ containing exactly one of these items. The objective is to find a minimum size subcollection of $\cal T$, which is still a test cover. The generic parameterized version of {\sc Test Cover} is denoted by $p(k,n,|{\cal T}|)$-{\sc Test Cover}. Here, we are given $([n],\cal{T})$ and a positive integer parameter $k$ as input and the objective is to decide whether there is a test cover of size at most $p(k,n,|{\cal T}|)$. We study four parameterizations for {\sc Test Cover} and obtain the following: (a) $k$-{\sc Test Cover}, and $(n-k)$-{\sc Test Cover} are fixed-parameter tractable (FPT). (b) $(|{\cal T}|-k)$-{\sc Test Cover} and $(\log n+k)$-{\sc Test Cover} are W[1]-hard. Thus, it is unlikely that these problems are FPT

Conflict-free connection numbers of line graphs

A path in an edge-colored graph is called \emph{conflict-free} if it contains at least one color used on exactly one of its edges. An edge-colored graph $G$ is \emph{conflict-free connected} if for any two distinct vertices of $G$, there is a conflict-free path connecting them. For a connected graph $G$, the \emph{conflict-free connection number} of $G$, denoted by $cfc(G)$, is defined as the minimum number of colors that are required to make $G$ conflict-free connected. In this paper, we investigate the conflict-free connection numbers of connected claw-free graphs, especially line graphs. We first show that for an arbitrary connected graph $G$, there exists a positive integer $k$ such that $cfc(L^k(G))\leq 2$. Secondly, we get the exact value of the conflict-free connection number of a connected claw-free graph, especially a connected line graph. Thirdly, we prove that for an arbitrary connected graph $G$ and an arbitrary positive integer $k$, we always have $cfc(L^{k+1}(G))\leq cfc(L^k(G))$, with only the exception that $G$ is isomorphic to a star of order at least~$5$ and $k=1$. Finally, we obtain the exact values of $cfc(L^k(G))$, and use them as an efficient tool to get the smallest nonnegative integer $k_0$ such that $cfc(L^{k_0}(G))=2$.Comment: 11 page

The C(-1019)G 5-HT1A promoter polymorphism and personality traits: no evidence for significant association in alcoholic patients

The 5HT1A receptor is one of at least 14 different receptors for serotonin which has a role in moderating several brain functions and may be involved in the aetiology of several psychiatric disorders. The C(-1019)G 5-HT1A promoter polymorphism was reported to be associated with major depression, depression-related personality traits and suicidal behavior in various samples. The G(-1019) allele carriers are prone to depressive personality traits and suicidal behavior, because serotonergic neurotransmission is reduced. The aim of this study is to replicate previous findings in a sample of 185 Alcohol-dependent individuals. Personality traits were evaluated using the NEO FFI and TCI. History of suicidal behavior was assessed by a standardized semistructured interview (SSAGA). No significant differences across C(-1019)G 5-HT1A genotype groups were found for TCI temperament and character traits and for NEO FFI personality scales. No association was detected between this genetic variant and history of suicide attempts. These results neither support a role of C(-1019)G 5-HT1A promoter polymorphism in the disposition of personality traits like harm avoidance or neuroticism, nor confirm previous research reporting an involvement of the G allele in suicidal behavior in alcoholics. Significant associations, however, were detected between Babor's Type B with number of suicide attempts in history, high neuroticism and harm avoidance scores in alcoholics

Better Synchronizability Predicted by Crossed Double Cycle

In this brief report, we propose a network model named crossed double cycles, which are completely symmetrical and can be considered as the extensions of nearest-neighboring lattices. The synchronizability, measured by eigenratio $R$, can be sharply enhanced by adjusting the only parameter, crossed length $m$. The eigenratio $R$ is shown very sensitive to the average distance $L$, and the smaller average distance will lead to better synchronizability. Furthermore, we find that, in a wide interval, the eigenratio $R$ approximately obeys a power-law form as $R\sim L^{1.5}$.Comment: 4 pages, 5 figure

Minimal chordal sense of direction and circulant graphs

A sense of direction is an edge labeling on graphs that follows a globally consistent scheme and is known to considerably reduce the complexity of several distributed problems. In this paper, we study a particular instance of sense of direction, called a chordal sense of direction (CSD). In special, we identify the class of k-regular graphs that admit a CSD with exactly k labels (a minimal CSD). We prove that connected graphs in this class are Hamiltonian and that the class is equivalent to that of circulant graphs, presenting an efficient (polynomial-time) way of recognizing it when the graphs' degree k is fixed

Families of Small Regular Graphs of Girth 5

In this paper we obtain $(q+3)$--regular graphs of girth 5 with fewer vertices than previously known ones for $q=13,17,19$ and for any prime $q \ge 23$ performing operations of reductions and amalgams on the Levi graph $B_q$ of an elliptic semiplane of type ${\cal C}$. We also obtain a 13-regular graph of girth 5 on 236 vertices from $B_{11}$ using the same technique

Tur\'an numbers for Ks,tK_{s,t}-free graphs: topological obstructions and algebraic constructions

We show that every hypersurface in $\R^s\times \R^s$ contains a large grid, i.e., the set of the form $S\times T$, with $S,T\subset \R^s$. We use this to deduce that the known constructions of extremal $K_{2,2}$-free and $K_{3,3}$-free graphs cannot be generalized to a similar construction of $K_{s,s}$-free graphs for any $s\geq 4$. We also give new constructions of extremal $K_{s,t}$-free graphs for large $t$.Comment: Fixed a small mistake in the application of Proposition