3 papers
cs.LO2023
Formal Translation from Reversing Petri Nets to Coloured Petri Nets
Kamila Barylska, Anna Gogolinska, Lukasz Mikulski +3
Reversible computation is an emerging computing paradigm that allows any sequence of operations to be executed in reverse order at any point during computation. Its appeal lies in…
cs.DS2019
Constructing the Bijective and the Extended Burrows-Wheeler Transform in Linear Time
Hideo Bannai, Juha Kärkkäinen, Dominik Köppl +1
The Burrows-Wheeler transform (BWT) is a permutation whose applications are prevalent in data compression and text indexing. The bijective BWT (BBWT) is a bijective variant of it.…
cs.DS2016
String Inference from the LCP Array
Juha Kärkkäinen, Marcin Piątkowski, Simon J. Puglisi
The suffix array, perhaps the most important data structure in modern string processing, is often augmented with the longest common prefix (LCP) array which stores the lengths of t…