Using Partitions and Superstrings for Lossless Compression of Pattern Databases
Schreiber, Ethan L. (University of California, Los Angeles) | Korf, Richard E. (University of California, Los Angeles)
We present an algorithm for compressing pattern databases (PDBs) and a method for fast random access of these com-pressed PDBs. We demonstrate the effectiveness of our technique by compressing two 6-tile sliding-tile PDBs by a factor of 12 and a 7-tile sliding-tile PDB by a factor of 24.
Aug-4-2011
- Country:
- Technology: