Abstract. Text mining from large scaled data is of great importance in computer sci-ence. In this paper, we consider fundamental problems on text mining from compressed strings, i.e., computing a longest repeating substring, longest non-overlapping repeat-ing substring, most frequent substring, and most frequent non-overlapping substring from a given compressed string. Also, we tackle the following novel problem: given a compressed text and compressed pattern, compute the representative of the equiva-lence class of the pattern w.r.t. the text. We present algorithms that solve the above problems in time polynomial in the size of input compressed strings. The compression scheme we consider is straight line program (SLP) which has exponential ...
We consider a data mining problem in a large collection of unstructured texts based on association r...
Abstract. We present an efficient algorithm for calculating q-gram frequencies on strings represente...
How to solve string problems, if instead of input string we get only program generating it? Is it p...
AbstractThis paper studies two problems on compressed strings described in terms of straight line pr...
Abstract. This paper studies two problems on compressed strings de-scribed in terms of straight line...
Subsequence pattern matching problems on compressed text were first considered by Cegielski et al. (...
Abstract. Motivated by the imminent growth of massive, highly redun-dant genomic databases we study ...
. We survey the complexity issues related to several algorithmic problems for compressed one- and tw...
AbstractWe present simple and efficient algorithms for calculating q-gram frequencies on strings rep...
In this paper we focus on the problem of compressed pattern matching for the text compression using ...
We present simple and efficient algorithms for calculating q-gram frequencies on strings represented...
AbstractWe present a solution to the problem of regular expression searching on compressed text. The...
We consider the problem of finding an instance of a string-pattern s in a given string under compres...
We design two compressed data structures for the full-text indexing problem that support efficient s...
The present chapter describes a few standard algorithms used for processing texts. They apply, for.....
We consider a data mining problem in a large collection of unstructured texts based on association r...
Abstract. We present an efficient algorithm for calculating q-gram frequencies on strings represente...
How to solve string problems, if instead of input string we get only program generating it? Is it p...
AbstractThis paper studies two problems on compressed strings described in terms of straight line pr...
Abstract. This paper studies two problems on compressed strings de-scribed in terms of straight line...
Subsequence pattern matching problems on compressed text were first considered by Cegielski et al. (...
Abstract. Motivated by the imminent growth of massive, highly redun-dant genomic databases we study ...
. We survey the complexity issues related to several algorithmic problems for compressed one- and tw...
AbstractWe present simple and efficient algorithms for calculating q-gram frequencies on strings rep...
In this paper we focus on the problem of compressed pattern matching for the text compression using ...
We present simple and efficient algorithms for calculating q-gram frequencies on strings represented...
AbstractWe present a solution to the problem of regular expression searching on compressed text. The...
We consider the problem of finding an instance of a string-pattern s in a given string under compres...
We design two compressed data structures for the full-text indexing problem that support efficient s...
The present chapter describes a few standard algorithms used for processing texts. They apply, for.....
We consider a data mining problem in a large collection of unstructured texts based on association r...
Abstract. We present an efficient algorithm for calculating q-gram frequencies on strings represente...
How to solve string problems, if instead of input string we get only program generating it? Is it p...