A method for representing a search tree embodying a plurality of signatures to be searched for in an input string of characters constructs a failure tree in which the states are re-organized in levels according to the number of failure transitions between each state and the root node of the search tree.

 
Web www.patentalert.com

< Unsupervised, automated web host dynamicity detection, dead link detection and prerequisite page discovery for search indexed web pages

> Electronic business information system

> Rank-adjusted content items

~ 00554