Summary: We resolve two open problems presented in [{\\\\it P. A. Pevzner} and {\\\\it M. S. Waterman}, in Third Israel Symposium on the Theory of Computing and Systems (Tel Aviv, 1995), 158‒173, IEEE Comput.
We consider the problem of indexing a given text T[0...n−1] of n characters over an alphabet set Σ of size σ, in order to answer the position-restricted substring searching queries. The query input consists of a pattern P (of length p) and two indices ℓ and r and the output...
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 this way, we exhibit a sharp border between fixed-parameter tractability and intractability results.Jens GrammJiong GuoRolf NiedermeierFundamentals of Computation TheoryGramm J, Guo J, Niedermeier R: On Exact and Approximation Algorithms for Distinguishing Substring Selection. Proc. of 14th FCT 2003...
Complexity of Approximating Closest Substring Problems,” Fundamentals of Computation Theory - Evans, Smith - 2003 () Citation Context ...6]. A string satisfying the objective of CAS is often called a center string. CSSP and CSP are variants of CAS are discussed briefly about their role in ...
We discuss applications for the problem that arise in the context of computational biology and formal language theory. We then proceed to show several hardness of approximation results for the problem, and in the main part of the paper, we focus on devising approximation algorithms using two ...
In Proceedings of the International Symposium on Fundamentals of Computation Theory (FCT), pages 261-272, 2003. 23J. Gramm, J. Guo, and R. Niedermeier. On exact and approximation algorithms for distinguishing substring selection. Lecture Notes in Computer Science 2751: 195-209, 2003....
Complexity of Approximating Closest Substring Problems,” Fundamentals of Computation Theory - Evans, Smith - 2003 () Citation Context ...6]. A string satisfying the objective of CAS is often called a center string. CSSP and CSP are variants of CAS are discussed briefly about their role in ...
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...
bioinformatics/ C4280 Biocomputing theory C1180 Optimisation techniquesThe paper describes an algorithm for computing longest common substrings of two strings α 1 and α 2 with one mismatch in O (| α 1 || α 2 |) time and O (| α 1 |) additional space. The algorithm always scans ...