The Travelling Salesman Problem (TSP) is a classical NPhard optimisation problem. There exist, however, special cases of the TSP that can be solved in polynomial time. Many of the well-known TSP special cases have been characterized by imposing special four-point conditions on the underlying distance matrix. Probably the most famous of these special cases is the TSP on a Monge matrix, which is ...

BACKGROUND Human T cell lymphotropic virus type 1 (HTLV-1)-associated infective dermatitis (IDH) is a chronic and recurrent eczema occurring during childhood and adolescence. HTLV-1-associated myelopathy/tropical spastic paraparesis (HAM/TSP) is a chronic myelopathy of adulthood, presenting with slowly progressive spastic paraparesis and sphincter dysfunction with mild sensory involvement. Ther...

Lymphocyte adhesion to cells and extracellular matrix (ECM) via integrins plays a pivotal role for the function of the immune system. We show here that endogenous thrombospondin-1 (TSP-1) is a cell-surface ligand for cis interaction of surface receptors in T lymphocytes controlled by integrins and the T-cell antigen receptor (TCR/CD3). Stimulation of CD3 triggers rapid surface expression of TSP...

Plasma von Willebrand factor (vWF) is a multimeric protein that mediates adhesion of platelets to sites of vascular injury. Only the very large vWF multimers are effective in promoting platelet adhesion in flowing blood. A protein disulfide bond reductase in plasma reduces the average multimer size of vWF secreted by endothelial cells. This activity has been isolated from human endothelial cell...

Thrombospondin-1 (TSP-1), a multifunctional matricellular glycoprotein, can activate transforming growth factor-beta, an important profibrotic cytokine involved in various fibrotic diseases. TSP-1 is expressed in the lung tissue of animal models of bleomycin-induced pulmonary fibrosis and in patients with some interstitial lung diseases. The present study investigated the serum and bronchoalveo...

We study the Many-Visits Traveling Salesman Problem, where given a number k(v) for each of n cities and pairwise (possibly asymmetric) integer distances, one has to find an optimal tour that visits city v exactly times. The currently fastest algorithm is due Berger, Kozma, Mnich Vincze [SODA 2019, TALG 2020] runs in time space O⁎(5n). They also show polynomial-space running O(16n+o(n)). In this...

The Travelling Salesman Problem (TSP) is one of the most famous optimization problems. The Genetic Algorithm (GA) is one of metaheuristics that have been applied to TSP. The Crossover and mutation operators are two important elements of GA. There are many TSP solver crossover operators. In this paper, we state implementation of some recent TSP solver crossovers at first and then we use each of ...

The matricellular protein thrombospondin (TSP) 1 is induced after tissue injury and may regulate reparative responses by activating transforming growth factor-β, by suppressing angiogenesis and by modulating inflammation and matrix metabolism. We hypothesized that endogenous TSP-1 may be involved in the pathogenesis of cardiac remodeling in the pressure-overloaded heart. Myocardial TSP-1 expres...