Pancreatic Cancer-Secreted Proteins: Targeting Their Functions in Tumor Microenvironment.

Pancreatic Ductal Adenocarcinoma (PDAC) is a ravaging disease with a poor prognosis, requiring a more detailed understanding of its biology to foster the development of effective therapies. The unsatisfactory results of treatments targeting cell proliferation and its related mechanisms suggest a shift in focus towards the inflammatory tumor microenvironment (TME). Here, we discuss the role of cancer-secreted proteins in the complex TME tumor-stroma crosstalk, shedding lights on druggable molecular targets for the development of innovative, safer and more efficient therapeutic strategies.

Design of Three Residues Peptides against SARS-CoV-2 Infection.

The continuous and rapid spread of the COVID-19 pandemic has emphasized the need to seek new therapeutic and prophylactic treatments. Peptide inhibitors are a valid alternative approach for the treatment of emerging viral infections, mainly due to their low toxicity and high efficiency. Recently, two small nucleotide signatures were identified in the genome of some members of the Coronaviridae family and many other human pathogens. In this study, we investigated whether the corresponding amino acid sequences of such nucleotide sequences could have effects on the viral infection of two representative human coronaviruses: HCoV-OC43 and SARS-CoV-2. Our results showed that the synthetic peptides analyzed inhibit the infection of both coronaviruses in a dose-dependent manner by binding the RBD of the Spike protein, as suggested by molecular docking and validated by biochemical studies. The peptides tested do not provide toxicity on cultured cells or human erythrocytes and are resistant to human serum proteases, indicating that they may be very promising antiviral peptides.

Towards a HPC-oriented parallel implementation of a learning algorithm for bioinformatics applications.

BACKGROUND: The huge quantity of data produced in Biomedical research needs sophisticated algorithmic methodologies for its storage, analysis, and processing. High Performance Computing (HPC) appears as a magic bullet in this challenge. However, several hard to solve parallelization and load balancing problems arise in this context. Here we discuss the HPC-oriented implementation of a general purpose learning algorithm, originally conceived for DNA analysis and recently extended to treat uncertainty on data (U-BRAIN). The U-BRAIN algorithm is a learning algorithm that finds a Boolean formula in disjunctive normal form (DNF), of approximately minimum complexity, that is consistent with a set of data (instances) which may have missing bits. The conjunctive terms of the formula are computed in an iterative way by identifying, from the given data, a family of sets of conditions that must be satisfied by all the positive instances and violated by all the negative ones; such conditions allow the computation of a set of coefficients (relevances) for each attribute (literal), that form a probability distribution, allowing the selection of the term literals. The great versatility that characterizes it, makes U-BRAIN applicable in many of the fields in which there are data to be analyzed. However the memory and the execution time required by the running are of O(n(3)) and of O(n(5)) order, respectively, and so, the algorithm is unaffordable for huge data sets. RESULTS: We find mathematical and programming solutions able to lead us towards the implementation of the algorithm U-BRAIN on parallel computers. First we give a Dynamic Programming model of the U-BRAIN algorithm, then we minimize the representation of the relevances. When the data are of great size we are forced to use the mass memory, and depending on where the data are actually stored, the access times can be quite different. According to the evaluation of algorithmic efficiency based on the Disk Model, in order to reduce the costs of the communications between different memories (RAM, Cache, Mass, Virtual) and to achieve efficient I/O performance, we design a mass storage structure able to access its data with a high degree of temporal and spatial locality. Then we develop a parallel implementation of the algorithm. We model it as a SPMD system together to a Message-Passing Programming Paradigm. Here, we adopt the high-level message-passing systems MPI (Message Passing Interface) in the version for the Java programming language, MPJ. The parallel processing is organized into four stages: partitioning, communication, agglomeration and mapping. The decomposition of the U-BRAIN algorithm determines the necessity of a communication protocol design among the processors involved. Efficient synchronization design is also discussed. CONCLUSIONS: In the context of a collaboration between public and private institutions, the parallel model of U-BRAIN has been implemented and tested on the INTEL XEON E7xxx and E5xxx family of the CRESCO structure of Italian National Agency for New Technologies, Energy and Sustainable Economic Development (ENEA), developed in the framework of the European Grid Infrastructure (EGI), a series of efforts to provide access to high-throughput computing resources across Europe using grid computing techniques. The implementation is able to minimize both the memory space and the execution time. The test data used in this study are IPDATA (Irvine Primate splice- junction DATA set), a subset of HS3D (Homo Sapiens Splice Sites Dataset) and a subset of COSMIC (the Catalogue of Somatic Mutations in Cancer). The execution time and the speed-up on IPDATA reach the best values within about 90 processors. Then the parallelization advantage is balanced by the greater cost of non-local communications between the processors. A similar behaviour is evident on HS3D, but at a greater number of processors, so evidencing the direct relationship between data size and parallelization gain. This behaviour is confirmed on COSMIC. Overall, the results obtained show that the parallel version is up to 30 times faster than the serial one.