scientific article; zbMATH DE number 6850408

MaRDI QIDQ4607988zbMATH OpenFDO

Authors Paweł Gawrychowski, Adam Karczmarz, Tomasz Kociumaka, Jakub Łącki, Piotr Sankowski

Publication date 15 March 2018

Full work available at URL https://arxiv.org/abs/1511.02612, http://dl.acm.org/citation.cfm?id=3175404

Mathematics Subject Classification ID

Data structures (68P05) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Algorithms on strings (68W32)

Recommendations

• Dynamic String Alignment.
• Upper and lower bounds for dynamic data structures on strings
• Optimization approaches for solving string selection problems
• scientific article; zbMATH DE number 3919857
• Dynamic Compressed Strings with Random Access
• scientific article; zbMATH DE number 3970104
• String covering with optimal covers

Cited in

(35)

• Dynamic relative compression, dynamic partial sums, and substring concatenation
• Shortest unique palindromic substring queries in semi-dynamic settings
• Dynamic and internal longest common substring
• Dynamic index and LZ factorization in compressed space
• Sensitivity of string compressors and repetitiveness measures
• Upper and lower bounds for dynamic data structures on strings
• scientific article; zbMATH DE number 3919857 (Why is no real title available?)
• Dynamic relative compression, dynamic partial sums, and substring concatenation
• Edit distance with block operations
• Repetition Detection in a Dynamic String
• Longest common substring made fully dynamic
• Online algorithms for constructing linear-size suffix trie
• Automata, Languages and Programming
• Practical Performance of Space Efficient Data Structures for Longest Common Extensions.
• scientific article; zbMATH DE number 7765421 (Why is no real title available?)
• Data structures for computing unique palindromes in static and non-static strings
• Online algorithms on antipowers and antiperiods
• Space-efficient conversions from SLPs
• Linear time online algorithms for constructing linear-size suffix trie
• Internal pattern matching queries in a text and applications
• Dynamic longest common substring in polylogarithmic time
• A textbook solution for dynamic strings
• Minimizing tardy processing time on a single machine in near-linear time
• Double-ended palindromic trees in linear time
• Construction of sparse suffix trees and LCE indexes in optimal time and space
• Approximate circular pattern matching under edit distance
• Minimizing tardy processing time on a single machine in near-linear time
• Computing string covers in sublinear time
• Logarithmic-time internal pattern matching queries in compressed and dynamic texts
• Longest common extensions with wildcards: trade-off and applications
• Pattern matching with mismatches and wildcards
• A textbook solution for dynamic strings
• Counting on general run-length grammars
• Bounded weighted edit distance: dynamic algorithms and matching lower bounds
• Dynamic layers of maxima with applications to dominating queries

This page was built for publication:

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