Burrows-Wheeler変æ›ã®ç·šå½¢æ™‚間アルゴリズム- DO++ç ”ç©¶ç´¹ä»‹ã§ã™ã€‚今å¤ã®SPIRE 2009ã¨ã„ã†å¦ä¼šã§ "A Linear-Time Burrows-Wheeler Transform using Induced Sorting", D. Okanohara, K. Sadakane, SPIRE 2009 pdf(draft) ã¨ã„ã†ã®ã‚’発表ã—ã¾ã™ã€‚ã“ã‚Œã¯ä¸Žãˆã‚‰ã‚ŒãŸæ–‡å—列ã«å¯¾ã—接尾辞é…列を経ãªã„ã§Burrows-Wheeler変æ›ã‚’直接行ã†ã¨ã„ã†ã‚‚ã®ã§ã€ã‚¢ãƒ«ãƒ•ã‚¡ãƒ™ãƒƒãƒˆã‚µã‚¤ã‚ºã«ã‚ˆã‚‰ãšå…¥åŠ›é•·ã«å¯¾ã—ã¦ç·šå½¢æ™‚é–“ã§è¡Œãˆã¾ã™ã€‚基本的ãªã‚¢ã‚¤ãƒ‡ã‚£ã‚¢ã¯æ˜¨å¹´ã®Induced Sortingã«ã‚ˆã‚‹æŽ¥å°¾è¾žé…列ã®ç·šå½¢æ™‚間構築アルゴリズム（ã„ã‚ゆるSAIS）を接尾辞é…列を使ã‚ãªã„ã§ã‚·ãƒŸãƒ¥ãƒ¬ãƒ¼ãƒˆã™ã‚‹ã‚‚ã®ã§ã™ã€‚pushã¨popæ“作ã ã‘ã‹ã‚‰ãªã‚Šã€ãã®ã¾ã¾å¤–部記憶上ã§ã®æ§‹ç¯‰ã¨ã‹ã«ã‚‚対応ã§ãるよã†ã«ãªã£ã¦ã„ã¾ã™ã€‚ Burrows-Wheeler変æ›ï¼ˆBWT, Block S
{{#tags}}- {{label}}
{{/tags}}