Daniel R. Allen, Sharma V. Thankachan, Bojian Xu. A Practical and Efficient Algorithm for the k-mismatch Shortest Unique Substring Finding Problem. In Amarda Shehu, Cathy H. Wu, Christina Boucher, Jing Li 0002, Hongfang Liu, Mihai Pop, editors, Proceedings of the 2018 ACM International Conference on Bioinformatics, Computational Biology, and Health Informatics, BCB 2018, Washington, DC, USA, August 29 - September 01, 2018. pages 428-437, ACM, 2018. [doi]
@inproceedings{AllenTX18,
title = {A Practical and Efficient Algorithm for the k-mismatch Shortest Unique Substring Finding Problem},
author = {Daniel R. Allen and Sharma V. Thankachan and Bojian Xu},
year = {2018},
doi = {10.1145/3233547.3233564},
url = {https://doi.org/10.1145/3233547.3233564},
researchr = {https://researchr.org/publication/AllenTX18},
cites = {0},
citedby = {0},
pages = {428-437},
booktitle = {Proceedings of the 2018 ACM International Conference on Bioinformatics, Computational Biology, and Health Informatics, BCB 2018, Washington, DC, USA, August 29 - September 01, 2018},
editor = {Amarda Shehu and Cathy H. Wu and Christina Boucher and Jing Li 0002 and Hongfang Liu and Mihai Pop},
publisher = {ACM},
}