Fast parallel algorithms are given for the longest common subsequence problem and the string editing problem with bounded weights. In the COMMON PRAM model, the algorithm for the longest common subse-quence problem takes time O(log m), where m is the length of the shorter string, while the algorithm for the string editing problem with bounded weights takes time O(max(log m; log n= log log n)), ...

The lower bound on the length of 'removable' cycles in Theorem 1 is essentially best possible since there exist 2-connected simple graphs of minimum degree k whose longest 'removable' cycle has length k + i. Moreover, for the special case k = 4, we can construct 2-connected, 4-regular simple graphs whose longest 'removable' cycle has length four. The following counterexample which was independe...

The constrained LCS problem asks one to find a longest common subsequence of two input strings A and B with some constraints. The STR-IC-LCS problem is a variant of the constrained LCS problem, where the solution must include a given constraint string C as a substring. Given two strings A and B of respective lengths M and N , and a constraint string C of length at most min{M,N}, the best known ...

In the constrained longest common subsequence (CLCS) problem, we are given two sequences X , Y and the constrained sequence P in run-length encoded (RLE) format, where |X| = n, |Y | = m and |P | = r and the numbers of runs in RLE format are N , M and R, respectively. In this paper, we show that after the sequences are encoded, the CLCS problem can be solved in O(NMr+ r × min{q1, q2} + q3) time,...

Straightforward implementation of the dynamic-programming algorithms utilizes quadratic space to produce an optimal global or local alignment. For analysis of long DNA sequences, this space restriction is more crucial than the time constraint. Because of this, different methods have been proposed to reduce the space used for aligning globally or locally two sequences. We first describe a space-...

We study the complexity of two Inverse Shortest Paths (ISP) problems with integer arc lengths and the requirement for uniquely determined shortest paths. Given a collection of paths in a directed graph, the task is to find positive integer arc lengths such that the given paths are uniquely determined shortest paths between their respective terminals. The first problem seeks for arc lengths that...

abstract in this study, the effect of suspended load transport on the characteristics of submerged hydraulic jump (shj) in a rectangular channel was investigated experimentally. sediment concentration and jet froude numbers in the range of 0.424%-16.15% and 1.93-4.96, respectively, were considered. tow grain size 0.15 and 0.03 mm were used in the experiments. characteristics of submerged hydrau...

Fe49Co33Ni18 nanowire arrays (175 nm in diameter and lengths ranging from 5 to 32μm) were fabricated into nanopores of hard-anodized aluminum oxide templates using pulsed ac electrodeposition technique. Hysteresis loop measurements indicated that increasing the length decreases coercivity and squareness values (from 274 Oe and 0.58 to200 Oe and 0.105, respective...