Zhu–Takaoka string matching algorithm

Known as: Takaoka, Zhu-Takaoka, Zhu-Takaoka string matching algorithm 
In computer science, the Zhu–Takaoka string matching algorithm is a variant of the Boyer–Moore string search algorithm. It uses two consecutive text… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1983-2016
024619832016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
The string matching algorithms have broad applications in many areas of computer sciences. These areas include operating systems… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2012
2012
Human dentin autograft was reported in 2003 as a first clinical case (Murata et al., 2003), while human bone autograft was done… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2011
2011
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)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2008
2008
We improve the all pairs shortest path algorithm given by Takaoka to time complexity O(n3/ log n). Our improvement is achieved by… (More)
Is this relevant?
Highly Cited
2005
Highly Cited
2005
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)
Is this relevant?
2005
2005
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)
  • figure 1
  • figure 2
Is this relevant?
2005
2005
Using the theory of almost conserved energies and the “I-method” developed by Colliander, Keel, Staffilani, Takaoka and Tao, we… (More)
Is this relevant?
2004
2004
Nontransportable blockers of the glutamate transporters are important tools for investigating mechanisms of synaptic transmission… (More)
  • figure 1
  • table 1
  • table 2
  • figure 2
  • figure 3
Is this relevant?
2002
2002
In this paper we present experimental results for string matching algorithms which have a competitive theoretical worst case run… (More)
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Is this relevant?
2001
2001
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)
  • figure 4.5
  • figure 4.6
  • figure 4.12
  • figure 5.1
  • figure 6.5
Is this relevant?