Microtubule-associated protein 2 (MAP-2) isoforms are developmentally expressed in the nervous system and contain a number of functional domains. Adjacent to the first repeat of the microtubule-binding domain is an RTPPKSP motif for binding SH3 domains. To identify SH3-containing proteins that interact with MAP-2, transfections, filter overlay assays, glutathione S-transferase (GST)-mediated bi...

With an unprecedented astrometric and photometric data precision, Gaia EDR3 gives us, for the first time, opportunity to systematically detect map in optical bands, low mass populations of star forming regions (SFRs) Milky Way. We provide a catalogue (photometry, proper motions parallaxes) young stellar objects (YSOs) identified Galactic Plane (|b|<30 deg) within about 1.5 kpc. The SFRs which t...

We have previously shown that P2x purinoceptor activation in the subpostremal nucleus tractus solitarius (NTS) produces dose-dependent decreases in mean arterial pressure (MAP), heart rate, efferent sympathetic nerve activity, and significant peripheral vasodilation. However, the relative roles of cardiac output (CO) and total peripheral resistance (TPR) in mediating this depressor response are...

Membranes with immobilized GM3-type oligosaccharide were prepared and influenza virus adsorption was evaluated. GM3-type oligosaccharide which has azido group in the aglycon was synthesized by saccharide primer method. The azido group was used for combination by click chemistry with alkyne which is introduced to membranes. The position of the azido group in the aglycon of GM3-type oligosacchari...

Given a set of sites in a simple polygon, a geodesic Voronoi diagram partitions the polygon into regions based on distances to sites under the geodesic metric. We present algorithms for computing the geodesic nearest-point, higher-order and farthest-point Voronoi diagrams of m point sites in a simple n-gon, which improve the best known ones form ≤ n/polylogn. Moreover, the algorithms for the ne...

In this paper, we propose an algorithm for computing the farthest-segment Voronoi diagram for the edges of a convex polygon and apply this to obtain an O(n logn) algorithm for the following proximity problem: Given a set P of n (>2) points in the plane, we have O(n2) implicitly defined segments on pairs of points. For each point p ∈ P , find a segment from this set of implicitly defined segment...