æååæ¢ç´¢ã¹ã¿ã¼ã¿ã¼ããã
æè¿éç¹çã«åå¼·ãã¦ããã®ã§ï¼ããã¾ã§éããæç§æ¸æ
å ±ï¼è³æçã¸ã®ãªã³ã¯ãã¾ã¨ãã¦ã¿ãï¼ç´¹ä»ãã¦ããæç§æ¸ã¯ã»ã¨ãã©èªãã§ããªãã®ã§å¦è¨æ³¨æï¼
ãã®ä»ã«ãè¦ãæç§æ¸ï¼åå¼·æ³ãããã°ãã²æãã¦ãã ããï¼
æååæ¢ç´¢ã¯æ¤ç´¢å¯¾è±¡ããã¹ãã®ä¸ãã転置ã¤ã³ãã¯ã¹ã®ãããªå¤é¨ãã¼ã¿æ§é ãå©ç¨ããã«ç®çã®æååãæ¢ç´¢ãã課é¡ã§ãï¼æååæ¢ç´¢ï¼æååç
§åï¼ãã¿ã¼ã³ããããªã©ã¨ãå¼ã°ãã¦ãã¾ãï¼ä¸çªãªã¼ã½ããã¯ã¹ãªå¼ã³æ¹ã¯ãªãã§ãããï¼ï¼
æç§æ¸
åæ¸ã§æååæ¢ç´¢ã ããåãæ±ã£ã¦ããæ¬ãè¦ããããã¨ããªãï¼ã¢ã«ã´ãªãºã æ¬ã®æ¢ç´¢ã®ç« ã«KMPæ³ï¼BMæ³ãç´¹ä»ããã¦ããã ãã®ã±ã¼ã¹ãå¤ãï¼æ³¨æãã¦ã¿ãã¨ACæ³ãæ±ã£ã¦ããæ¬ãæå¤ã¨å°ãªããã¨ã«æ°ãã¤ãï¼ï¼ï¼
ï¼æååæ¢ç´¢ã§ããåæ¸ã®æ å ±åéä¸ï¼
- è¿½è¨ (2009-04-02) Thanks to cubicdaiyaãã!
- æ å ±æ¤ç´¢ã¢ã«ã´ãªãºã ã«KMPæ³, BMæ³, ACæ³ã®è§£èª¬æ
- Cã§å¦ã¶ãã¼ã¿æ§é ã¨ã¢ã«ã´ãªãºã ã«KMPæ³, BMæ³, ACæ³ã®è§£èª¬æ
Flexible Pattern Matching in Strings (2002)
- ä½è : Gonzalo Navarro
- åºç社/ã¡ã¼ã«ã¼: Cambridge University Press
- çºå£²æ¥: 2008/08/21
- ã¡ãã£ã¢: ãã¼ãã¼ããã¯
- è³¼å ¥: 5人 ã¯ãªãã¯: 26å
- ãã®ååãå«ãããã° (5件) ãè¦ã
- é»è²æ¬ï¼æååæ¢ç´¢ã§ã¯å®çªã®æç§æ¸ãããï¼IRå天çãã¨Navarroèï¼ãã£ããã¨ãã解説ãªã®ã§ï¼åãã¦èªãã®ã«ä¸åº¦ããï¼
- æååæ¢ç´¢ã§ã¯ï¼æå種ï¼ã¢ã«ãã¡ãããã®ç¨®é¡æ°ï¼Î£ã¨æ¢ç´¢ããããã¿ã¼ã³é·ã«ãã£ã¦æå¹ææ³ãç°ãªã£ã¦ããï¼æ¬æ¸ã®åç« æ«ã«æå¹ææ³ã®é©ç¨ç¯å²ã®å³ãããã®ãæé£ãï¼
Algorithms on Strings (2007)
- ä½è : Maxime Crochemore,Christophe Hancart,Thierry Lecroq
- åºç社/ã¡ã¼ã«ã¼: Cambridge University Press
- çºå£²æ¥: 2007/04/09
- ã¡ãã£ã¢: ãã¼ãã«ãã¼
- ã¯ãªãã¯: 1å
- ãã®ååãå«ãããã° (1件) ãè¦ã
- ãã®åéã§ã¯ä¸çªæ°ããï¼ã¨æãããï¼æç§æ¸çæç®ï¼ããã£ã¨çºããæãã§ã¯ï¼ããå ãå°è±¡ï¼ç¶²ç¾ çï¼
Algorithms on Strings, Trees and Sequences (1997)
Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology
- ä½è : Dan Gusfield
- åºç社/ã¡ã¼ã«ã¼: Cambridge University Press
- çºå£²æ¥: 1997/01/15
- ã¡ãã£ã¢: ãã¼ãã«ãã¼
- ã¯ãªãã¯: 21å
- ãã®ååãå«ãããã° (5件) ãè¦ã
- ã¬ã¹ãã£ã¼ã«ãæ¬ï¼è¶ æåï¼ãããï¼ï¼ããå¤ãã®ãé£ç¹ï¼
Jewels of Stringology (2002)
- ä½è : Maxime Crochemore,Wojciech Rytter
- åºç社/ã¡ã¼ã«ã¼: World Scientific Pub Co Inc
- çºå£²æ¥: 2002/11
- ã¡ãã£ã¢: ãã¼ãã«ãã¼
- ã¯ãªãã¯: 1å
- ãã®ååãå«ãããã° (1件) ãè¦ã
- ãã¡ããæåï¼ãããï¼ï¼ã©ããã§èãã話ã«ããã¨ç¾å¨çµ¶çã®Text Algorithmsã®ç¼ãç´ãã§ï¼æ§æãããã£ã¦ãããã¥ãããªã£ã¦ããã¨ã®ãã¨ï¼
- è¿½è¨ (2009-04-02) Thanks to usa9ãã!
- Text Algorithmã¯ç¾å¨å稿ãã¦ã§ãå ¬éããã¦ãã¾ãï¼ http://web.njit.edu/~rytter/TEACHING/TEXTS/book.html
è³æç
- Pattern Matching Pointers
- æååæ¢ç´¢ã«é¢ããç¥ãªã³ã¯éï¼å¦ä¼ãæç§æ¸ï¼è³æãªã©ã®è¶ ç¶²ç¾ çãªãªã³ã¯
- EXACT STRING MATCHING ALGORITHMS
- å種ã¢ã«ã´ãªãºã ã®è§£èª¬ï¼Cãµã³ãã«ã³ã¼ãã¨ï¼Javaã«ããã¢ã«ã´ãªãºã ã®åä½ç¢ºèªãã§ããï¼Javaã®ãããï¼ãã©ã¦ã¶ãè½ã¡ãå¯è½æ§ãããã®ã§æ³¨æï¼
- 配列解析アルゴリズム特論I
- æ±å¤§æ¸è°·å çã®è¬ç¾©è³æï¼ç¥ï¼æåã®è¬ç¾©è³æã«ã¾ã¨ãæ å ±ããï¼
- 情報知識ネットワーク特論(平成19年度)
- åç°å çã«ããããã¿ã¼ã³ç §åã¢ã«ã´ãªãºã ãã®è³æãç¥ããã£ã¦ããï¼Navarroã®é»è²æ¬ã®ç´ æ´ãããè¦ç´ã«ãªã£ã¦ããï¼
- Algorithms with Python 文字列の探索 (string searching)
- M.Hiroiããã®ãã¼ã¸ï¼Horspool algorithmã¨Sunday algorithmã解説ããã¦ããï¼
- 検索アルゴリズム(3)文字列の検索-1-
- 検索アルゴリズム(4)文字列の検索-2-
- Fussyããã®ãã¼ã¸ï¼Naiveæ³ï¼KMPæ³ï¼BMæ³ã解説ï¼æå¾ã«å¤ãã¤ãæååã«å¯¾ãã解説ãã
Wikipediaã«ãããªãä¸å¯§ãªè§£èª¬ãããï¼ä»£è¡¨çãªãã®ã°
ä»ã¯å種ã¢ã«ã´ãªãºã ããã¤ãã¤ã¨ææ¡ä¸ï¼ææ°ã®è©±é¡ã«ã¤ãã¦ããããããã«ã¯ãªãããã§ãï¼
ã©ãã§ããã話ã§ããï¼ACæ³ã®Aho-Corasickã¯ã¨ã¤ãã»ã³ã©ã·ãã¯ã¨è¨³ããããã¨ãå¤ãããã©ï¼ã©ã¡ããã¨ããã°ã¨ã¤ãã»ã³ã¬ã¤ã·ãã¯ãæ£ããçºé³ãªã®ã§ã¯ãªãã§ããããï¼
ããã³ã©ã·ãã¯ã¨æ¸ãã®ã§ããã°ï¼ã¨ã¤ããã¢ãã¨è¨³ãã¹ããªã®ã§ã¯ãªãã§ãããã:p
ï¼æ£ããçºé³ããåç¥ã®æ¹ãããã°æãã¦ãã ããï¼ï¼