PatternMatching

Projet de M1 à la FAC de Nantes. Implémentation d'algorithmes de pattern matching pour le Langages et Automates

Collaborateurs

• Grégoire JADI - gregoire.jadi@etu.univ-nantes.fr
• Noémi SALAÜN - noemi.salaun@etu.univ-nantes.fr

Répartition des algorithmes

1. [Noémi] - FJS - BUG
2. [ ] - TVSBS
3. [Noémi] - SA - DONE
4. [ ] - SBNDM-BMH/BMH-SBNDM
5. [Grégoire] - EBOM
6. [ ] - AOSO
7. [Grégoire] - FSBNDM
8. [ ] - HASHq
9. [ ] - SBNDMq
10. [ ] - LBNDM
11. [X] - SSEF

Liste des documents

• FJS :

  • Franek-Jennings-Smyth
  • File FJS07.pdf
  • 2007
  • Works well on very short patterns and large and very large alphabets (characters comparison)

• SA :

  • Shift-And
  • File BYR92.pdf
  • 1992
  • Works well on very short patterns and very small alphabets (bit-parallelism)

• FSBNDM :

  • Forward SBNDM
  • File FL08.pdf
  • 2009
  • Works well on long patterns and large and very large alphabets (bit-parallelism)

• SSEF :

  • SSEF
  • File Kul08.pdf
  • 2009
  • Works well on very long patterns (characters comparison)

• EBOM :

  • Extended Backward Orcale Matching
  • File FL08.pdf
  • 2009
  • Short patterns and large and very large alphabets (automata)