scientific article; zbMATH DE number 7378703
From MaRDI portal
Publication:5009593
DOI10.4230/LIPIcs.ESA.2018.33MaRDI QIDQ5009593
Michał Gánczorz, Paweł Gawrychowski, Tomasz Kociumaka, Artur Jeż
Publication date: 4 August 2021
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (2)
Permutation-constrained common string partitions with applications ⋮ The complexity of finding common partitions of genomes with predefined block sizes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximation of grammar-based compression via recompression
- Maintaining dynamic sequences under equality tests in polylogarithmic time
- Block edit models for approximate string matching
- Edit distance with block deletions
- Edit distance with move operations
- Minimum common string partition problem: hardness and approximations
- Symmetry breaking for suffix tree construction
- Faster Fully Compressed Pattern Matching by Recompression
- Edit Distance Cannot Be Computed in Strongly Subquadratic Time (unless SETH is false)
- The greedy algorithm for the minimum common string partition problem
- The string edit distance matching problem with moves
- Approximate nearest neighbors and sequence comparison with block operations
- Algorithms for approximate string matching
- Deterministic coin tossing with applications to optimal parallel list ranking
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- Minimum Common String Partition Parameterized by Partition Size Is Fixed-Parameter Tractable
This page was built for publication:
