Zhu–Takaoka string matching algorithm
Semantic Scholar uses AI to extract papers important to this topic.
The string matching algorithms have broad applications in many areas of computer sciences. These areas include operating systems… (More)
Human dentin autograft was reported in 2003 as a first clinical case (Murata et al., 2003), while human bone autograft was done… (More)
A 5 mm thick periodically poled bulk Rb-doped KTiOPO4 (KTP) crystal with a period of 38.86 μm was fabricated by electric field… (More)
We improve the all pairs shortest path algorithm given by Takaoka to time complexity O(n3/ log n). Our improvement is achieved by… (More)
We describe an O(n 3/log n)-time algorithm for the all-pairs-shortest-paths problem for a real-weighted directed graph with n… (More)
Given a sequence of n real numbers and an integer k, 1 k 1 2n(n − 1), the k maximum-sum segments problem is to locate the k… (More)
Using the theory of almost conserved energies and the “I-method” developed by Colliander, Keel, Staffilani, Takaoka and Tao, we… (More)
Nontransportable blockers of the glutamate transporters are important tools for investigating mechanisms of synaptic transmission… (More)
In this paper we present experimental results for string matching algorithms which have a competitive theoretical worst case run… (More)
- Electr. Notes Theor. Comput. Sci.
Dijkstra’s algorithm solves the single-source shortest path problem on any directed graph in O(m + n log n) worst-case time when… (More)