78 search results - page 6 / 16 » On The Closest String and Substring Problems |
MST
2006
13 years 7 months ago
2006
A central question in computational biology is the design of genetic markers to distinguish between two given sets of (DNA) sequences. This question is formalized as the NP-comple...
FCT
2003
Springer
14 years 23 days ago
2003
Springer
Abstract. The NP-complete Distinguishing Substring Selection problem (DSSS for short) asks, given a set of “good” strings and a set of “bad” strings, for a solution string ...
IPPS
2003
IEEE
14 years 25 days ago
2003
IEEE
Given two strings and of lengths Ñ and Ò, respectively, the all-substrings longest common subsequence (ALCS) problem obtains the lengths of the subsequences common to and any su...
DSD
2005
IEEE
14 years 1 months ago
2005
IEEE
An implementation of an algorithm for string matching, commonly used in DNA string analysis, using configurable technology is proposed. The design of the circuit allows for pipeli...
ISCAS
2006
IEEE
14 years 1 months ago
2006
IEEE
— A new technique that makes use of a systolic array structure is proposed for solving the common approximate substring (CAS) problem. This approach extends the technique introdu...