We show that suffix trees store various kinds of redundant information. We exploit these redundancies to obtain more space efficient representations. The most space efficient of our representations requires 20 bytes per input character in the worst case, and 10.1 bytes per input character on average for a collection of 42 files of different type. This is an advantage of more than 8 bytes per in...

We introduce a character-based chunking for unknown word identification in Japanese text. A major advantage of our method is an ability to detect low frequency unknown words of unrestricted character type patterns. The method is built upon SVM-based chunking, by use of character n-gram and surrounding context of n-best word segmentation candidates from statistical morphological analysis as feat...

Let X be a character table of the symmetric group Sn. It is shown that unless n = 4 or n = 6, there is a unique way to assign partitions of n to the rows and columns of X so that for all λ and ν, Xλν is equal to χ(ν), the value of the irreducible character of Sn labelled by λ on elements of cycle type ν. Analogous results are proved for alternating groups, and for the Brauer character tables of...

The block-sorting text compression algorithm can be viewed as associating a context with each character to be compressed, and then sorting the characters on their contexts. Normally, the context associated with each character is the string to the left of the character. Recently, Ratushnyak suggested that it might be possible instead to build a context by interleaving characters taken alternatel...

1.1. In [PS1], I. Penkov and V. Serganova show that the category of representations of a basic classical Lie superalgebra g of type I with a fixed typical central character is equivalent to the category of representations of the even part g0 with a suitable central character. A similar result for type II was proven by I. Penkov in [P] for “generic” central characters. The aim of this paper is t...

We present strategies and results for identifying the symbol type (lower-case, upper-case, digit, and punctuation or special symbols) of every character in a text document by using various kinds of information from neighboring characters. In the expectation of reasonable word and character segmentation for shape clustering, we designed several type recognition methods that depend on cluster n-g...

Herein we describe the synthesis and HIV-1 protease (PR) inhibitory activity of 16 new peptidomimetic molecular tongs with a naphthalene scaffold. Their peptidic character was progressively decreased. Two of these molecules exhibited the best dimerization inhibition activity toward HIV-1 wild-type and multimutated ANAM-11 proteases obtained to date for this class of molecules (∼40 nM for wild-t...

We show that suux trees store various kinds of redundant information. We exploit these redundancies to obtain more space eecient representations. The most space eecient of our representations requires 20 bytes per input character in the worst case, and 10:1 bytes per input character on average for a collection of 42 les of diierent type. This is an advantage of more than 8 bytes per input chara...