Quantum Algorithms for Longest Common Substring with a Gap.

Daniel Gibney|Md. Helal Hossen


Anthology ID:DBLP:conf/spire/GibneyH24
Volume:String Processing and Information Retrieval - 31st International Symposium, SPIRE 2024, Puerto Vallarta, Mexico, September 23-25, 2024, Proceedings
Year:2024
Venue:Symposium on String Processing and Information Retrieval (SPIRE)
Publisher:Springer
Pages:143-158
URL:https://doi.org/10.1007/978-3-031-72200-4_11
DOI:https://doi.org/10.1007/978-3-031-72200-4_11
DBLP:conf/spire/GibneyH24
BibTeX:
@inproceedings{gibney-2024-quantum, author = {Daniel Gibney and Md. Helal Hossen}, editor = {Zsuzsanna Lipt\'{a}k and Edleno Silva de Moura and Karina Figueroa and Ricardo Baeza-Yates}, title = {{Quantum Algorithms for Longest Common Substring with a Gap}}, booktitle = {{String Processing and Information Retrieval - 31st International Symposium, SPIRE 2024, Puerto Vallarta, Mexico, September 23-25, 2024, Proceedings}}, series = {Lecture Notes in Computer Science}, volume = {14899}, pages = {143--158}, publisher = {Springer}, year = {2024}, url = {https://doi.org/10.1007/978-3-031-72200-4_11}, doi = {https://doi.org/10.1007/978-3-031-72200-4_11} }