Avoiding approximate repetitions with respect to the longest common subsequence distance

DOI10.2140/involve.2016.9.657zbMath1362.68238arXiv1308.1620OpenAlexW2503041365MaRDI QIDQ2631171

Narad Rampersad, Serina Camungol

Publication date: 29 July 2016

Published in: Involve (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1308.1620

zbMATH Keywords

longest common subsequenceentropy compressionapproximate repetition

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (3)

Moser-Tardos resampling algorithm, entropy compression method and the subset gas ⋮ Generating square-free words efficiently ⋮ Entropy compression versus Lovász local lemma

This page was built for publication: Avoiding approximate repetitions with respect to the longest common subsequence distance