String Searching With Suffix Trees
Edit Page
Report
Scan day: 02 February 2014 UTC
-725
Virus safety - good
Description: Fast String Searching With Suffix Trees by Mark Nelson
Fast String Searching With Suffix Trees Poems are made by fools like me, A tree's a tree. How many more do you need to look at? Matching string sequences is a problem that computer programmers face on a regular basis. Some programming tasks, such as data compression or DNA sequencing, can benefit enormously from improvements in string matching algorithms. This article discusses a relatively unknown data structure, the
Size: 426 chars
Contact Information
Email: —
Phone&Fax: —
Address: —
Extended: —
WEBSITE Info
| Page title: | Fast String Searching With Suffix Trees |
| Keywords: | computer science,data compression,magazine articles |
| Description: | Suffix trees provide the extraordinary ability to search through an unlimited amount of text for a given string of length N in O(N) time. This article describes the structure of a suffix tree and provides C++ source for a simple suffix tree generation algorithm. |
| IP-address: | 208.113.168.213 |
WHOIS Info
| NS | Name Server: NS1.DREAMHOST.COM Name Server: NS2.DREAMHOST.COM Name Server: NS3.DREAMHOST.COM |
| WHOIS | Status: clientDeleteProhibited Status: clientRenewProhibited Status: clientTransferProhibited Status: clientUpdateProhibited |
| Date | Created by Registrar: ENOM, INC. Last Updated by Registrar: WILD WEST DOMAINS, INC. Last Transferred Date: Fri Apr 20 16:06:37 GMT 2012 Last Updated Date: Fri Apr 20 16:07:39 GMT 2012 Expiration Date: Thu Apr 23 23:59:59 GMT 2015 |