Daisuke Masubuchi

Learn More
There are few successful therapies for castration-resistant prostate cancer (CRPC). Recently, CRPC has been thought to result from augmented androgen/androgen receptor (AR) signaling pathway, for most of which AR overexpression has been observed. In this study, Twist1, a member of basic helix-loop-helix transcription factors as well as AR was upregulated in(More)
Programmed cell death protein 4 (PDCD4) has recently been shown to be involved in both transcription and translation, and to regulate cell growth. However, the mechanisms underlying PDCD4 function are not well understood. In this study, we show that PDCD4 interacts directly with the transcription factor Twist1 and leads to reduced cell growth through the(More)
OBJECTIVE To investigate the roles of Twist1 and Y-box binding protein-1 (YB-1) and their potential as therapeutic targets in bladder cancer (BC), as both have been suggested to play important roles in tumour growth, invasion and drug resistance. MATERIALS AND METHODS Bladder cancer cell lines (TCCsup, UMUC3, T24 and KK47 cells) were used. Twist1 and YB-1(More)
Although cytokine therapy involving interleukin-2 or interferon-alpha has been employed for metastatic renal cell cancer (RCC) treatment, these therapies yielded limited response and benefit. Recently, several molecular-targeted agents have become available, and one newly developed anti-RCC agent, sorafenib (BAY 43-9006), is known to target multiple(More)
BACKGROUND There are currently few effective therapies for castration-resistant prostate cancer (CRPCa). CRPC which is resistant to castration is thought to result from increased activation of the androgen/androgen receptor (AR) signaling pathway, which may be augmented by AR coactivators. METHODS Luciferase reporter assay, Western blotting, quantitative(More)
Let G = (V, E) be a plane graph with nonnegative edge weights, and letN be a family of k vertex sets N1, N2, . . . , Nk ⊆ V , called nets. Then a noncrossing Steiner forest forN in G is a set T of k trees T1, T2, . . . , Tk in G such that each tree Ti ∈ T connects all vertices, called terminals, in net Ni , any two trees in T do not cross each other, and(More)
  • 1