29 citations · 49 across the 12 of their papers we have counts for
14 papers
Bijective BWT based compression schemes
Golnaz Badkobeh, Hideo Bannai, Dominik Köppl
We investigate properties of the bijective Burrows-Wheeler transform (BBWT). We show that for any string , a bidirectional macro scheme of size can be induced from the…
More characterizations of morphic words
Golnaz Badkobeh, Pascal Ochem
An interesting phenomenon in combinatorics on words is when every recurrent word satisfying some avoidance constraints has the same factor set as a morphic word. An early example i…
Maximal Closed Substrings
Golnaz Badkobeh, Alessandro De Luca, Gabriele Fici +1
A string is closed if it has length 1 or has a nonempty border without internal occurrences. In this paper we introduce the definition of a \emph{maximal closed substring} (MCS), w…
Internal Shortest Absent Word Queries in Constant Time and Linear Space
Golnaz Badkobeh, Panagiotis Charalampopoulos, Dmitry Kosolobov +1
Given a string of length over an alphabet of size , we are to preprocess so that given a range , we can return a representa…
Avoiding Square-Free Words on Free Groups
Golnaz Badkobeh, Tero Harju, Pascal Ochem +1
We consider sets of factors that can be avoided in square-free words on two-generator free groups. The elements of the group are presented in terms of 0,1,2,3 such that 0 and 2 (re…
Left Lyndon tree construction
Golnaz Badkobeh, Maxime Crochemore
We extend the left-to-right Lyndon factorisation of a word to the left Lyndon tree construction of a Lyndon word. It yields an algorithm to sort the prefixes of a Lyndon word accor…