A general technique for managing strings in comparison-driven data structures

DOI10.1007/978-3-540-27836-8_52MaRDI QIDQ5466498zbMATH OpenOpenAlexFDO

Authors Gianni Franceschini, Roberto Grossi

Publication date 24 August 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b99859

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• Managing unbounded-length keys in comparison-driven data structures with applications to online indexing
• scientific article; zbMATH DE number 6850408
• Digital access to comparison-based tree data structures and algorithms
• Dynamic string searching
• Compressed Data Structures for Dynamic Sequences

Cited in

(6)

• Managing unbounded-length keys in comparison-driven data structures with applications to online indexing
• Cross-document pattern matching
• Multikey quickselect
• Construction of Fundamental Data Structures for Strings
• String Processing and Information Retrieval
• Computing runs on a general alphabet

This page was built for publication: A general technique for managing strings in comparison-driven data structures

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