### Abstract

Given two strings: pattern P and text T of lengths |P| = M and |T| = N. A string matching problem is to find all occurrences of pattern P in text T. A fully compressed string matching problem is the string matching problem with input strings P and T given in compressed forms p and t respectively, where |p| = m and |t| = n. We present first, almost optimal, string matching algorithms for LZW-compressed strings running in: 1. O((n + m) log (n + m))-time on a single processor machine, and 2. qq(n + m) work on a (n + m)-processor PRAM. Techniques used in our paper can be used in design of efficient algorithms for a wide range of the most typical string problems, in the compressed LZW setting, including: computing a period of a word, finding repetitions, symmetries, counting subwords, and multi-pattern matching.

Original language | English (US) |
---|---|

Title of host publication | Data Compression Conference Proceedings |

Publisher | Institute of Electrical and Electronics Engineers Inc. |

Pages | 316-325 |

Number of pages | 10 |

ISBN (Print) | 076950096X |

State | Published - Jan 1 1999 |

Externally published | Yes |

Event | Proceedings of the 1999 Data Compression Conference, DCC-99 - Snowbird, UT, USA Duration: Mar 29 1999 → Mar 31 1999 |

### Publication series

Name | Data Compression Conference Proceedings |
---|---|

ISSN (Print) | 1068-0314 |

### Conference

Conference | Proceedings of the 1999 Data Compression Conference, DCC-99 |
---|---|

City | Snowbird, UT, USA |

Period | 3/29/99 → 3/31/99 |

### ASJC Scopus subject areas

- Computer Networks and Communications

## Fingerprint Dive into the research topics of 'Almost optimal fully LZW-compressed pattern matching'. Together they form a unique fingerprint.

## Cite this

*Data Compression Conference Proceedings*(pp. 316-325). (Data Compression Conference Proceedings). Institute of Electrical and Electronics Engineers Inc..