Author： Evans P.A. Smith A.D. Wareham H.T.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.306, Iss.1, 2003-09, pp. : 407-430
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
Non-overlapping Common Substrings Allowing Mutations
By Chan H.
Mathematics in Computer Science, Vol. 1, Iss. 4, 2008-06 ,pp. :
Access to resources
Recommend
Finding approximate repetitions under Hamming distance
Theoretical Computer Science, Vol. 303, Iss. 1, 2003-06 ,pp. :
On finding common neighborhoods in massive graphs
By Buchsbaum A.L. Giancarlo R. Westbrook J.R.
Theoretical Computer Science, Vol. 299, Iss. 1, 2003-04 ,pp. :
Parameterized complexity of finding subgraphs with hereditary properties
Theoretical Computer Science, Vol. 289, Iss. 2, 2002-10 ,pp. :