Image de couverture de livre

Longest Unbordered Factors on Run-Length Encoded Strings

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Sekizaki, Shoma, Mieno, Takuya
Format:	Preprint
Publié:	2025
Sujets:	Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Space-Efficient Online Computation of String Net Occurrences
par: Mieno, Takuya, et autres
Publié: (2024)

Compressed Dictionary Matching on Run-Length Encoded Strings
par: Bille, Philip, et autres
Publié: (2025)

String Sanitization Under Edit Distance: Improved and Generalized
par: Mieno, Takuya, et autres
Publié: (2020)

Almost succinct representation of maximal palindromes
par: Mieno, Takuya, et autres
Publié: (2025)

Online and Offline Algorithms for Counting Distinct Closed Factors via Sliding Suffix Trees
par: Mieno, Takuya, et autres
Publié: (2024)

An Algorithm for the Longest Common Subsequence and Substring Problem for Multiple Strings
par: Li, Rao
Publié: (2024)

On the number of MUSs crossing a position
par: Fujimaru, Hiroto, et autres
Publié: (2025)

Faster and simpler online/sliding rightmost Lempel-Ziv factorizations
par: Sumiyoshi, Wataru, et autres
Publié: (2024)

Longest Common Extension of a Dynamic String in Parallel Constant Time
par: Albert, Daniel
Publié: (2026)

Data Structures for Range Sorted Consecutive Occurrence Queries
par: Akram, Waseem, et autres
Publié: (2024)

Improved Lower Bounds on the Expected Length of Longest Common Subsequences
par: Heineman, George T., et autres
Publié: (2024)

Constant-time edge label and leaf pointer maintenance on sliding suffix trees
par: Leonard, Laurentius, et autres
Publié: (2023)

Shortest cover after edit
par: Mitani, Kazuki, et autres
Publié: (2024)

Counting on General Run-Length Grammars
par: Navarro, Gonzalo, et autres
Publié: (2024)

Subsequence Matching and LCS with Segment Number Constraints
par: Yonemoto, Yuki, et autres
Publié: (2024)

Optimal-Time Mapping in Run-Length Compressed PBWT
par: Bonizzoni, Paola, et autres
Publié: (2026)

Computing maximal palindromes in non-standard matching models
par: Mieno, Takuya, et autres
Publié: (2022)

Subsequence Matching and LCS under Cartesian-Tree Equivalence
par: Tsujimoto, Taketo, et autres
Publié: (2024)

Faster Algorithms for Longest Common Substring
par: Charalampopoulos, Panagiotis, et autres
Publié: (2021)

Range Longest Increasing Subsequence and its Relatives
par: S., Karthik C., et autres
Publié: (2024)

Dynamic Longest Common Substring in Polylogarithmic Time
par: Charalampopoulos, Panagiotis, et autres
Publié: (2020)

Longest Common Extensions with Wildcards: Trade-off and Applications
par: Bathie, Gabriel, et autres
Publié: (2024)

Computing Minimal Absent Words and Extended Bispecial Factors with CDAWG Space
par: Inenaga, Shunsuke, et autres
Publié: (2024)

An Efficient Data Structure and Algorithm for Long-Match Query in Run-Length Compressed BWT
par: Sanaullah, Ahsan, et autres
Publié: (2025)

Online Computation of Palindromes and Suffix Trees on Tries
par: Shibata, Hiroki, et autres
Publié: (2026)

Flashback: A Reversible Bilateral Run-Peeling Decomposition of Strings
par: Konstantinovsky, Thomas, et autres
Publié: (2026)

The Longest Common Bitonic Subsequence: A Match-Sensitive Dynamic Programming Approach
par: Rahat, Md. Tanzeem, et autres
Publié: (2025)

Bounds on Longest Simple Cycles in Weighted Directed Graphs via Optimum Cycle Means
par: Dasdan, Ali
Publié: (2025)

Finding Diverse Strings and Longest Common Subsequences in a Graph
par: Shida, Yuto, et autres
Publié: (2024)

Exact Sampling of Permutations with a Fixed Longest Increasing Subsequence
par: Clifford, Peter, et autres
Publié: (2026)

An Algebraic Approach to the Longest Path Problem
par: Khazali, Omar Al -
Publié: (2023)

Online String Attractors
par: Whittington, Philip
Publié: (2024)

Quantum Algorithm for Searching for the Longest Segment and the Largest Empty Rectangle
par: Khadiev, Kamil, et autres
Publié: (2025)

Minimizers in Semi-Dynamic Strings
par: Zuba, Wiktor, et autres
Publié: (2025)

String Covering: A Survey
par: Mhaskar, Neerja, et autres
Publié: (2022)

Scalable Distributed String Sorting
par: Kurpicz, Florian, et autres
Publié: (2024)

Pattern Discovery in Colored Strings
par: Lipták, Zsuzsanna, et autres
Publié: (2020)

String Indexing with Compressed Patterns
par: Bille, Philip, et autres
Publié: (2019)

Elastic-Degenerate String Comparison
par: Gabory, Esteban, et autres
Publié: (2024)

Computing String Covers in Sublinear Time
par: Radoszewski, Jakub, et autres
Publié: (2024)