In the dynamic text indexing problem, a text string has to be maintained under string insertions and deletions in order to answer on-line queries about arbitrary pattern occurrences. By means of some new techniques and data structures, we achieve improved worst-case bounds. We show that nding all pocc occurrences of a pattern of length p in the current text of length n takes O(p + pocc + upd lo...

This project generates random text based on the patterns of characters in a source file. By analyzing given text for character patterns, random characters can be selected according to the likelihood that it follows any given length k of characters, and the resulting generated text is then outputted to a file. Based on the length k chosen for these ”seeds” of characters, different levels of anal...

A new algorithm searching all occurrences of a regular expression pattern in a text is presented. It uses only the text that has been compressed by the text compression using antidictionaries without its decompression. The proposed algorithm runs inO(2 ·||AD||+nc+r) worst case time, where m is the length of the pattern, AD is the antidictionary, nC is the length of the coded text and r is the n...

the length of the testing text. In summary, we found the keystroke biometric effective for identifying up to 30 users inputting text under the following conditions: sufficient training and testing text length, sufficient number of enrollment samples, and same keyboard type used for enrollment and testing.

The development of an efficient compression scheme to process the Arabic language represents a difficult task. This paper employs the dynamic Huffman coding on data compression with variable length bit coding, on the Arabic language. Experimental tests have been performed on both Arabic and English text. A comparison is made to measure the efficiency of compressing data results on both Arabic a...