Cellular and molecular effects of protons: apoptosis induction and potential implications for cancer therapy.

Due to their ballistic precision, apoptosis induction by protons could be a strategy to specifically eliminate neoplastic cells. To characterize the cellular and molecular effects of these hadrons, we performed dose-response and time-course experiments by exposing different cell lines (PC3, Ca301D, MCF7) to increasing doses of protons and examining them with FACS, RT-PCR, and electron spin resonance (ESR). Irradiation with a dose of 10 Gy of a 26,7 Mev proton beam altered cell structures such as membranes, caused DNA double strand breaks, and significantly increased intracellular levels of hydroxyl ions, are active oxygen species (ROS). This modified the transcriptome of irradiated cells, activated the mitochondrial (intrinsic) pathway of apoptosis, and resulted in cycle arrest at the G2/M boundary. The number of necrotic cells within the irradiated cell population did not significantly increase with respect to the controls. The effects of irradiation with 20 Gy were qualitatively as well as quantitatively similar, but exposure to 40 Gy caused massive necrosis. Similar experiments with photons demonstrated that they induce apoptosis in a significantly lower number of cells and in a temporally delayed manner. These data advance our knowledge on the cellular and molecular effects of proton irradiation and could be useful for improving current hadrontherapy protocols.

AntiClustal: Multiple Sequence Alignment by antipole clustering and linear approximate 1-median computation.

In this paper we present a new Multiple Sequence Alignment (MSA) algorithm called AntiClusAl. The method makes use of the commonly use idea of aligning homologous sequences belonging to classes generated by some clustering algorithm, and then continue the alignment process ina bottom-up way along a suitable tree structure. The final result is then read at the root of the tree. Multiple sequence alignment in each cluster makes use of the progressive alignment with the 1-median (center) of the cluster. The 1-median of set S of sequences is the element of S which minimizes the average distance from any other sequence in S. Its exact computation requires quadratic time. The basic idea of our proposed algorithm is to make use of a simple and natural algorithmic technique based on randomized tournaments which has been successfully applied to large size search problems in general metric spaces. In particular a clustering algorithm called Antipole tree and an approximate linear 1-median computation are used. Our algorithm compared with Clustal W, a widely used tool to MSA, shows a better running time results with fully comparable alignment quality. A successful biological application showing high aminoacid conservation during evolution of Xenopus laevis SOD2 is also cited.