Subversionã®Diffã‚’C++ã«ç§»æ¤ä½•ã§ã™ã‹ã“ã‚Œã¯ï¼Ÿ 二ã¤ã®ã‚·ãƒ¼ã‚±ãƒ³ã‚¹ã®Longest Common Subsequence, Longest Common Subsequence DistanceåŠã³Shortest Edit Scriptを求ã‚るクラス。 Subversionã®ã‚³ãƒ¼ãƒ‰ã‚’ã€C++ã«ç§»æ¤ã—ãŸã‚‚ã®ã§ã™ã€‚ アルゴリズムã¯ã€"An O(NP) Sequence Comparison Algorithm" (Sun Wu et al.)ã«è¿°ã¹ã‚‰ã‚Œã¦ã„ã‚‹ã‚‚ã®ã¨åŒä¸€ã§ã€è¨ˆç®—é‡ã¯æœ€æ‚ªã§O(NP)ã€å¹³å‡çš„ã«ã¯O(N+PD)ã§ã™ã€‚ãŸã ã—ã€N=二ã¤ã®ã‚·ãƒ¼ã‚±ãƒ³ã‚¹ã®é•·ã•ã®å’Œã€P=D/2-Δ/2ã€D=LCSè·é›¢ã€Î”=二ã¤ã®ã‚·ãƒ¼ã‚±ãƒ³ã‚¹ã®é•·ã•ã®å·®ã§ã™ã€‚ ã“ã“ã§ã„ã†LCSè·é›¢(longest common subsequence distance)ã¯ã€ã‚るシーケンスを別ã®ã‚·ãƒ¼ã‚±ãƒ³ã‚¹ã«å¤‰åŒ–ã•ã›ã‚‹ãŸã‚ã«å¿…è¦ãªã€ã‚·ãƒ³ãƒœãƒ«ã®æŒ¿å…¥åŠã³å‰Šé™¤æ“作ã®æœ€å°
{{#tags}}- {{label}}
{{/tags}}