20

Information and Computation

Elsevier ,

2003

185

41–55

براي دانلود و مشاهده مقاله به قسمت لينكهاي مرتبط مراجعه نماييد

This paper presents a collection of string algorithms that are at the core of several biological problems such as discovering potential drug targets, creating diagnostic probes, universal primers or unbiased consensus sequences. All these problems reduce to the task of finding a pattern that, with some error, occurs in one set of strings (Closest Substring Problem) and does not occur in another set (Farthest String Problem). In this paper, we break down the problem into several subproblems and prove the following results.

http://www.sciencedirect.com/science/article/pii/S0890540103000579,/DL/Data Entry/DataEntryForm/EnterDocInfo.aspx,/DL/Data Entry/NewEdit/Documents/Math_English_Electronic_Articles_EditDoc_925.aspx