Longest common prefix arrays for succinct \(k\)-spectra

DOI10.1007/978-3-031-43980-3_1MaRDI QIDQ6545406

Simon J. Puglisi, Jarno N. Alanko, Elena Biagi

Publication date: 29 May 2024

zbMATH Keywords

de Bruijn graphstring algorithmsBurrows-Wheeler transformlongest common prefixcompressed data structuresBWT\(k\)-merLCPlongest common suffix

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Data structures (68P05) Algorithms on strings (68W32)

Cites Work

• Computing the longest common prefix array based on the Burrows-Wheeler transform

This page was built for publication: Longest common prefix arrays for succinct \(k\)-spectra

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6545406)