Understanding the Selectivity Mechanism of the Human Asialoglycoprotein Receptor (ASGP-R) toward Gal- and Man-type Ligands for Predicting Interactions with Exogenous Sugars

A practical approach for addressing the computer simulation of protein-carbohydrate interactions is described here. An articulated computational protocol was set up and validated by checking its ability to predict experimental data, available in the literature, and concerning the selectivity shown by the Carbohydrate Recognition Domain (CRD) of the human asialoglycoprotein receptor (ASGP-R) toward Gal-type ligands. Some required features responsible for the interactions were identified. Subsequently the same protocol was applied to monomer sugar molecules that constitute the building blocks for alginates and ulvans. Such sugar polymers may supply a low-cost source of rare sugars with a potential impact on several industrial applications, from pharmaceutical to fine chemical industry. An example of their applicative exploitation could be given by their use in developing biomaterial with adhesion properties toward hepatocytes, through interaction with the ASGP-R. Such a receptor has been already proposed as a target for exogenous molecules, specifically in the case of hepatocytes, for diagnostic and therapeutic purposes. The DOCK5.2 program was used to search optimal locations of the above ligands of interest into CRD binding site and to roughly estimate interaction energies. Finally, the binding ΔG of theoretical protein-ligand complexes was estimated by using the DelPhi program in which the solvation free energy is accounted for with a continuum solvent model, by solving the Poisson-Boltzmann equation. The structure analysis of the obtained complexes and their ΔG values suggest that one of the sugar monomers of interest shows the desired characteristics.     

Formalizing REST APIs for web-based communication and SIP interworking

This paper proposes an instantaneous recovery route design scheme using multiple coding-aware link protection scenarios to achieve higher link cost reduction in the network. In this scheme, two protection scenarios, namely, (i) traffic splitting (TS), and (ii) two sources and a common destination (2SD) are used to integrate multiple sources and a common destination. The proposed scheme consists of two phases. In the first phase, the proposed scheme determines routes for 2SD and TS scenarios of all possible source-destination pairs to minimize the total link cost. In this phase, the network coding is applied to the common path within each scenario, individually. In the second phase, network coding is applied to the common path between two scenarios (or a scenario pair) in order to enhance the resource saving. This phase develops conditions that select the most appropriate combination of scenario pairs, such as TS–TS, 2SD–2SD, and 2SD–TS for network coding, including their proofs. Using these conditions, a heuristic algorithm is introduced in order to select the most appropriate combination of scenario pairs for further enhancing of resource saving. Simulation results show that the proposed scheme outperforms the conventional 1 + 1 protection scheme, the TS scenario, and the 2SD scenario in terms of link cost reduction in the network.