作者: Rohit Kamal Saxena , Kamlendra Pratap Singh , U. C. Jaiswal
DOI: 10.1007/978-3-642-19542-6_109
关键词:
摘要: With ever increasing digital data in form of files, there is a need efficient text searching algorithms with their applications. This paper describes an algorithm for any sentence the given pool files. The efficiency depends on fact about sentences language that, can be no such condition where may part some similar (as case patterns). Keeping this property languages mind, we are presenting linear order search preprocessing time.