Minimizers in semi-dynamic strings

DOI10.1007/978-3-032-04700-7_32MaRDI QIDQ6852199zbMATH OpenFDO

Authors Wiktor Zuba, Oded Lachish, Solon P. Pissis

Publication date 26 February 2026

Full work available at URL https://doi.org/10.1007/978-3-032-04700-7_32

zbMATH Keywords

dynamic stringsminimizerssamplingstring algorithms

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A dynamic edit distance table
• Absent words in a sliding window with applications
• Combinatorics of minimal absent words for a sliding window
• Compact directed acyclic word graphs for a sliding window
• Computational geometry. Algorithms and applications.
• Computing minimal unique substrings for a sliding window
• Dynamic text and static pattern matching
• Efficient randomized pattern-matching algorithms
• Equivalence between priority queues and sorting
• Fundamentals of Computation Theory
• scientific article; zbMATH DE number 1003303 (Why is no real title available?)
• Incremental String Comparison
• Introduction to algorithms
• Maintaining the size of LZ77 on semi-dynamic strings
• Minimizing the minimizers via alphabet reordering
• Palindromic trees for a sliding window and its applications
• Shortest unique palindromic substring queries in semi-dynamic settings
• Sliding suffix tree
• String processing and information retrieval. 15th international symposium, SPIRE 2008, Melbourne, Australia, November 10--12, 2008. Proceedings
• The dynamic k-mismatch problem

This page was built for publication: Minimizers in semi-dynamic strings

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