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.
2018
2018
Title Tumor-infiltrating DCs suppress nucleic acid-mediated innate immune responses through interactions between the receptor TIM… 
2015
2015
Dijkstra’s algorithm solves the single-source shortest path problem on any directed graph in O(m+nlogn) worst-case time when a… 
2014
2014
The string matching algorithms have broad applications in many areas of computer sciences. These areas include operating systems… 
2013
2013
In Karatzas and Kardaras's paper on semimartingale financial models, it is proved that the NUPBR condition is a property of the… 
2006
2006
In general, the teaching by showing or offline programming is used for path planning and motion programming for the manipulators… 
2002
2002
In this paper we present experimental results for string matching algorithms which have a competitive theoretical worst case run… 
2002
2002
To address the question of whether or not tumor necrosis factor-α (TNF-α) regulates the functions of vascular smooth muscle cells… 
2001
2001
Hironori Sahara Japan Science and Technology Corporation (JST) 7-44-1, Jindaiji-Higashi-Machi, Chofu, Tokyo, 182-8522, Japan Tel… 
1996
1996
We discussed the branching and joining of the Tsushima Current around the Oki Islands, based on ADCP and CTD measurements carried… 
1983
1983
If the concept of a depleted/undepleted mantle system is valid, rare gas isotopic composition and abundances should be different…