Back to Results
First PageMeta Content
Dynamic programming / String matching algorithms / Approximate string matching / Pattern matching / Information retrieval / Searching / String searching algorithm / Trie / Suffix array / Information science / Science / String


Document Date: 2008-08-14 13:16:20

Open Document

File Size: 239,33 KB

Share Result on Facebook

City

Zuerich / /

Company

Hermes Science Publishing / Prentice-Hall / ACM Comp / IEEE CS Press / Carleton University Press / /

Country

Switzerland / Finland / /

Currency

pence / /

Facility

University of Joensuu / Helsinki University of Technology / University of Chile / /

IndustryTerm

search method / well established solutions / on-line algorithms / e-environments / node processing / column-wise processing / sublinear algorithm / on-line version / e-neighborhoods / search approaches / classical on-line algorithm / on-line algorithm / dynamic programming algorithm / search approach / on-line string searches / signal processing / search time / basic algorithm / text processing / tree construction algorithm / /

Organization

Congress / University of Joensuu / University of Chile / Univ. of Arizona / Univ. of Joensuu / IEEE Computer Society Technical Committee on Data Engineering / Carleton University / Univ. of Chile / Helsinki University of Technology / /

Person

Ricardo Baeza-Yates Erkki / Ai / /

Product

Galil / /

ProvinceOrState

Arizona / /

PublishedMedium

Electronic Journal / /

Technology

on-line algorithms / time algorithm / on-line algorithm / classical on-line algorithm / ESA / dynamic programming algorithm / tree construction algorithm / sublinear algorithm / Two algorithms / /

URL

http /

SocialTag