Two-Way MAXIME String-Matching

First Page		Document Content
Date: 2011-02-26 08:45:11 String matching algorithms Coding theory Algorithm Mathematical logic Theoretical computer science Group theory Approximate string matching Apostolico–Giancarlo algorithm Mathematics Abstract algebra Applied mathematics		Two-Way MAXIME String-Matching Add to Reading List Source URL: www-igm.univ-mlv.fr Download Document from Source Website File Size: 1,38 MB Share Document on Facebook

	An efficient matching algorithm for encoded DNA sequences and binary strings Simone Faro and Thierry Lecroq , Dipartimento di Matematica e Informatica, Universit` DocID: 15nUD - View Document
	Constant-‐Time Word-‐Size String-‐Matching D. Breslauer, L. Gasienec, R. Grossi Main points •  New approach to Packed String Match DocID: 15lSp - View Document
	Two-Way MAXIME String-Matching DocID: 11erw - View Document
	References [1] Alain Cardon and Maxime Crochemore. Minimisation d’automates et algorithme de Hopcroft. Rapport du laboratoire d’informatique 78-02, Université de Haute-Normandie, [removed]Alain Cardon and Maxime Cr DocID: 10w09 - View Document