Skip to content

Implementation of exact and approximate string matching algorithms

Notifications You must be signed in to change notification settings

gabritto/string

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

77 Commits
 
 
 
 
 
 
 
 

Repository files navigation

String matching

Implementation of string matching and compression algorithms.

PMT (Pattern Matching Tool) is a tool for exact and approximate pattern matching. It uses a combination of the following algorithms:

For exact matching:

  • Knuth-Morris-Pratt
  • Aho-Corasick
  • Boyer-Moore
  • Shift-Or

For approximate matching:

IPMT (Indexed Pattern Matching Tool) is a tool for exact pattern matching. It constructs the suffix array of an input text and compresses it using the LZ77 compression algorithm. Alternatively, it receives a compressed suffix array of a text and performs exact string matching on such text.

About

Implementation of exact and approximate string matching algorithms

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published