Expression and activity profiles of DPP IV/CD26 and NEP/CD10 glycoproteins in the human renal cancer are tumor-type dependent

Background: Cell-surface glycoproteins play critical roles in cell-to-cell recognition, signal transduction and regulation, thus being crucial in cell proliferation and cancer etiogenesis and development. DPP IV and NEP are ubiquitous glycopeptidases closely linked to tumor pathogenesis and development, and they are used as markers in some cancers. In the present study, the activity and protein and mRNA expression of these glycoproteins were analysed in a subset of clear-cell (CCRCC) and chromophobe (ChRCC) renal cell carcinomas, and in renal oncocytomas (RO). Methods: Peptidase activities were measured by conventional enzymatic assays with fluorogen-derived substrates. Gene expression was quantitatively determined by qRT-PCR and membrane-bound protein expression and distribution analysis was performed by specific immunostaining. Results: The activity of both glycoproteins was sharply decreased in the three histological types of renal tumors. Protein and mRNA expression was strongly downregulated in tumors from distal nephron (ChRCC and RO). Moreover, soluble DPP IV activity positively correlated with the aggressiveness of CCRCCs (higher activities in high grade tumors). Conclusions: These results support the pivotal role for DPP IV and NEP in the malignant transformation pathways and point to these peptidases as potential diagnostic markers.

A new solution for the roommate problem: The Q-stable matchings

The aim of this paper is to propose a new solution for the roommate problem with strict preferences. We introduce the solution of maximum irreversibility and consider almost stable matchings (Abraham et al. [2])and maximum stable matchings (Ta [30] [32]). We find that almost stable matchings are incompatible with the other two solutions. Hence, to solve the roommate problem we propose matchings that lie at the intersection of the maximum irreversible matchings and maximum stable matchings, which are called Q-stable matchings. These matchings are core consistent and we offer an effi cient algorithm for computing one of them. The outcome of the algorithm belongs to an absorbing set.