English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Open

The longest common prefix array is a very advantageous data structure that,combined with the suffix array and the Burrows-Wheeler transform, allows toefficiently compute some combinatorial properties of a string useful in severalapplications, especially in biological contexts. Nowadays, the input data formany problems are big collections of strings, for instance the data coming from"next-generation" DNA sequencing (NGS) technologies. In this paper we presentthe first lightweight algorithm (called extLCP) for the simultaneouscomputation of the longest common prefix array and the Burrows-Wheelertransform of a very large collection of strings having any length. Thecomputation is realized by performing disk data accesses only via sequentialscans, and the total disk space usage never needs more than twice the outputsize, excluding the disk space required for the input. Moreover, extLCP allowsto compute also the suffix array of the strings of the collection, without anyother further data structure is needed. Finally, we test our algorithm on realdata and compare our results with another tool capable to work in externalmemory on large collections of strings.

Lightweight LCP Construction for Very Large Collections of Strings