Back to Results
First PageMeta Content
Combinatorics / Dynamic programming / Suffix tree / Formal languages / Aho–Corasick string matching algorithm / String searching algorithm / Longest common substring problem / Substring / Knuth–Morris–Pratt algorithm / String / Mathematics / String matching algorithms


Algorithms on Strings, Trees, and Sequences Dan Gusfield University of California, Davis Cambridge University Press 1997
Add to Reading List

Document Date: 2014-01-10 10:35:51

Open Document

File Size: 108,44 KB

Share Result on Facebook

Company

Davis Cambridge University Press / /

Country

United States / /

Currency

USD / /

Event

Product Issues / /

Facility

Sequences Dan Gusfield University of California / /

IndustryTerm

search times / space efficient algorithm / straightforward algorithm / typical applications / less search time / earlier algorithms / linear-time solutions / constant-tine lowest common ancestor algorithm / naive algorithm / lockup algorithm / linear-time algorithms / search result / linear-time algorithm / linear-time solution / suffix tree algorithms / attractive solution / foyerMoore algorithms / search time / space efficient solution / classic applications / search stage / /

Organization

Cambridge University / University of California / Davis / Strings / Trees / and Sequences Dan Gusfield University / /

Person

Don Knuth / S. Blair Hedges / S. As / /

Product

clone libraries / /

ProvinceOrState

California / /

Technology

lockup algorithm / earlier algorithms / matching algorithm / linear-time algorithms / discussing suffix tree algorithms / Moore algorithms / DNA sequencing / ancestor algorithm / straightforward algorithm / naive algorithm / cloning / foyerMoore algorithms / Aho-Corasick algorithm / linear-time algorithm / /

SocialTag