以åããæ°ã«ãªã£ã¦ããæ¸ç±ãThe Burrows-Wheeler Transform Data Compression, Suffix Arrays, and Pattern matchingããèªãæ©ä¼ãå¾ããã¨ãã§ããããããªãã«é«é¡ãªæ¬ã ã£ãã®ã§è³¼å
¥ãèºèºã£ã¦ããã®ã ãã©ãããã¯èªåç¨ã«è³¼å
¥ãã¦ããããããã¨ãããããã®è¯æ¸ã ã£ãã®ã§ç´¹ä»ãã¦ããã æ¬æ¸ã¯ã¿ã¤ãã«ã®ã¨ããBWT(Burrows-Wheelerå¤æ)ã«é¢ããæ¸ç±ããµãã¿ã¤ãã«ã«ããããã«ãã¼ã¿å§ç¸®ãSuffixArrayã«ããå
¨ææ¤ç´¢ã«ã¤ãã¦ãå
å®ããå
容ã«ãªã£ã¦ãããæå¾ã®Pattern matchingã¯ããã¹ãããæ¤ç´¢ãã¼ã¨exactã«ãããããããããã¯é¡ä¼¼ããç®æãåãåºãããã¨ãã話ã2008å¹´ã®æ¬ãªã®ã§æ¯è¼çæ°ãã話é¡ãæ±ã£ã¦ãã¦æºè¶³åº¦ãé«ãã ã¾ãæ¬æ¸ã®ç¹è²ã¯å§ç¸®ãããã§å§ã¾ããããããå
¨ææ¤ç´¢å¯è½ãª
{{#tags}}- {{label}}
{{/tags}}