| 
|
Quote: algorithm for pattern matching in UNIX Z-compressed files; O(n log m + m) for short patterns of length m
topics >
all references >
references a-b >
Topic:
pattern matching
Topic:
searching compressed data
Quotation Skeleton
In this paper we consider pattern matching without … n is the length of the compressed text … time O(n+m^2) or O(n log m + m). … Google-1 Google-2
Copyright clearance needed for quotation.
Topic: pattern matching (42 items)
Topic: searching compressed data (9 items)