Author： Lemstrom K. Hella L.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.299, Iss.1, 2003-04, pp. : 387-412
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
Improved approximate pattern matching on hypertext
By Navarro G.
Theoretical Computer Science, Vol. 237, Iss. 1, 2000-04 ,pp. :
Access to resources
Recommend
Analysis of two-dimensional approximate pattern matching algorithms
By Park K.
Theoretical Computer Science, Vol. 201, Iss. 1, 1998-07 ,pp. :
The dynamic complexity of transitive closure is in DynTC 0
By Hesse W.
Theoretical Computer Science, Vol. 296, Iss. 3, 2003-03 ,pp. :
Approximate string matching for music analysis
Soft Computing, Vol. 8, Iss. 9, 2004-09 ,pp. :