This study aims to determine the inflectional morpheme contained in short story entitled "The Child's Story" by Charles Dickens. The analysis shows that there are 108 morphemes found Story". There 35 plural nouns “-s”, “-es” with 32.5% percentage as most dominant this story. Next, possessive “-'s”, “-s'” and comparative adjectives “-er” both show 2 data (1.8%), superlative “-est” 3 (2.7%), 3rd ...

We present several results about position heaps, a relatively new alternative to suffix trees and suffix arrays. First, we show that, if we limit the maximum length of patterns to be sought, then we can also limit the height of the heap and reduce the worst-case cost of insertions and deletions. Second, we show how to build a position heap in linear time independent of the size of the alphabet....

The stimulus suffix paradigm has been used to establish the importance of precategorical acoustic storage (PAS) as a theoretical construct in the investigation of attention and speech perception. Morton and Chambers concluded that sounds must have typical "speechlike" properties extracted at an early stage of processing in order to act as suffixes. In this article we use the suffix effect to in...

We present an approach to textual classification based on the suffix tree data structure and apply it to spam filtering. A method for scoring of documents using the suffix tree is developed and a number of scoring and score normalisation functions are tested. Our results show that the character level representation of documents and classes facilitated by the suffix tree significantly improves c...

We have developed essaMEM, a tool for finding maximal exact matches that can be used in genome comparison and read mapping. essaMEM enhances an existing sparse suffix array implementation with a sparse child array. Tests indicate that the enhanced algorithm for finding maximal exact matches is much faster, while maintaining the same memory footprint. In this way, sparse suffix arrays remain com...

We present a linear-time algorithm to compute the longest common prefix information in suffix arrays. As two applications of our algorithm, we show that our algorithm is crucial to the effective use of block-sorting compression, and we present a linear-time algorithm to simulate the bottom-up traversal of a suffix tree with a suffix array combined with the longest common prefix information.

G. Fici proved that a finite word has a minimal suffix automaton if and only if all its left special factors occur as prefixes. He called LSP all finite and infinite words having this latter property. We characterize here infinite LSP words in terms of S-adicity. More precisely we provide a finite set of morphisms S and an automaton A such that an infinite word is LSP if and only if it is S-adi...