[HTML][HTML] Efficient text fingerprinting via Parikh mapping
We consider the problem of fingerprinting text by sets of symbols. Specifically, if S is a string,
of length n, over a finite, ordered alphabet Σ, and S′ is a substring of S, then the fingerprint
of S′ is the subset φ of Σ of precisely the symbols appearing in S′. In this paper we show
efficient methods of answering various queries on fingerprint statistics. Our preprocessing is
done in time O (n| Σ| lognlog| Σ|) and enables answering the following queries:
of length n, over a finite, ordered alphabet Σ, and S′ is a substring of S, then the fingerprint
of S′ is the subset φ of Σ of precisely the symbols appearing in S′. In this paper we show
efficient methods of answering various queries on fingerprint statistics. Our preprocessing is
done in time O (n| Σ| lognlog| Σ|) and enables answering the following queries:
We consider the problem of fingerprinting text by sets of symbols. Specifically, if S is a string, of length n, over a finite, ordered alphabet Σ, and S′ is a substring of S, then the fingerprint of S′ is the subset φ of Σ of precisely the symbols appearing in S′. In this paper we show efficient methods of answering various queries on fingerprint statistics. Our preprocessing is done in time O(n|Σ|lognlog|Σ|) and enables answering the following queries:
Elsevier
この検索の最上位の結果を表示しています。 検索結果をすべて見る
