Yo-Sub Han, Sang-Ki Ko, Timothy Ng 0001, Kai Salomaa. Closest Substring Problems for Regular Languages. In Mizuho Hoshi, Shinnosuke Seki, editors, Developments in Language Theory - 22nd International Conference, DLT 2018, Tokyo, Japan, September 10-14, 2018, Proceedings. Volume 11088 of Lecture Notes in Computer Science, pages 392-403, Springer, 2018. [doi]
@inproceedings{HanK0S18,
title = {Closest Substring Problems for Regular Languages},
author = {Yo-Sub Han and Sang-Ki Ko and Timothy Ng 0001 and Kai Salomaa},
year = {2018},
doi = {10.1007/978-3-319-98654-8_32},
url = {https://doi.org/10.1007/978-3-319-98654-8_32},
researchr = {https://researchr.org/publication/HanK0S18},
cites = {0},
citedby = {0},
pages = {392-403},
booktitle = {Developments in Language Theory - 22nd International Conference, DLT 2018, Tokyo, Japan, September 10-14, 2018, Proceedings},
editor = {Mizuho Hoshi and Shinnosuke Seki},
volume = {11088},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-319-98654-8},
}