Proceedings. Compression and Complexity of SEQUENCES 1997 (Cat. No.97TB100171)

The following topics were dealt with: hashing on strings, cryptography, privacy protection; signature technique for similarity-based queries; documents resemblance and containment; generalized secret sharing and group-key distribution; interleaving entropy codes; multi-alphabet coding; near-lossless image compression; source coding asymptotics; low entropy strings compression with Lempel-Ziv algorithms; code and parse trees for lossless source encoding; vector quantization and density estimation; SW algorithm optimization; minimum description length; annotated statistical indices for sequence analysis; constant-space string-matching; approximate pattern occurrences in text; inferring lexical and grammatical structure from sequences; optical mapping of flip-cut problems hardness; error resilient data compression with adaptive deletion; dense coding, arithmetic coding alternative; text compression using recency rank; Ziv/Lempel ´78 parsing asymmetry; secondary storage sequence sorting; run-length encoding; experimental molecular biology group testing problems; parallel decoder for LZ2 compression; wavelets thresholding