We present a linear time algorithm to sort all the suffixes of a string over a large alphabet of integers. The sorted order of suffixes of a string is also called suffix array, a data structure introduced by Manber and Myers that has numerous applications in computational biology. Though the suffix tree of a string can be constructed in linear time and the sorted order of suffixes derived from ...

In previous work we proposed Linear Programs as a fine grained model for imperative programs, and showed how the model checking procedure used in SLAM can be generalised to a model checking procedure for Linear Programs. In this paper we show that our model checking procedure for linear programs can be extended in such a way to support the analysis of linear programs featuring a symbol for unde...

The capabilities of a microwave imaging system working in air using two crossed linear arrays are described. The analytic expressions of the focusing procedures are derived, resolution and available volume of reconstruction are discussed. Finally, some experimental images corresponding to two dielectric objects are also shown.

The time complexity of suffix tree construction has been shown to be equivalent to that of sorting: O(n) for a constant-size alphabet or an integer alphabet and O(n logn) for a general alphabet. However, previous algorithms for constructing suffix arrays have the time complexity of O(n logn) even for a constant-size alphabet. In this paper we present a linear-time algorithm to construct suffix ...

The design of linear microphone arrays with randomly spaced elements is investigated. The probability distribution function for the element positions is derived in the continuum limit by matching the response of the array to an objective beam function. An analysis of the expected value and variance of the beam is presented as a function of the angular direction. Comparison of these metrics to t...

We survey some recent results on linear-time algorithms for systolic arrays. In particular, we show how the greatest common divisor (GCD) of two polynomials of degree n over a finite field can be computed in time O(n) on a linear systolic array of O(n) cells; similarly for the GCD of two n-bit binary numbers. We show how n by n Toeplitz systems of linear equations can be solved in time O(n) on ...

Arithmetic algorithms typically use broadcasting for the distribution of control data to all bit slices in the data path. Since routing delays grow as a function of fanout and routing distance, broadcasting delays grow as a function of precision in arithmetic implementations. Broadcasting in the critical path degrades performance and causes implementations of diiering precisions to experience d...

Fault tolerance through the incorporation of redundancy and reconnguration is quite common. In a redundant linear array of processing elements, k redundant links of xed lengths are provided to each element of the array in addition to the regular links connecting neighboring processors. The redundant links may be activated to bypass faulty elements. The number and the distribution of faults can ...

This thesis describes the first realization and initial measurements of a linear array of seven quantum dots. The device was fabricated on a high mobility GaAs/AlGaAs heterostructure. Electron beam lithography was used to pattern critical features of the device, and 70 nm resolution was achieved. A 3He probe was used to measure the device at 300 mK. The design of the device allowed individual c...

Covering subsequences by sets of permutations arises in numerous applications. Given a set of permutations that cover a specific set of subsequences, it is of interest not just to know how few permutations can be used, but also to find a set of size equal to or close to the minimum. These permutation construction problems have proved to be computationally challenging; few explicit constructions...