Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Three new species of the genus Pholcus collected from Liaodong Mountain, China, are diagnosed, described and illustrated: Pholcus… 
2018
2018
Title Tumor-infiltrating DCs suppress nucleic acid-mediated innate immune responses through interactions between the receptor TIM… 
Highly Cited
2015
Highly Cited
2015
Curriculum learning (CL) or self-paced learning (SPL) represents a recently proposed learning regime inspired by the learning… 
Highly Cited
2013
Highly Cited
2013
Shift-reduce dependency parsers give comparable accuracies to their chartbased counterparts, yet the best shiftreduce constituent… 
2011
2011
Human dentin autograft was reported in 2003 as a first clinical case (Murata et al., 2003), while human bone autograft was done… 
2006
2006
In general, the teaching by showing or offline programming is used for path planning and motion programming for the manipulators… 
2006
2006
We study the problem of computing the k maximum sum subsequences. Given a sequence of real numbers $\left\langle x_{1},x_{2… 
Highly Cited
2005
Highly Cited
2005
We describe an O(n3/log n)-time algorithm for the all-pairs-shortest-paths problem for a real-weighted directed graph with n… 
Highly Cited
2003
Highly Cited
2003
To find out the natural infection with filarial larvae, female adult black flies were collected on a human attractant in December… 
2002
2002
In this paper we present experimental results for string matching algorithms which have a competitive theoretical worst case run…