Cover Image

An Algorithm for the Longest Common Subsequence and Substring Problem for Multiple Strings

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Li, Rao
Format:	Preprint
Published:	2024
Subjects:	Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

Dynamic Longest Common Substring in Polylogarithmic Time
by: Charalampopoulos, Panagiotis, et al.
Published: (2020)

Improved Lower Bounds on the Expected Length of Longest Common Subsequences
by: Heineman, George T., et al.
Published: (2024)

Finding Diverse Strings and Longest Common Subsequences in a Graph
by: Shida, Yuto, et al.
Published: (2024)

The Longest Common Bitonic Subsequence: A Match-Sensitive Dynamic Programming Approach
by: Rahat, Md. Tanzeem, et al.
Published: (2025)

Longest Common Extension of a Dynamic String in Parallel Constant Time
by: Albert, Daniel
Published: (2026)

Range Longest Increasing Subsequence and its Relatives
by: S., Karthik C., et al.
Published: (2024)

Deterministic Longest Common Subsequence Approximation in Near-Linear Time
by: Boneh, Itai, et al.
Published: (2025)

Efficient Algorithms to Compute Closed Substrings
by: Jain, Samkith K, et al.
Published: (2025)

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

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

Exact Sampling of Permutations with a Fixed Longest Increasing Subsequence
by: Clifford, Peter, et al.
Published: (2026)

Longest Common Extensions with Wildcards: Trade-off and Applications
by: Bathie, Gabriel, et al.
Published: (2024)

Quantum Algorithm for the Multiple String Matching Problem
by: Khadiev, Kamil, et al.
Published: (2024)

Substring Compression Variations and LZ78-Derivates
by: Köppl, Dominik
Published: (2024)

LZ78 Substring Compression in Compressed Space
by: Shibata, Hiroki, et al.
Published: (2025)

Counting Distinct Square Substrings in Sublinear Time
by: Charalampopoulos, Panagiotis, et al.
Published: (2025)

A Space-Efficient Algorithm for Longest Common Almost Increasing Subsequence of Two Sequences
by: Rahat, Md Tanzeem, et al.
Published: (2025)

The Complexity of Maximal Common Subsequence Enumeration
by: Buzzega, Giovanni, et al.
Published: (2025)

An Algebraic Approach to the Longest Path Problem
by: Khazali, Omar Al -
Published: (2023)

Maximal Closed Substrings
by: Badkobeh, Golnaz, et al.
Published: (2022)

Differentially Private Substring and Document Counting with Near-Optimal Error
by: Bernardini, Giulia, et al.
Published: (2024)

Quantum Algorithm for Searching for the Longest Segment and the Largest Empty Rectangle
by: Khadiev, Kamil, et al.
Published: (2025)

Fast and Optimal Differentially Private Frequent-Substring Mining
by: Guo, Peaker, et al.
Published: (2026)

Algorithms for Parameterized String Matching with Mismatches
by: Saha, Apurba, et al.
Published: (2024)

On the Complexity of Finding Approximate LCS of Multiple Strings
by: Hasibi, Hamed, et al.
Published: (2025)

Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems
by: Chen, Lin, et al.
Published: (2026)

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

Near-real-time Solutions for Online String Problems
by: Köppl, Dominik, et al.
Published: (2026)

Variations on the Problem of Identifying Spectrum-Preserving String Sets
by: Chakraborty, Sankardeep, et al.
Published: (2026)

Improved Approximation Algorithms for the Multiple-Depot Split Delivery Vehicle Routing Problem
by: Zhao, Jingyang, et al.
Published: (2026)

Revisiting the Folklore Algorithm for Random Access to Grammar-Compressed Strings
by: Cleary, Alan M., et al.
Published: (2024)

A Performance Bound for the Greedy Algorithm in a Generalized Class of String Optimization Problems
by: Van Over, Brandon, et al.
Published: (2024)

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

Quantum Algorithms for the Shortest Common Superstring and Text Assembling Problems
by: Khadiev, Kamil, et al.
Published: (2023)

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

Greedy Conjecture for the Shortest Common Superstring Problem and its Strengthenings
by: Nikolaev, Maksim
Published: (2024)

Fast Algorithms for Graph Arboricity and Related Problems
by: Cen, Ruoxu, et al.
Published: (2025)

Subsequence Matching and LCS under Cartesian-Tree Equivalence
by: Tsujimoto, Taketo, et al.
Published: (2024)

Efficiently Finding All Minimal and Shortest Absent Subsequences in a String
by: Manea, Florin, et al.
Published: (2025)