|
|
|
|
|
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
|
|
|
|
|
|
|
|
|
|
|
Paniz Abedin, M. Oguzhan Külekci and Shama V. Thankachan
The shortest unique substring (SUS) problem is an active line of research in the field of string algorithms and has several applications in bioinformatics and information retrieval. The initial version of the problem was proposed by Pei et al. [ICDE?13]....
ver más
|
|
|
|
|
|
|
|
|
|
|
Paniz Abedin, Arnab Ganguly, Solon P. Pissis and Sharma V. Thankachan
Let ??[1,??]
T
[
1
,
n
]
be a string of length n and ??[??,??]
T
[
i
,
j
]
be the substring of ??
T
starting at position i and ending at position j. A substring ??[??,??]
T
[
i
,
j
]
of ??
T
is a repeat if it occurs more than once in ??
T
; otherwis...
ver más
|
|
|
|
|
|