Author： Kranakis E. Krizanc D. Pelc A. Peleg D.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.203, Iss.1, 1998-08, pp. : 151-162
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
Finding approximate repetitions under Hamming distance
Theoretical Computer Science, Vol. 303, Iss. 1, 2003-06 ,pp. :
Access to resources
Recommend
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. :
Approximate Solutions of Continuous Dispersion Problems
Annals of Operations Research, Vol. 136, Iss. 1, 2005-04 ,pp. :
Invariant continuous aggregation functions
International Journal of General Systems, Vol. 39, Iss. 2, 2010-02 ,pp. :
Approximate evaluations of characteristic polynomials of Boolean functions
Theoretical Computer Science, Vol. 262, Iss. 1, 2001-07 ,pp. :