Image de couverture de livre

Subsequence Matching and LCS under Cartesian-Tree Equivalence

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Tsujimoto, Taketo, Yonemoto, Yuki, Shibata, Hiroki, Mieno, Takuya, Nakashima, Yuto, Inenaga, Shunsuke
Format:	Preprint
Publié:	2024
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

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

Faster Space-Efficient STR-IC-LCS Computation
par: Yonemoto, Yuki, et autres
Publié: (2022)

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

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

Simple Linear-time Repetition Factorization
par: Yonemoto, Yuki, et autres
Publié: (2024)

LZBE: an LZ-style compressor supporting $O(\log n)$-time random access
par: Shibata, Hiroki, et autres
Publié: (2025)

Tight Additive Sensitivity on LZ-style Compressors and String Attractors
par: Fujie, Yuto, et autres
Publié: (2025)

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

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

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

Counting distinct (non-)crossing substrings
par: Umezaki, Haruki, et autres
Publié: (2025)

Tight bounds for the sensitivity of CDAWGs with left-end edits
par: Fujimaru, Hiroto, et autres
Publié: (2023)

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

Packed Acyclic Deterministic Finite Automata
par: Shibata, Hiroki, et autres
Publié: (2024)

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

Edit and Alphabet-Ordering Sensitivity of Lex-parse
par: Nakashima, Yuto, et autres
Publié: (2024)

Faster and Simpler Online Computation of String Net Frequency
par: Inenaga, Shunsuke
Publié: (2024)

Sensitivity of Repetitiveness Measures to String Reversal
par: Bannai, Hideo, et autres
Publié: (2026)

On the Number of Non-equivalent Parameterized Squares in a String
par: Hamai, Rikuya, et autres
Publié: (2024)

Nyldon Factorization of Thue-Morse Words and Fibonacci Words
par: Kishi, Kaisei, et autres
Publié: (2025)

Relating Left and Right Extensions of Maximal Repeats
par: Inenaga, Shunsuke, et autres
Publié: (2024)

All-Pairs Suffix-Prefix on Fully Dynamic Set of Strings
par: Kikuchi, Masaru, et autres
Publié: (2024)

On the sensitivity of CDAWG-grammars
par: Fujimaru, Hiroto, et autres
Publié: (2025)

The CDAWG Index and Pattern Matching on Grammar-Compressed Strings
par: Cleary, Alan M., et autres
Publié: (2024)

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

Longest Unbordered Factors on Run-Length Encoded Strings
par: Sekizaki, Shoma, et autres
Publié: (2025)

Linear-size Suffix Tries and Linear-size CDAWGs Simplified and Improved
par: Inenaga, Shunsuke
Publié: (2024)

Constant sensitivity on the CDAWGs
par: Hamai, Rikuya, et autres
Publié: (2025)

Approximate Cartesian Tree Matching with Substitutions
par: Charalampopoulos, Panagiotis, et autres
Publié: (2026)

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

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

Cartesian Forest Matching
par: Auvray, Bastien, et autres
Publié: (2025)

Approximate Cartesian Tree Matching with One Difference
par: Auvray, Bastien, et autres
Publié: (2025)

Approximate Cartesian Tree Matching: an Approach Using Swaps
par: Auvray, Bastien, et autres
Publié: (2023)

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

Revisiting the Folklore Algorithm for Random Access to Grammar-Compressed Strings
par: Cleary, Alan M., et autres
Publié: (2024)

Extending the Burrows-Wheeler Transform for Cartesian Tree Matching and Constructing It
par: Osterkamp, Eric M., et autres
Publié: (2024)

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

On the Complexity of Finding Approximate LCS of Multiple Strings
par: Hasibi, Hamed, et autres
Publié: (2025)

LZ78 Substring Compression in Compressed Space
par: Shibata, Hiroki, et autres
Publié: (2025)