Given two strings S1 = pqaxabcstrqrtp and S2 = xyaxbacsl, the substrings axabcs in S1 and axbacs in S2 are very similar. The problem of finding similar substrings is the local alignment problem. Local alignment is extensively used in computational biology to find regions of similarity in different biological sequences. Similar genetic sequences are identified by computing the local alignment of...

For a graph G, we denote by σ2(G) the minimum degree sum of two non-adjacent vertices if G is non-complete; otherwise, σ2(G) = +∞. In this paper, we give the following two results; (i) If s1 and s2 are integers with s1, s2 ≥ 2 and if G is a non-complete graph with σ2(G) ≥ 2(s1 + s2 + 1) − 1, then G contains two vertexdisjoint subgraphs H1 and H2 such that each Hi is a graph of order at least si...

Eroded enamel is more susceptible to abrasive wear than sound enamel. New toothpastes utilizing diamond particles as abrasives have been developed. The present study investigated the abrasive wear of eroded enamel by three commercially available toothpastes (one containing diamond particles) and compared it to the respective wear of sound enamel caused by these toothpastes. Seventy-two bovine e...

Purpose. To analyse variations in the anatomical and functional outcomes and in proliferative vitreoretinopathy (PVR) rate of a prospective multicentric study that was primarily designed for identification of clinical risk factors for PVR. Methods. 1,046 retinal detachment (RD) cases were analysed. Cases were divided into two series based upon variation in PVR rate determined by logistic regres...

The notation and terminology used here have been introduced in the following papers: [12], [2], [3], [7], [9], [11], [1], [4], [10], [13], [6], [17], [18], [15], [8], [16], [19], and [5]. For simplicity, we adopt the following rules: F denotes a non trivial real normed space, G denotes a real normed space, X denotes a set, x, x0, r, p denote real numbers, n, k denote elements of N, Y denotes a ...

Given two sequences S1, S2 and a constrained sequence C, the longest common subsequence of S1, S2 with restriction to C is defined as the constrained longest common subsequence (CLCS) of S1, S2 and C. At the same time, the best alignment of S1, S2 with restriction to C is defined as the constrained pairwise sequence alignment (CPSA) of S1, S2 and C. Previous algorithms have shown that both CLCS...

Given two sequences S1, S2, and a constrained sequence C, a longest common subsequence of S1, S2 with restriction to C is called a constrained longest common subsequence of S1 and S2 with C. At the same time, an optimal alignment of S1, S2 with restriction to C is called a constrained pairwise sequence alignment of S1 and S2 with C. Previous algorithms have shown that the constrained longest co...

Cell surface glycans play pivotal roles in immune cell trafficking and immunity. Here we present an efficient method for generating anti-carbohydrate monoclonal antibodies (mAbs) using gene-targeted mice and describe critical glycans in lymphocyte homing. We immunized sulfotransferase GlcNAc6ST-1 and GlcNAc6ST-2 doubly deficient mice with sulfotransferase-overexpressing Chinese hamster ovary ce...

The Supporting Information files S1 Movie, S2 Movie, S1 File and S2 File do not appear in the published article. The publisher apologizes for the error. Please view the Supporting Information files below.