multiple-string search
1Rabin-Karp string search algorithm — The Rabin Karp algorithm is a string searching algorithm created by Michael O. Rabin and Richard M. Karp in 1987 that uses hashing to find a substring in a text. It is used for multiple pattern matching rather than single pattern matching. For… …
2Boyer–Moore string search algorithm — The Boyer–Moore string search algorithm is a particularly efficient string searching algorithm, and it has been the standard benchmark for the practical string search literature. [Hume and Sunday (1991) [Fast String Searching] SOFTWARE PRACTICE… …
3String theory — This article is about the branch of theoretical physics. For other uses, see String theory (disambiguation). String theory …
4Search problem — In computability theory, a search problem is a type of computational problem represented by a binary relation. If R is a binary relation such that field( R ) sube; Gamma;+ and T is a Turing machine, then T calculates f if:* If x is such that… …
5Database search engine — There are several categories of search engine software: Web search or full text search (example: Lucene), database or structured data search (example: Dieselpoint), and mixed or enterprise search (example: Google Search Appliance). The largest… …
6Internet Explorer — Windows Internet Explorer A component of Microsoft Windows Internet Explorer 9 in Wi …
7List of terms relating to algorithms and data structures — The [http://www.nist.gov/dads/ NIST Dictionary of Algorithms and Data Structures] is a reference work maintained by the U.S. National Institute of Standards and Technology. It defines a large number of terms relating to algorithms and data… …
8Список терминов, относящихся к алгоритмам и структурам данных —   Это служебный список статей, созданный для координации работ по развитию темы.   Данное предупреждение не устанавливается на информационные списки и глоссарии …
9Список терминов — Список терминов, относящихся к алгоритмам и структурам данных   Это сл …
10Algorithmic efficiency — In computer science, efficiency is used to describe properties of an algorithm relating to how much of various types of resources it consumes. Algorithmic efficiency can be thought of as analogous to engineering productivity for a repeating or… …
