Allen, Daniel R., Thankachan, Sharma V., and Xu, Bojian. A Practical and Efficient Algorithm for the k-mismatch Shortest Unique Substring Finding Problem. Retrieved from https://par.nsf.gov/biblio/10096931. Proceedings of the 2018 {ACM} International Conference on Bioinformatics, Computational Biology, and Health Informatics, {BCB} 2018, Washington, DC, USA, August 29 - September 01, 2018 . Web. doi:10.1145/3233547.3233564.

Allen, Daniel R., Thankachan, Sharma V., & Xu, Bojian. A Practical and Efficient Algorithm for the k-mismatch Shortest Unique Substring Finding Problem. Proceedings of the 2018 {ACM} International Conference on Bioinformatics, Computational Biology, and Health Informatics, {BCB} 2018, Washington, DC, USA, August 29 - September 01, 2018, (). Retrieved from https://par.nsf.gov/biblio/10096931. https://doi.org/10.1145/3233547.3233564

Allen, Daniel R., Thankachan, Sharma V., and Xu, Bojian. "A Practical and Efficient Algorithm for the k-mismatch Shortest Unique Substring Finding Problem". Proceedings of the 2018 {ACM} International Conference on Bioinformatics, Computational Biology, and Health Informatics, {BCB} 2018, Washington, DC, USA, August 29 - September 01, 2018 (). Country unknown/Code not available. https://doi.org/10.1145/3233547.3233564. https://par.nsf.gov/biblio/10096931.

@article{osti_10096931,
place = {Country unknown/Code not available}, title = {A Practical and Efficient Algorithm for the k-mismatch Shortest Unique Substring Finding Problem}, url = {https://par.nsf.gov/biblio/10096931}, DOI = {10.1145/3233547.3233564}, abstractNote = {}, journal = {Proceedings of the 2018 {ACM} International Conference on Bioinformatics, Computational Biology, and Health Informatics, {BCB} 2018, Washington, DC, USA, August 29 - September 01, 2018}, author = {Allen, Daniel R. and Thankachan, Sharma V. and Xu, Bojian}, }