Efficient enumeration of non-equivalent squares in partial words with few holes

DOI10.1007/978-3-319-62389-4_9zbMath1434.68729MaRDI QIDQ5920146

Wojciech Rytter, Costas S. Iliopoulos, Tomasz Kociumaka, Maxime Crochemore, Solon P. Pissis, Jakub Radoszewski, Tomasz Walen, Panagiotis Charalampopoulos

Publication date: 23 October 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: http://link.springer.com/10.1007/s10878-018-0300-z

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Combinatorics on words (68R15) Algorithms on strings (68W32)

Related Items (3)

Dynamic and internal longest common substring ⋮ Almost linear time computation of maximal repetitions in run length encoded strings ⋮ Efficient enumeration of non-equivalent squares in partial words with few holes

This page was built for publication: Efficient enumeration of non-equivalent squares in partial words with few holes