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

@inproceedings{wang-2023-algorithms, author = {Lusheng Wang and Binhai Zhu}, editor = {Franco Maria Nardini and Nadia Pisanti and Rossano Venturini}, title = {{Algorithms and Hardness for the Longest Common Subsequence of Three Strings and Related Problems}}, booktitle = {{String Processing and Information Retrieval - 30th International Symposium, SPIRE 2023, Pisa, Italy, September 26-28, 2023, Proceedings}}, series = {Lecture Notes in Computer Science}, volume = {14240}, pages = {367--380}, publisher = {Springer}, year = {2023}, url = {https://doi.org/10.1007/978-3-031-43980-3_30}, doi = {https://doi.org/10.1007/978-3-031-43980-3_30} }