|
|
|
|
|
Hideo Bannai, Travis Gagie, Gary Hoppenworth, Simon J. Puglisi and Luís M. S. Russo
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 SUS i...
ver más
|
|
|
|
|
|
|
|
|
|
|
Dominik Köppl
We present algorithms computing the non-overlapping Lempel?Ziv-77 factorization and the longest previous non-overlapping factor table within small space in linear or near-linear time with the help of modern suffix tree representations fitting into limite...
ver más
|
|
|
|
|
|
|
|
|
|
|
Dominik Köppl
We present linear-time algorithms computing the reversed Lempel?Ziv factorization [Kolpakov and Kucherov, TCS?09] within the space bounds of two different suffix tree representations. We can adapt these algorithms to compute the longest previous non-over...
ver más
|
|
|
|
|
|
|
|
|
|
|
Yufeng Yu, Dingsheng Wan, Qun Zhao and Huan Liu
Anomalous patterns are common phenomena in time series datasets. The presence of anomalous patterns in hydrological data may represent some anomalous hydrometeorological events that are significantly different from others and induce a bias in the decisio...
ver más
|
|
|
|
|
|
|
|
|
|
|
Nicola Prezza
Text indexing is a classical algorithmic problem that has been studied for over four decades: given a text T, pre-process it off-line so that, later, we can quickly count and locate the occurrences of any string (the query pattern) in T in time proportio...
ver más
|
|
|
|
|
|