A computational framework for determining run-maximal strings

DOI10.1016/J.JDA.2012.12.004zbMATH Open1334.68310OpenAlexW2130384369MaRDI QIDQ396644FDOQ396644

Authors: Andrew Baker, Antoine Deza, 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

Recommendations

• On the structure of run-maximal strings
• Not So Many Runs in Strings
• The Number of Runs in a String: Improved Analysis of the Linear Upper Bound
• The number of runs in a string
• A \(d\)-step approach to the maximum number of distinct squares and runs in strings

zbMATH Keywords

stringsrunsr-coverrun-maximality

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Cites Work

• Title not available (Why is that?)
• A different proof of the Crochemore-Ilie lemma concerning microruns
• On the structure of run-maximal strings
• Maximal repetitions in strings

Cited In (7)

• The Number of Runs in a String: Improved Analysis of the Linear Upper Bound
• On the maximal sum of exponents of runs in a string
• A computational substantiation of the \(d\)-step approach to the number of distinct squares problem
• On the structure of run-maximal strings
• 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
• On the Maximal Sum of Exponents of Runsin a String

This page was built for publication: A computational framework for determining run-maximal strings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q396644)