AI Chat AI Image Generator AI Video Text to Speech

A Simple Algorithm for Computing the Document Array

12/21/2018

∙

by Felipe A. Louza, et al.

∙

∙

We present a simple algorithm for computing the document array given the string collection and its suffix array as input. Our algorithm runs in linear time using constant workspace for large collections of short strings.

page 1

page 2

page 3

page 4

research

∙ 10/27/2017

Lyndon Array Construction during Burrows-Wheeler Inversion

In this paper we present an algorithm to compute the Lyndon array of a s...

0 Felipe A. Louza, et al. ∙

research

∙ 12/02/2022

Computing the optimal BWT of very large string collections

It is known that the exact form of the Burrows-Wheeler-Transform (BWT) o...

0 Davide Cenzato, et al. ∙

research

∙ 07/03/2022

Suffix sorting via matching statistics

We introduce a new algorithm for constructing the generalized suffix arr...

0 Zsuzsanna Lipták, et al. ∙

research

∙ 02/17/2021

Linear Time Runs over General Ordered Alphabets

A run in a string is a maximal periodic substring. For example, the stri...

0 Jonas Ellert, et al. ∙

research

∙ 06/21/2021

Computing the original eBWT faster, simpler, and with less memory

Mantaci et al. [TCS 2007] defined the eBWT to extend the definition of t...

0 Christina Boucher, et al. ∙

research

∙ 05/17/2018

External memory BWT and LCP computation for sequence collections with applications

We propose an external memory algorithm for the computation of the BWT a...

0 Lavinia Egidi, et al. ∙

research

∙ 09/02/2020

An Algorithm for Automatically Updating a Forsyth-Edwards Notation String Without an Array Board Representation

We present an algorithm that correctly updates the Forsyth-Edwards Notat...

0 Azlan Iqbal, et al. ∙