Longest Common Subsequence in K-Length Substrings for Run-Length Encoded Strings.

B. Riva Shalom|Eitan Kondratovsky|Ely Porat


Anthology ID:DBLP:conf/spire/ShalomKP25
Volume:String Processing and Information Retrieval - 32nd International Symposium, SPIRE 2025, London, UK, September 8-11, 2025, Proceedings
Year:2025
Venue:Symposium on String Processing and Information Retrieval (SPIRE)
Publisher:Springer
Pages:248-264
URL:https://doi.org/10.1007/978-3-032-05228-5_20
DOI:https://doi.org/10.1007/978-3-032-05228-5_20
DBLP:conf/spire/ShalomKP25
BibTeX:
@inproceedings{shalom-2025-longest, author = {B. Riva Shalom and Eitan Kondratovsky and Ely Porat}, editor = {Golnaz Badkobeh and Jakub Radoszewski and Nicola Tonellotto and Ricardo Baeza-Yates}, title = {{Longest Common Subsequence in K-Length Substrings for Run-Length Encoded Strings}}, booktitle = {{String Processing and Information Retrieval - 32nd International Symposium, SPIRE 2025, London, UK, September 8-11, 2025, Proceedings}}, series = {Lecture Notes in Computer Science}, volume = {16073}, pages = {248--264}, publisher = {Springer}, year = {2025}, url = {https://doi.org/10.1007/978-3-032-05228-5_20}, doi = {https://doi.org/10.1007/978-3-032-05228-5_20} }