A computational framework for determining run-maximal strings
From MaRDI portal
Publication:396644
DOI10.1016/j.jda.2012.12.004zbMath1334.68310OpenAlexW2130384369MaRDI QIDQ396644
Antoine Deza, Andrew Baker, Frantisek Franek
Publication date: 13 August 2014
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2012.12.004
Related Items (3)
A computational substantiation of the \(d\)-step approach to the number of distinct squares problem ⋮ A \(d\)-step approach to the maximum number of distinct squares and runs in strings ⋮ Bannai et al. method proves the \(d\)-step conjecture for strings
Cites Work
This page was built for publication: A computational framework for determining run-maximal strings
