CSTA K-12 Repository: Item 2378/373

	Home

Browse
	Communities & Collections
	Titles
	Authors
	By Date

Sign on to:
	My Account CSTA members
	Receive email updates
	Edit Profile



	About DSpace

CSTA K-12 Repository >
CSTA Source: K-12 Repository >
Level 3: Computer Science as Analysis and Design >
L3 A: Topics >
L3 A 07: Limits of computing >

Please use this identifier to cite or link to this item: http://hdl.handle.net/2378/373

Title:	Fast String Searching
Authors:	Moore, J Strother
Keywords:	string searching Boyer-Moore algorithm
Issue Date:	Jul-2008
Publisher:	U Texas-Austin
Abstract:	This presentation talks about the need for string searching within large volumes of text. The Boyer-Moore fast string searching algorithm is demonstrated with extensive examples. A sample pseudocode implementation is provided and discussed.
URI:	http://hdl.handle.net/2378/373
Appears in Collections:	L3 A 07: Limits of computing L4 A 04: Standard Data Structures [AP Topic Outline IV]

Files in This Item:

File	Description	Size	Format
J_Moore_fss-talk.pdf		404Kb	Adobe PDF	View/Open

All items in DSpace are protected by copyright, with all rights reserved.

DSpace Software Copyright © 2002-2006 MIT and Hewlett-Packard

or broken NS 4.x --%>