Let a text T[1..n] be the only string generated by context-free grammar with g (terminal and nonterminal) symbols, of size G (measured as sum lengths right-hand sides rules). Such grammar, called grammar-compressed representation T, can encoded using Glg⁡G bits. We introduce first index that uses O(Glg⁡n) bits (precisely, Glg⁡n+(2+ϵ)Glg⁡g for any constant ϵ>0) find occ occurrences patterns P[1....

Let S and S′ be two strings, having the same length, over a totally-ordered alphabet. We consider the following two variants of string matching. Parameterized Matching: The characters of S and S′ are partitioned into static characters and parameterized characters. The strings are a parameterized match iff the static characters match exactly, and there exists a one-to-one function which renames ...

One-class classification (OCC) is a machine learning problem where training data has only one class. Recently, self-supervised OCC algorithms have been increasing attention. These train the model for pretext tasks and use error OCC. However, these are specialized images, applying them to feature not practical or appropriate such purpose. The motivation of this study apply data. For purpose, pap...

Administration of a birth dose of hepatitis B vaccine (HepB vaccine) to neonates is recommended to prevent mother-to-infant transmission and chronic infection with the hepatitis B virus (HBV). Although manufacturers recommend HepB vaccine distribution and storage at 2-8 degrees C, recognition of the heat stability of hepatitis B surface antigen stimulated research into its use after storage at,...

In the problem of one-class classification (OCC) one of the classes, the target class, has to be distinguished from all other possible objects, considered as nontargets. In many biomedical problems this situation arises, for example, in diagnosis, image based tumor recognition or analysis of electrocardiogram data. In this paper an approach to OCC based on a typicality test is experimentally co...

In this article we examine the relation between the Rorschach Comprehensive System's Suicide Constellation (S-CON; Exner, 1993; Exner & Wiley, 1977) and lethality of suicide attempts during the course of patients' hospitalization at the Austen Riggs Center (Stockbridge, MA). Patient records were rated as nonsuicidal (n = 37), parasuicidal (n = 37), or near-lethal (n = 30) based on the presence ...

This paper revisits the problem of indexing a text S[1..n] to support searching substrings in S that match a given pattern P [1..m] with at most k errors. A naive solution either has a worst-case matching time complexity of Ω(m) or requires Ω(n) space. Devising a solution with better performance has been a challenge until Cole et al. [5] showed an O(n log n)-space index that can support k-error...