Apostolico–Giancarlo algorithm
Results: 4
# | Item |
---|---|
1![]() | An efficient matching algorithm for encoded DNA sequences and binary strings Simone Faro and Thierry Lecroq , Dipartimento di Matematica e Informatica, Universit`Add to Reading ListSource URL: www.cs.ucr.eduLanguage: English - Date: 2009-06-22 03:13:48 |
2![]() | Constant-‐Time Word-‐Size String-‐Matching D. Breslauer, L. Gasienec, R. Grossi Main points • New approach to Packed String MatchAdd to Reading ListSource URL: www.cs.ucr.eduLanguage: English - Date: 2012-12-29 15:14:08 |
3![]() | Two-Way MAXIME String-MatchingAdd to Reading ListSource URL: www-igm.univ-mlv.frLanguage: English - Date: 2011-02-26 08:45:11 |
4![]() | 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 CrAdd to Reading ListSource URL: www-igm.univ-mlv.frLanguage: English - Date: 2015-02-22 14:52:57 |