Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Gary Hoppenworth"'
Publikováno v:
Algorithms, Vol 13, Iss 9, p 234 (2020)
We extend recent results regarding finding shortest unique substrings (SUSs) to obtain new time-space tradeoffs for this problem and the generalization of finding k-mismatch SUSs. Our new results include the first algorithm for finding a k-mismatch S
Externí odkaz:
https://doaj.org/article/e0686d81e7d24723b274bc96427e9cbf
