Construction of Fundamental Data Structures for Strings

DOI10.1007/978-3-030-55108-7MaRDI QIDQ5005912zbMATH OpenOpenAlexFDO

Authors Felipe A. Louza, Simon Gog, Guilherme P. Telles

Publication date 11 August 2021

Published in SpringerBriefs in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-55108-7

zbMATH Keywords

document arrayLCP arrayLyndon arraysuffix arraysuffix sorting problem

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Data structures (68P05) Algorithms on strings (68W32)

Recommendations

• A framework of dynamic data structures for string processing
• Data structures for efficient string algorithms.
• Data structures and algorithms for the string statistics problem
• Upper and lower bounds for dynamic data structures on strings
• Automata, Languages and Programming
• Data structures and algorithms for approximate string matching
• Deterministic indexing for packed strings
• An external-memory algorithm for string graph construction
• Data-parallel string-manipulating programs

Cited in

(7)

• Computing the original eBWT faster, simpler, and with less memory
• Border Array for Structural Strings
• A data structure for a sequence of string accesses in external memory
• scientific article; zbMATH DE number 1982178 (Why is no real title available?)
• Inducing enhanced suffix arrays for string collections
• String Processing and Information Retrieval
• Bioinformatics algorithms. Sequence analysis, genome rearrangements, and phylogenetic reconstruction

This page was built for publication: Construction of Fundamental Data Structures for Strings

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