Suffix Trees, data structures and algorithmsSuffix Trees Should automatically redirect to [here (click)] on a suitable browser.
横ç€ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚° 第6回: chatty: å°ã†ã‚‹ã•ã„端末
最終更新日: 2002-09-18 (公開日: 2002-09-18) Unix Magazine 誌㫠2002å¹´1月å·ã‹ã‚‰ 2003å¹´2月å·ã«ã‹ã‘ã¦é€£è¼‰ã— ã¦ã„ãŸè¨˜äº‹ã®å…ƒã®åŽŸç¨¿ã§ã™ã€‚ æ‰æ°—ã«å¯Œã‚“ã ã“ã¨ã¯å€‹äººãŒè¡Œã†ã®ãŒé€šä¾‹ã§ã‚ã‚Šã€ä¿¡ã˜ãŒãŸããƒã‚« ã•åŠ 減ã¯å¤§æŠµçµ„ç¹”ã«å¸°ã•ã‚Œã‚‹ã‚‚ã®ã§ã‚る。 -- Jon Bentley *1 å½¹ã«ç«‹ãŸãªã„ソフトウェアを作るã®ãŒå¥½ãã 。é¢å€’ãªä½œæ¥ã‚’楽ã«ã™ る横ç€ã‚½ãƒ•ãƒˆã‚¦ã‚§ã‚¢ã‚‚ã„ã„ãŒã€ãŸã¾ã«ã¯äººã‚’呆れã•ã›ã‚‹ãã らãªã„ ソフトウェアを作るã®ã‚‚楽ã—ã„。 以å‰ã«ç§ãŒé–‹ç™ºã—㟠cdbiff*2ã¨ã„ã†ã‚½ãƒ•ãƒˆ ウェアã¯ã€ãƒ¡ãƒ¼ãƒ«ãŒå±Šã㨠PC ã® CD-ROMドライブãŒé–‹ã„ã¦ãƒ¡ãƒ¼ãƒ« ã®åˆ°ç€ã‚’通知ã™ã‚‹ã¨ã„ã†å½¹ã«ç«‹ãŸãªã„ã‚‚ã®ã§ã‚ã£ãŸãŒã€ãã®ãã ら ãªã•ãŒå—ã‘ã¦äºˆæƒ³å¤–ã®å¥½è©•ã‚’å¾—ãŸã€‚今回ã¯ã€ãã†ã—ãŸå½¹ã«ç«‹ãŸãªã„ ソフトウェア㮠1ã¤ã§ã‚ã‚‹ã€å°ã†ã‚‹ã•ã„端末 chatty*3 を紹介ã™ã‚‹ã€‚
サービス終了ã®ãŠçŸ¥ã‚‰ã›
サービス終了ã®ãŠçŸ¥ã‚‰ã› ã„ã¤ã‚‚Yahoo! JAPANã®ã‚µãƒ¼ãƒ“スをã”利用ã„ãŸã ãèª ã«ã‚ã‚ŠãŒã¨ã†ã”ã–ã„ã¾ã™ã€‚ ãŠå®¢æ§˜ãŒã‚¢ã‚¯ã‚»ã‚¹ã•ã‚ŒãŸã‚µãƒ¼ãƒ“スã¯æœ¬æ—¥ã¾ã§ã«ã‚µãƒ¼ãƒ“スを終了ã„ãŸã—ã¾ã—ãŸã€‚ 今後ã¨ã‚‚Yahoo! JAPANã®ã‚µãƒ¼ãƒ“スをã”愛顧ãã ã•ã„ã¾ã™ã‚ˆã†ã€ã‚ˆã‚ã—ããŠé¡˜ã„ã„ãŸã—ã¾ã™ã€‚
PATRICIA
PATRICIA - Practical Algorithm to Retrieve Information Coded in Alphanumeric, D.R.Morrison (1968). A PATRICIA tree is related to a Trie. The problem with Tries is that when the set of keys is sparse, i.e. when the actual keys form a small subset of the set of potential keys, as is very often the case, many (most) of the internal nodes in the Trie have only one descendant. This causes the Trie to h
Tries
A trie (from retrieval), is a multi-way tree structure useful for storing strings over an alphabet. It has been used to store large dictionaries of English (say) words in spelling-checking programs and in natural-language "understanding" programs. Given the data: an, ant, all, allot, alloy, aloe, are, ate, be the corresponding trie would be: The idea is that all strings sharing a common stem or pr
サービス終了ã®ãŠçŸ¥ã‚‰ã›
サービス終了ã®ãŠçŸ¥ã‚‰ã› ã„ã¤ã‚‚Yahoo! JAPANã®ã‚µãƒ¼ãƒ“スをã”利用ã„ãŸã ãèª ã«ã‚ã‚ŠãŒã¨ã†ã”ã–ã„ã¾ã™ã€‚ ãŠå®¢æ§˜ãŒã‚¢ã‚¯ã‚»ã‚¹ã•ã‚ŒãŸã‚µãƒ¼ãƒ“スã¯æœ¬æ—¥ã¾ã§ã«ã‚µãƒ¼ãƒ“スを終了ã„ãŸã—ã¾ã—ãŸã€‚ 今後ã¨ã‚‚Yahoo! JAPANã®ã‚µãƒ¼ãƒ“スをã”愛顧ãã ã•ã„ã¾ã™ã‚ˆã†ã€ã‚ˆã‚ã—ããŠé¡˜ã„ã„ãŸã—ã¾ã™ã€‚
è«–æ–‡ DBSJ Letters Vol.6, No.1 ダブルé…列ã«ã‚ˆã‚‹ãƒ‘トリシアを拡張 ã—ãŸåŸºæ•°æŽ¢ç´¢æ³• Radix Search Method Extended Patricia based on the Double-array 望月 久稔 ♥ ä¸æ‘ åº·æ£ â™¦ 尾崎 拓郎 â™ Hisatoshi MOCHIZUKI Yasumasa NAKA
è«–æ–‡ DBSJ Letters Vol.6, No.1 ダブルé…列ã«ã‚ˆã‚‹ãƒ‘トリシアを拡張 ã—ãŸåŸºæ•°æŽ¢ç´¢æ³• Radix Search Method Extended Patricia based on the Double-array 望月 久稔 ♥ ä¸æ‘ åº·æ£ â™¦ 尾崎 拓郎 â™ Hisatoshi MOCHIZUKI Yasumasa NAKAMURA Takuro OZAKI æœ¨æ§‹é€ ã§è¡¨ç¾ã•ã‚Œã‚‹åŸºæ•°æŽ¢ç´¢æ³•ã®æŽ¢ç´¢å‡¦ç†ã‚’高速化ã™ã‚‹ãŸã‚， é·ç§»ãŒ 1 ã¤ã—ã‹å˜åœ¨ã—ãªã„分å²ã‚’圧縮ã—ãŸãƒ‘トリシアや，é·ç§»æ•° を抑制ã™ã‚‹ãŸã‚ã«å¤šåˆ†æœ¨ã¨ã—ãŸãƒžãƒ«ãƒã‚¦ã‚§ã‚¤åŸºæ•°æŽ¢ç´¢æ³•ãŒã‚る． マルãƒã‚¦ã‚§ã‚¤åŸºæ•°æŽ¢ç´¢æ³•ã®ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã¨ã—ã¦ï¼Œç¯€ç‚¹é–“ã®é·ç§»ã‚’定 数時間ã§æ±ºå®šã§ãる高速性をもã¤ãƒ€ãƒ–ルé…列ãŒã‚る．本論文㧠ã¯ï¼Œãƒ€ãƒ–ルé…列ã«ã‚ˆã‚Šãƒ‘トリシアを拡張ã—ãŸåŸºæ•°æŽ¢ç´¢æ³•ã‚’æ案㙠る．評価実験ã®çµæžœï¼Œæ案手法ã¯æŽ¢ç´¢å‡¦ç†ã‚„更新処ç†ã«ãŠã„
1
ãŠçŸ¥ã‚‰ã›
障害
ランã‚ング
リリースã€éšœå®³æƒ…å ±ãªã©ã®ã‚µãƒ¼ãƒ“スã®ãŠçŸ¥ã‚‰ã›
最新ã®äººæ°—エントリーã®é…ä¿¡
j次ã®ãƒ–ックマーク
kå‰ã®ãƒ–ックマーク
lã‚ã¨ã§èªã‚€
eコメント一覧を開ã
oページを開ã
{{#tags}}- {{label}}
{{/tags}}