We evaluate several orthographic word similarity measures in the context of bitext word alignment. We investigate the relationship between the length of the words and the length of their longest common subsequence. We present an alternative to the longest common subsequence ratio (LCSR), a widely-used orthographic word similarity measure. Experiments involving identification of cognates in bite...

The effect of pressure or volume overload on the geometry of the left ventricle (LV) was determined in order to examine the feasibility and accuracy ofLV volume determinations from one minor axis or two dimensions (one minor axis and the longest length). The longest length (LL) and minor axis (MA) in both the anteroposterior (AP) view and lateral (LAT) view were determined from the LV cine silh...

We have previously developed several algorithms which deal with different input sequence scenarios respectively. In this paper, another sequential algorithm for computing Longest Common Increasing Subsequence for two random input sequences is reported. It runs in O(m n log p) time complexity and takes space of O(2(m + n + 1) p), where m and n are the length for two input sequences respectively,...

Given strings A and B of lengths m and n over a finite alphabet Σ ⊂ Z of size O(σ), the length of the longest common transposition invariant subsequence is LCTS(A,B) = maxt∈Z{LCS(A+ t, B)}, where A + t = (a1 + t)(a2 + t) . . . (am + t) and LCS(A + t, B) is the length of the longest common subsequence between A+ t and B. LCTS(A,B) can be computed naively in O(mnσ) time. We present a simple and e...

Characteristics of surface runoff from a 0.14-km2 urban catchment with separated sewer in Macau was investigated. Water quality measurements of surface runoff were carried out on five rainfall events during the period of August to November, 2005. Water quality parameters such as pH, turbidity, TSS, COD, TN, Zn, Pb, and Cu were analyzed. The results show that TN and COD are the major pollutants ...

We prove that for every c > 0 there exists a constant K = K(c) such that every graph G with n vertices and minimum degree at least cn contains a cycle of length t for every even t in the interval [4, ec(G)−K] and every odd t in the interval [K, oc(G)−K], where ec(G) and oc(G) denote the length of the longest even cycle in G and the longest odd cycle in G respectively. We also give a rough estim...

ABSTRACT. We study the shape of the Young diagram λ associated via the Robinson–Schensted– Knuth algorithm to a random permutation in Sn such that the length of the longest decreasing subsequence is not bigger than a fixed number d; in other words we study the restriction of the Plancherel measure to Young diagrams with at most d rows. We prove that in the limit n → ∞ the rows of λ behave like ...

In this paper, we address the following problems: Given a sequence A of n real numbers, and four parameters I, J,X and Y with I ≤ J and X ≤ Y , find the longest (or shortest) subsequence of A such that its length is between I and J and its sum is between X and Y . We present an online and an offline algorithm for the problems, both run in O(n logn) time, which are optimal. key words: length con...