Bubble-flip -- a new generation algorithm for prefix normal words
type: Item
instance of: scholarly article
title: Bubble-flip -- a new generation algorithm for prefix normal words
zbMATH Open document ID: 1398.68411
author: Ferdinando Cicalese
author: Zsuzsanna Lipták
author: Massimiliano Rossi
published in: Theoretical Computer Science
publication date: 2018-08-23T00:00:00Z
Mathematics Subject Classification ID: 68R15
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 6923887
zbMATH Keywords: algorithms on automata and words
zbMATH Keywords: combinatorics on words
zbMATH Keywords: combinatorial generation
zbMATH Keywords: prefix normal words
zbMATH Keywords: infinite words
zbMATH Keywords: binary languages
zbMATH Keywords: combinatorial Gray code
describes a project that uses: OEIS
MaRDI profile type: MaRDI publication profile
full work available at URL: j.tcs.2018.06.021
OpenAlex ID: W2963464834
cites work: Algorithms for jumbled indexing, jumbled border and jumbled square on run-length encoded strings
cites work: On the relationship between histogram indexing and block-mass indexing
cites work: On Hardness of Jumbled Indexing
cites work: Leaf realization problem, caterpillar graphs and prefix normal words
cites work: Algorithms for jumbled pattern matching in strings
cites work: On Combinatorial Generation of Prefix Normal Words
cites work: On prefix normal words and prefix normal forms
cites work: Clustered Integer 3SUM via Additive Combinatorics
cites work: Approximating the maximum consecutive subsums of a sequence
cites work: Bubble-flip -- a new generation algorithm for prefix normal words
cites work: Fast and Simple Jumbled Indexing for Binary Run-Length Encoded Strings
cites work: On Prefix Normal Words
cites work: Binary jumbled pattern matching on trees and tree-like structures
cites work: New algorithms for binary jumbled pattern matching
cites work: Q4681162
cites work: Efficient indexes for jumbled pattern matching with constant-sized alphabet
cites work: Q4529547
cites work: Sub-quadratic time and linear space data structures for permutation matching in binary strings
cites work: Binary bubble languages and cool-lex order
cites work: De Bruijn sequences for fixed-weight binary strings
cites work: Efficient oracles for generating binary bubble languages
cites work: Q4443440
DOI: 10.1016/J.TCS.2018.06.021
description: scientific article; zbMATH DE number 6923887