Abstract This paper provides a new explanation for the insertion of * in plural forms CVCC- nouns also formed with an external suffix, e.g. ʕabd- : ʕabad-ū- ‘servant(s)’, various Semitic languages. CVCaC-ū- pattern is usually considered to be remnant Proto-Semitic broken system Northwest Semitic, but we show that it goes back this form. Internal evidence from as well comparative Afroasiatic poi...

this paper, based on two dialects of kurdish, studies the -g{r suffix of farsi morphologically and semantically. in the sorani (so:rani) dialect of kurdish this suffix is -k{r. in hawrami (h{wrami) dialect of kurdish the present verbal stem of (k{rdaj) (to do) is -k{r and in sorani it is -k{. sorani has a suffix called -{r similar to english -er that produces nouns with mainly agent and instrum...

A repetitive sequence collection is one where portions of a base sequence of length n are repeated many times with small variations, forming a collection of total length N . Examples of such collections are version control data and genome sequences of individuals, where the differences can be expressed by lists of basic edit operations. Flexible and efficient data analysis on a such typically h...

We introduce the VST (virtual suffix tree), an efficient data structure for suffix trees and suffix arrays. Starting from the suffix array, we construct the suffix tree, from which we derive the virtual suffix tree. The VST provides the same functionality as the suffix tree, including suffix links, but at a much smaller space requirement. It has the same linear time construction even for large ...

A suffix vector of a string is an index data structure equivalent to a suffix tree. It was first introduced by Monostori et al. in 2001 [12,13,14]. They proposed a linear construction algorithm of an extended suffix vector, then another linear algorithm to transform an extended suffix vector into a more space economical compact suffix vector. We propose an on-line linear algorithm for directly ...

In this article, we propose a new method for computing rare maximal exact matches between multiple sequences. A rare match between k sequences S(1), ... , S(k) is a string that occurs at most t(i)-times in the sequence S(i), where the t(i) > 0 are user-defined thresholds. First, the suffix tree of one of the sequences (the reference sequence) is built, and then the other sequences are matched s...