New algorithms for fixed-length approximate string matching and approximate circular string matching under the Hamming distance
Crossref DOI link: https://doi.org/10.1007/s11227-017-2192-6
Published Online: 2017-11-20
Published Print: 2018-05
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Ho, ThienLuan
Oh, Seung-Rohk
Kim, HyunJin https://orcid.org/0000-0001-5017-3995
Funding for this research was provided by:
National Research Foundation of Korea (2017R1D1A1B03030348)
License valid from 2017-11-20