# A Simple Algorithm for Computing the Document Array

## TL;DR

This paper introduces a straightforward, linear-time algorithm for computing the document array from a string collection and its suffix array, using minimal extra space for constant alphabet strings.

## Contribution

It provides a simple, efficient method for document array computation with linear time complexity and constant space for constant alphabets.

## Key findings

- Runs in linear time
- Uses constant additional space for constant alphabets
- Efficiently computes document arrays

## Abstract

We present a simple algorithm for computing the document array given a string collection and its suffix array as input. Our algorithm runs in linear time using constant additional space for strings from constant alphabets.