### Abstract

Mauer et al. [A Lempel-Ziv-style Compression Method for Repetitive Texts, PSC 2017] proposed a hybrid text compression method called LZ-LFS which has both features of Lempel-Ziv 77 factorization and longest first substitution. They showed that LZ-LFS can achieve better compression ratio for repetitive texts, compared to some state-of-the-art compression algorithms. The drawback of Mauer et al.'s method is that their LZ-LFS compression algorithm takes O(n2) time on an input string of length n. In this paper, we show a faster LZ-LFS compression algorithm that works in O(n log n) time. We also propose a simpler version of LZ-LFS that can be computed in O(n) time.

Original language | English |
---|---|

Title of host publication | Proceedings of the Prague Stringology Conference, PSC 2018 |

Editors | Jan Holub, Jan Zdarek |

Publisher | Prague Stringology Club |

Pages | 12-26 |

Number of pages | 15 |

ISBN (Electronic) | 9788001064849 |

Publication status | Published - 2018 |

Event | 22nd Prague Stringology Conference, PSC 2018 - Prague, Czech Republic Duration: Aug 27 2018 → Aug 28 2018 |

### Publication series

Name | Proceedings of the Prague Stringology Conference, PSC 2018 |
---|

### Conference

Conference | 22nd Prague Stringology Conference, PSC 2018 |
---|---|

Country | Czech Republic |

City | Prague |

Period | 8/27/18 → 8/28/18 |

### All Science Journal Classification (ASJC) codes

- Mathematics(all)

## Fingerprint Dive into the research topics of 'O(n log n)-time text compression by LZ-style longest first substitution'. Together they form a unique fingerprint.

## Cite this

*Proceedings of the Prague Stringology Conference, PSC 2018*(pp. 12-26). (Proceedings of the Prague Stringology Conference, PSC 2018). Prague Stringology Club.