Saved in:
| Main Authors: | Mhaskar, Neerja, Smyth, W. F. |
|---|---|
| Format: | Preprint |
| Published: |
2022
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2211.11856 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
On the Complexity of Finding Approximate LCS of Multiple Strings
by: Hasibi, Hamed, et al.
Published: (2025)
by: Hasibi, Hamed, et al.
Published: (2025)
Practical KMP/BM Style Pattern-Matching on Indeterminate Strings
by: Dehghani, Hossein, et al.
Published: (2022)
by: Dehghani, Hossein, et al.
Published: (2022)
V-Words, Lyndon Words and Galois Words
by: Daykin, Jacqueline W., et al.
Published: (2024)
by: Daykin, Jacqueline W., et al.
Published: (2024)
Efficient Algorithms to Compute Closed Substrings
by: Jain, Samkith K, et al.
Published: (2025)
by: Jain, Samkith K, et al.
Published: (2025)
Computing String Covers in Sublinear Time
by: Radoszewski, Jakub, et al.
Published: (2024)
by: Radoszewski, Jakub, et al.
Published: (2024)
Online String Attractors
by: Whittington, Philip
Published: (2024)
by: Whittington, Philip
Published: (2024)
A Textbook Solution for Dynamic Strings
by: Lipták, Zsuzsanna, et al.
Published: (2024)
by: Lipták, Zsuzsanna, et al.
Published: (2024)
Scalable Distributed String Sorting
by: Kurpicz, Florian, et al.
Published: (2024)
by: Kurpicz, Florian, et al.
Published: (2024)
Pattern Discovery in Colored Strings
by: Lipták, Zsuzsanna, et al.
Published: (2020)
by: Lipták, Zsuzsanna, et al.
Published: (2020)
Minimizers in Semi-Dynamic Strings
by: Zuba, Wiktor, et al.
Published: (2025)
by: Zuba, Wiktor, et al.
Published: (2025)
String Indexing with Compressed Patterns
by: Bille, Philip, et al.
Published: (2019)
by: Bille, Philip, et al.
Published: (2019)
Elastic-Degenerate String Comparison
by: Gabory, Esteban, et al.
Published: (2024)
by: Gabory, Esteban, et al.
Published: (2024)
Algorithms for Parameterized String Matching with Mismatches
by: Saha, Apurba, et al.
Published: (2024)
by: Saha, Apurba, et al.
Published: (2024)
Online Computation of String Net Frequency
by: Guo, Peaker, et al.
Published: (2024)
by: Guo, Peaker, et al.
Published: (2024)
Sensitivity of Repetitiveness Measures to String Reversal
by: Bannai, Hideo, et al.
Published: (2026)
by: Bannai, Hideo, et al.
Published: (2026)
Searching 2D-Strings for Matching Frames
by: Boneh, Itai, et al.
Published: (2023)
by: Boneh, Itai, et al.
Published: (2023)
Faster ED-String Matching with $k$ Mismatches
by: Gawrychowski, Paweł, et al.
Published: (2025)
by: Gawrychowski, Paweł, et al.
Published: (2025)
Generalization of Repetitiveness Measures for Two-Dimensional Strings
by: Carfagna, Lorenzo, et al.
Published: (2025)
by: Carfagna, Lorenzo, et al.
Published: (2025)
String Representation in Suffixient Set Size Space
by: Shibata, Hiroki, et al.
Published: (2026)
by: Shibata, Hiroki, et al.
Published: (2026)
Time-Optimal Construction of String Synchronizing Sets
by: Ellert, Jonas, et al.
Published: (2026)
by: Ellert, Jonas, et al.
Published: (2026)
Indexing Strings with Utilities
by: Bernardini, Giulia, et al.
Published: (2025)
by: Bernardini, Giulia, et al.
Published: (2025)
Near-real-time Solutions for Online String Problems
by: Köppl, Dominik, et al.
Published: (2026)
by: Köppl, Dominik, et al.
Published: (2026)
String Indexing for Top-$k$ Close Consecutive Occurrences
by: Bille, Philip, et al.
Published: (2020)
by: Bille, Philip, et al.
Published: (2020)
The CDAWG Index and Pattern Matching on Grammar-Compressed Strings
by: Cleary, Alan M., et al.
Published: (2024)
by: Cleary, Alan M., et al.
Published: (2024)
Near-Optimal Trace Reconstruction for Mildly Separated Strings
by: Aamand, Anders, et al.
Published: (2024)
by: Aamand, Anders, et al.
Published: (2024)
Faster and Simpler Online Computation of String Net Frequency
by: Inenaga, Shunsuke
Published: (2024)
by: Inenaga, Shunsuke
Published: (2024)
Compressed Dictionary Matching on Run-Length Encoded Strings
by: Bille, Philip, et al.
Published: (2025)
by: Bille, Philip, et al.
Published: (2025)
Variations on the Problem of Identifying Spectrum-Preserving String Sets
by: Chakraborty, Sankardeep, et al.
Published: (2026)
by: Chakraborty, Sankardeep, et al.
Published: (2026)
Zip-Tries: Simple Dynamic Data Structures for Strings
by: Eppstein, David, et al.
Published: (2025)
by: Eppstein, David, et al.
Published: (2025)
Longest Unbordered Factors on Run-Length Encoded Strings
by: Sekizaki, Shoma, et al.
Published: (2025)
by: Sekizaki, Shoma, et al.
Published: (2025)
String Partition for Building Long Burrows-Wheeler Transforms
by: Adler, Enno, et al.
Published: (2024)
by: Adler, Enno, et al.
Published: (2024)
Space-Efficient Online Computation of String Net Occurrences
by: Mieno, Takuya, et al.
Published: (2024)
by: Mieno, Takuya, et al.
Published: (2024)
String Sanitization Under Edit Distance: Improved and Generalized
by: Mieno, Takuya, et al.
Published: (2020)
by: Mieno, Takuya, et al.
Published: (2020)
Gapped String Indexing in Subquadratic Space and Sublinear Query Time
by: Bille, Philip, et al.
Published: (2022)
by: Bille, Philip, et al.
Published: (2022)
Tight Lower Bounds for Central String Queries in Compressed Space
by: Kempa, Dominik, et al.
Published: (2025)
by: Kempa, Dominik, et al.
Published: (2025)
When is String Reconstruction using de Bruijn Graphs Hard?
by: Bals, Ben, et al.
Published: (2025)
by: Bals, Ben, et al.
Published: (2025)
Exploiting New Properties of String Net Frequency for Efficient Computation
by: Guo, Peaker, et al.
Published: (2024)
by: Guo, Peaker, et al.
Published: (2024)
Revisiting the Folklore Algorithm for Random Access to Grammar-Compressed Strings
by: Cleary, Alan M., et al.
Published: (2024)
by: Cleary, Alan M., et al.
Published: (2024)
All-Pairs Suffix-Prefix on Fully Dynamic Set of Strings
by: Kikuchi, Masaru, et al.
Published: (2024)
by: Kikuchi, Masaru, et al.
Published: (2024)
Converting an Integer to a Decimal String in Under Two Nanoseconds
by: Gareau, Jaël Champagne, et al.
Published: (2026)
by: Gareau, Jaël Champagne, et al.
Published: (2026)
Similar Items
-
On the Complexity of Finding Approximate LCS of Multiple Strings
by: Hasibi, Hamed, et al.
Published: (2025) -
Practical KMP/BM Style Pattern-Matching on Indeterminate Strings
by: Dehghani, Hossein, et al.
Published: (2022) -
V-Words, Lyndon Words and Galois Words
by: Daykin, Jacqueline W., et al.
Published: (2024) -
Efficient Algorithms to Compute Closed Substrings
by: Jain, Samkith K, et al.
Published: (2025) -
Computing String Covers in Sublinear Time
by: Radoszewski, Jakub, et al.
Published: (2024)