Learn More
We present a linear time and space suffix array (SA) construction algorithm called the SA-IS algorithm.The SA-IS algorithm is novel because of the LMS-substrings used for the problem reduction and the pure induced-sorting (specially coined for this algorithm)used to propagate the order of suffixes as well as that of LMS-substrings, which makes the algorithm(More)
—We present in this paper two efficient algorithms for linear time suffix array construction. These two algorithms archive their linear time complexities using the techniques of divide-and-conquer and recursion. What distinguish the proposed algorithms from other linear time suffix array construction algorithms (SACAs) are the variable-length leftmost(More)
Congenital cataract is the commonest worldwide cause of lifelong visual loss in children. Although congenital cataracts have a diverse aetiology, in many children, a cause is not identified; however, autosomal dominant inheritance is commonly seen. Early diagnosis either on the post-natal ward or in the community is important because appropriate(More)
Semiquantum key distribution allows a quantum party to share a random key with a "classical" party who only can prepare and measure qubits in the computational basis or reorder some qubits when he has access to a quantum channel. In this work, we present a protocol where a secret key can be established between a quantum user and an almost classical user who(More)
We present a new suffix array construction algorithm that aims to build, in external memory, the suffix array for an input string of length <i>n</i> measured in the magnitude of tens of Giga characters over a constant or integer alphabet. The core of this algorithm is adapted from the framework of the original internal memory SA-DS algorithm that samples(More)