Cover Image

String Sanitization Under Edit Distance: Improved and Generalized

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Mieno, Takuya, Pissis, Solon P., Stougie, Leen, Sweering, Michelle
Format:	Preprint
Published:	2020
Subjects:	Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

When is String Reconstruction using de Bruijn Graphs Hard?
by: Bals, Ben, et al.
Published: (2025)

Text Indexing and Pattern Matching with Ephemeral Edits
by: Pissis, Solon P.
Published: (2025)

Elastic-Degenerate String Comparison
by: Gabory, Esteban, et al.
Published: (2024)

Minimizers in Semi-Dynamic Strings
by: Zuba, Wiktor, et al.
Published: (2025)

Approximate Circular Pattern Matching under Edit Distance
by: Charalampopoulos, Panagiotis, et al.
Published: (2024)

Maximal Palindromes in MPC: Simple and Optimal
by: Pissis, Solon P.
Published: (2025)

Optimal prefix-suffix queries with applications
by: Pissis, Solon P.
Published: (2024)

Longest Unbordered Factors on Run-Length Encoded Strings
by: Sekizaki, Shoma, et al.
Published: (2025)

Space-Efficient Online Computation of String Net Occurrences
by: Mieno, Takuya, et al.
Published: (2024)

Faster ED-String Matching with $k$ Mismatches
by: Gawrychowski, Paweł, et al.
Published: (2025)

Space-Efficient Indexes for Uncertain Strings
by: Gabory, Esteban, et al.
Published: (2024)

Online Flow Time Minimization with Gradually Revealed Jobs
by: Lindermayr, Alexander, et al.
Published: (2026)

Size-constrained Weighted Ancestors with Applications
by: Bille, Philip, et al.
Published: (2023)

Gapped String Indexing in Subquadratic Space and Sublinear Query Time
by: Bille, Philip, et al.
Published: (2022)

Dynamic Dyck and Tree Edit Distance: Decompositions and Reductions to String Edit Distance
by: Das, Debarati, et al.
Published: (2025)

Indexing Strings with Utilities
by: Bernardini, Giulia, et al.
Published: (2025)

Almost succinct representation of maximal palindromes
by: Mieno, Takuya, et al.
Published: (2025)

Total Completion Time Scheduling Under Scenarios
by: Bosman, Thomas, et al.
Published: (2024)

Faster Algorithms for Longest Common Substring
by: Charalampopoulos, Panagiotis, et al.
Published: (2021)

Optimal Enumeration of Eulerian Trails in Directed Graphs
by: Bals, Ben, et al.
Published: (2026)

Text Indexing for Long Patterns using Locally Consistent Anchors
by: Ayad, Lorraine A. K., et al.
Published: (2024)

Faster Algorithms for Shortest Unique or Absent Substrings
by: Charalampopoulos, Panagiotis, et al.
Published: (2026)

Minimizing the Minimizers via Alphabet Reordering
by: Verbeek, Hilde, et al.
Published: (2024)

Sparse Suffix and LCP Array: Simple, Direct, Small, and Fast
by: Ayad, Lorraine A. K., et al.
Published: (2023)

Faster and simpler online/sliding rightmost Lempel-Ziv factorizations
by: Sumiyoshi, Wataru, et al.
Published: (2024)

On the number of MUSs crossing a position
by: Fujimaru, Hiroto, et al.
Published: (2025)

Data Structures for Range Sorted Consecutive Occurrence Queries
by: Akram, Waseem, et al.
Published: (2024)

Exponent-Strings and Their Edit Distance
by: Baek, Ingyu
Published: (2024)

Testing Quasiperiodicity
by: Awofeso, Christine, et al.
Published: (2025)

Subsequence Covers of Words
by: Charalampopoulos, Panagiotis, et al.
Published: (2025)

Scalable Order-Preserving Pattern Mining
by: Li, Ling, et al.
Published: (2024)

Online and Offline Algorithms for Counting Distinct Closed Factors via Sliding Suffix Trees
by: Mieno, Takuya, et al.
Published: (2024)

Constant-time edge label and leaf pointer maintenance on sliding suffix trees
by: Leonard, Laurentius, et al.
Published: (2023)

Shortest cover after edit
by: Mitani, Kazuki, et al.
Published: (2024)

Contextual Pattern Mining and Counting
by: Li, Ling, et al.
Published: (2025)

Pattern Masking for Dictionary Matching
by: Charalampopoulos, Panagiotis, et al.
Published: (2020)

Approximate Circular Pattern Matching
by: Charalampopoulos, Panagiotis, et al.
Published: (2022)

Resilient Pattern Mining
by: Bian, Pengxin, et al.
Published: (2025)

Many Flavors of Edit Distance
by: Bhattacharya, Sudatta, et al.
Published: (2024)

Subsequence Matching and LCS with Segment Number Constraints
by: Yonemoto, Yuki, et al.
Published: (2024)