### Abstract

A closed string is a string with a proper substring that occurs in the string as a prefix and a suffix, but not elsewhere. Closed strings were introduced by Fici (Proc. WORDS, 2011) as objects of combinatorial interest in the study of Trapezoidal and Sturmian words. In this paper we consider algorithms for computing closed factors (substrings) in strings, and in particular for greedily factorizing a string into a sequence of longest closed factors. We describe an algorithm for this problem that uses linear time and space. We then consider the related problem of computing, for every position in the string, the longest closed factor starting at that position. We describe a simple algorithm for the problem that runs in O(n log n/ log log n) time.

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

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

Editors | Jan Holub, Jan Zd'arek |

Publisher | Prague Stringology Club |

Pages | 162-168 |

Number of pages | 7 |

ISBN (Electronic) | 9788001055472 |

Publication status | Published - Jan 1 2014 |

Event | 18th Prague Stringology Conference, PSC 2014 - Prague, Czech Republic Duration: Sep 1 2014 → Sep 3 2014 |

### Publication series

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

### Other

Other | 18th Prague Stringology Conference, PSC 2014 |
---|---|

Country | Czech Republic |

City | Prague |

Period | 9/1/14 → 9/3/14 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Mathematics(all)

### Cite this

*Proceedings of the Prague Stringology Conference 2014, PSC 2014*(pp. 162-168). (Proceedings of the Prague Stringology Conference 2014, PSC 2014). Prague Stringology Club.