Author: Kolpakov R. Kucherov G.
Publisher: Elsevier
ISSN: 0304-3975
Source: Theoretical Computer Science, Vol.303, Iss.1, 2003-06, pp. : 135-156
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
On the Hamming distance of constraint satisfaction problems
Theoretical Computer Science, Vol. 288, Iss. 1, 2002-10 ,pp. :
Approximate maxima finding of continuous functions under restricted budget
By Kranakis E. Krizanc D. Pelc A. Peleg D.
Theoretical Computer Science, Vol. 203, Iss. 1, 1998-08 ,pp. :
On the complexity of finding common approximate substrings
By Evans P.A. Smith A.D. Wareham H.T.
Theoretical Computer Science, Vol. 306, Iss. 1, 2003-09 ,pp. :