Opportunistic data structures with applications

DOI10.1109/SFCS.2000.892127MaRDI QIDQ7239966zbMATH OpenFDO

Authors Paolo Ferragina, Giovanni Manzini

Publication date 8 May 2026

Full work available at URL https://doi.org/10.1109/SFCS.2000.892127

Mathematics Subject Classification ID

Computer science (68-XX)

Cited in

(9)

• Genome assembly, from practice to theory: safe, complete and linear-time
• Two-dimensional longest common extension queries in compact space
• Succinct preferential-attachment graphs
• Extending the Burrows-Wheeler transform for Cartesian tree matching and constructing it
• Grammar index by induced suffix sorting
• Fast and lightweight distributed suffix array construction
• Fast pattern matching with epsilon transitions
• Formalised Burrows-Wheeler Transform
• Repetition aware text indexing for matching patterns with wildcards

This page was built for publication: Opportunistic data structures with applications

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