Bidirectional String Anchors: A New String Sampling Mechanism

DOI10.4230/LIPICS.ESA.2021.64MaRDI QIDQ6075958zbMATH OpenOpenAlexFDO

Authors Grigorios Loukides, Solon P. Pissis

Publication date 20 September 2023

Full work available at URL https://hal.inria.fr/hal-03395425

zbMATH Keywords

string algorithmsstring samplingtext indexingtop-K similarity search

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(6)

• Frequency-constrained substring complexity
• Sparse suffix and LCP array: simple, direct, small, and fast
• The mod-minimizer: a simple and efficient sampling algorithm for long k-mers
• Minimizing the minimizers via alphabet reordering
• Missing value replacement in strings and applications
• Sparse suffix and LCP array: simple, direct, small, and fast

This page was built for publication: Bidirectional String Anchors: A New String Sampling Mechanism

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