skip to main | skip to sidebar

greeness notes

Sunday, November 02, 2008

String Searching

http://allisons.org/ll/AlgDS/Strings/

http://en.wikipedia.org/wiki/String_searching_algorithm

http://en.wikipedia.org/wiki/Boyer-Moore_string_search_algorithm

Posted by greeness at 3:31 PM
Labels: search, string
Newer Post Older Post Home

Labels

  • dp (14)
  • bit operation (12)
  • c++ (12)
  • graph (12)
  • search (8)
  • design patterns (4)
  • math (4)
  • recursion (4)
  • string (4)
  • linux programming (3)
  • backtracking (1)
  • data structure (1)
  • disjoint set (1)
  • divide and conquer (1)
  • jobhunting (1)
  • linear algebra (1)
  • matrix (1)
  • sweeping (1)

Blog Archive

  • ►  2009 (6)
    • ►  12 (1)
      • another dp
    • ►  11 (4)
      • bitset and memoization
      • sscanf
      • STL comparison FUNCTOR
      • Coin toss and Absorbing Markov Chain
    • ►  02 (1)
      • protected data or private data
  • ▼  2008 (56)
    • ▼  11 (9)
      • Repeated Squaring
      • quadtree
      • Add without +
      • C++ notes II
      • 3Sum problem
      • Maximun Flow
      • Hungarian Method
      • String Searching
      • Suffix Tree
    • ►  10 (25)
      • google c++ coding style
      • random programs
      • counting sort + bit operation
      • Maximum interval sum
      • initialize upon the first use
      • bit operation again SRM 422
      • closest pair problem
      • Bit operations hacks
      • Design Patterns (4) - Factory method and Abstract ...
      • Design Patterns (3) - Decorator
      • Design Patterns (2) - Observer
      • Design Patterns (1) - Strategy
      • interprocess communication IPC (2) - shared memory...
      • interprocess communication IPC (1) - message queue...
      • C++ notes
      • numeric_limits
      • C++ FAQ Lite
      • POSIX Thread
      • RPN and evaluation tree
      • Tree Recovery
      • Skill keywords in IT job-seeking website
      • gcd, binomial number
      • Prime Numbers
      • Flickr Photostream
      • Trie
    • ►  09 (22)
      • MST (minimum spanning tree)
      • Union Find
      • bit operation
      • BFS
      • DFS
      • Dijkstra: single source shortest path
      • Flood Fill
      • C++ Effective notes
      • Number Split
      • Floyd-Warshall: All-Pairs Shortest Path
  • ►  2005 (33)
    • ►  06 (3)
    • ►  05 (1)
    • ►  04 (2)
    • ►  03 (6)
    • ►  02 (12)
    • ►  01 (9)