The suffix array is a fundamental data structure for many applications that involve string searching and compression. We obtain the first in-place construction algorithms are optimal both in time space (read-only) integer alphabets. make following contributions: For alphabets, we linear sorting algorithm which uses only O(1) workspace. input may be modified during execution of algorithm, but sh...

The advancement of technology in scientific community has produced terabytes of biological data. This datum includes DNA sequences. String matching algorithm which is traditionally used to match DNA sequences now takes much longer time to execute because of the large size of DNA data and also the small number of alphabets. To overcome this problem, the indexing methods such as suffix arrays or ...

We investigated how Taiwanese diminutive suffix -a is phonetically realized in both juncture and context positions. As a grammatical morpheme, suffix -a is similar to Mandarin diminutive suffix -zi as in yi-zi “chair”. While Mandarin suffix -zi always has a neutral tone or belongs to an unstressed syllable, Taiwanese -a is widely accepted as having a full tone. However, due to the same function...

This paper gives a linear-time algorithm for the construction of the suffix tree of a tree. The suffix tree of a tree is used to obtain an efficient algorithm for the minimization of sequential transducers.

Approximate string matching is an essential problem in many areas related to Computer Science including biological sequence processing. The standard solution of this problem is an O(mn) running time and space dynamic programming algorithm for two strings of length m and n. Landau and Vishkin developed an algorithm which uses suffix trees for accelerating the computation along the dynamic progra...

The suffix tree is a compacted trie of all suffixes of a given string. It is a fundamental data structure in a wide range of domains such as text processing, data compression, computer vision, computational biology, and so on [1]. Moreover, it can be used for network researches such as web analysis, which has been studied actively [2], [3]. For example, suffix trees have been utilized to effect...