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… 
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… 
2012
2012
— Searching a pattern in biological sequence is as good as finding a genetic code in a sequence of DNA. As every day the new gene… 
2006
2006
In general, the teaching by showing or offline programming is used for path planning and motion programming for the manipulators… 
Review
2005
Review
2005
Tunneling and nonadiabatic transition are the most important quantum mechanical effects in chemical dynamics. They are important… 
2000
2000
A new polygonal approximation algorithm, employing the concept of genetic evolution, is presented. In the proposed method, a… 
1996
1996
We discussed the branching and joining of the Tsushima Current around the Oki Islands, based on ADCP and CTD measurements carried… 
Review
1995
Review
1995
We review how to solve the all-pairs shortest path problem in a non-negatively weighted digraph with n vertices in expected time… 
1983
1983
If the concept of a depleted/undepleted mantle system is valid, rare gas isotopic composition and abundances should be different…