of strings. In this paper, we consider the algorithmic problem of computing the longest unbordered substring of a string. The problem was introduced recently by G. Kucherov et al. [CPM (2015)], where the authors showed that the average-case running time of the simple, border-array based ...
In Fundamentals of computation theory, volume 2751 of Lecture Notes in Comput. Sci., pages 195-209. Springer, Berlin, 2003.J. Gramm, J. Guo, and R. Niedermeier, On exact and approximation algorithms for distinguishing substring selection, Lecture Notes in Computer Science 2751 (FCT'2003), ...
parallel computationpattern matchingsystolic architecturesparallel algorithms/ C4240P Parallel programming and algorithm theory C1250 Pattern recognitionImproved linear and square systolic arrays are presented that support the detection of repetitions in a string and the substring statistics with and without ...
(2003) Complexity of approximating closest substring problems. Proc. 14th Int. Symp. Foundations of Computation Theory, pp. 210 -221.P.A. Evans, A.D. Smith, Complexity of approximating closest substring problems, in: Proceedings of the 14th International Symposium on Foundations of Complexity ...
(2003) Complexity of approximating closest substring problems. Proc. 14th Int. Symp. Foundations of Computation Theory, pp. 210 -221.P. A. Evans and A. D. Smith, Complexity of approximating closest substring problems. In FCT, (2003) 210-221...
We discuss applications for the problem that arise in the context of computational biology and formal language theory. We then proceed to show that this problem is at least as hard as the PBMinimum Set Cover problem. In the main part of the paper, we focus on devising approximation ...
We discuss applications for the problem that arise in the context of computational biology and formal language theory. We then proceed to show that this problem is at least as hard as the Minimum Set Cover problem. In the main part of the paper, we focus on devising approximation algorithms...
Since finding the shortest unique substrings is a non-trivial problem that has several applications for different purposes, variants of this problem have been studied. Table 1 shows the variants of the Shortest Unique Substring (𝖲𝖴𝖲) problem that we focused on in this survey. Table 1....
The time complexity of the new algorithm is O(nmr). Keywords: constrained LCS; string-excluding; dynamic programming 1. Introduction In this paper, we consider a generalized longest common subsequence problem. The longest common subsequence (LCS) problem is a well-known measurement for computing ...
In this work, we consider the problem of efficient substring position search over encrypted data. The users can query the remote untrusted server for a set of encrypted documents that contain a substring of characters. The cloud server retrieves the set of matching documents together with ...