Author： Allauzen C. Raffinot M.
Publisher： Academic Press
ISSN： 0196-6774
Source： Journal of Algorithms, Vol.36, Iss.1, 2000-07, pp. : 102-116
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
A NEW STRING MATCHING ALGORITHM
By AHMED M.
International Journal of Computer Mathematics, Vol. 80, Iss. 7, 2003-07 ,pp. :
Access to resources
Recommend
String matching in O(n+m) quantum time
Journal of Discrete Algorithms, Vol. 1, Iss. 1, 2003-02 ,pp. :
On the Comparison Complexity of the String Prefix-Matching Problem
By Breslauer D. Colussi L. Toniolo L.
Journal of Algorithms, Vol. 29, Iss. 1, 1998-10 ,pp. :
Efficient Algorithms for Approximate String Matching with Swaps
By Kim D.K. Lee J-S. Park K. Cho Y.
Journal of Complexity, Vol. 15, Iss. 1, 1999-03 ,pp. :