Algorithms and Hardness for the Longest Common Subsequence of Three Strings and Related Problems-Reference-Cited by-同舟云学术

Algorithms and Hardness for the Longest Common Subsequence of Three Strings and Related Problems

Published:2023 Issue: Volume: Page:367-380
ISSN:0302-9743
Container-title:String Processing and Information Retrieval
language:
Short-container-title:

Author:

Wang Lusheng^ORCID,Zhu Binhai^ORCID

Publisher

Springer Nature Switzerland

Link

https://link.springer.com/content/pdf/10.1007/978-3-031-43980-3_30

Reference20 articles.

1. Abboud, A., Backurs, A., Williams, V.V.: Tight hardness results for LCS and other sequence similarity measures. In: IEEE 56th Annual Symposium on Foundations of Computer Science (FOCS’15), pp. 59–78. IEEE Computer Society (2015)

2. Berman, P.R., Scott, A.D., Karpinski, M.: Approximation hardness and satisfiability of bounded occurrence instances of SAT. Electron. Colloquium Comput. Complex., TR03-022 (2003)

3. Bhuiyan, M.T.H., Alam, M.R., Rahman, M.S.: Computing the longest common almost-increasing subsequence. Theor. Comput. Sci. 930, 157–178 (2022)

4. Bringmann, K., Künnemann, M.: Quadratic conditional lower bounds for string problems and dynamic time warping. In: Proceedings of the 56th Annual Symposium on Foundations of Computer Science (FOCS’15), pp. 79–97. IEEE Computer Society (2015)

5. Bringmann, K., Künnemann, M.: Multivariate fine-grained complexity of longest common subsequence. In: Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’18), pp. 1216–1235. SIAM (2018)

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The Longest Subsequence-Repeated Subsequence Problem;Combinatorial Optimization and Applications;2023-12-09