将sequence最后一个数字后面加上一个符号.pptVIP

HOMEWORK3 Problem 1: Grow the suffix tree for “b a a b c b b a b c”. Draw the intermediate tree with growing point and suffix links for each step of Ukkonen’s algorithm, as we did in the class. HOMEWORK3 HOMEWORK3 Problem 2: Show how to construct a minima tree for any sequence S of numbers in O(|S|) time. HOMEWORK3 Input：a sequence of numbers a1、a2、…an Output：a minima tree T Algorithm： 一、將sequence最後一個數字後面加上一個符號，令其為負無限大；令T為一個LIFO的stack，儲存minima tree； 二、將sequence第一個數字存到T中， 三、 for i:=2 to n+1 do input ai pop a minima tree from stack T compare ai with the root R of minima tree if R ai then let ai be the minima tree and push it into the stack T else HOMEWORK3 pop minima trees from stack T(T1,T2,….,Tk) until Tk ai or T is empty; combine these trees, let Tj-1 be the right child of Tj(j=2 to k-1), and the left child of ai be Tk-1,as T’ push T’ into stack T; end for loop; Prove : 此演算法為正確 PF：利用數學歸納法； (在第n 步的時候, 如果n+1 是’\0’ 則pop all minima trees from stack T and combining the trees as described in the algorithm, 可以得到minima tree.) 假設輸入n個數字時， 當n=2時，當我們輸入a2時，若a1a2，則a1會變成a2的左子樹，否則把兩個數字 存入stack中； Combining minima trees 可得到a1a2的minima tree. 假設當n=k時，是正確的； 當n=k+1時，若aipop出來minima tree的樹根，則ai與該樹根都會被push進去； 若aipop出來minima tree的樹根，則會建出一棵minima tree T’並push進入stack 中，因為根據演算法先pop出來的樹根會大於後來pop的樹根，而這些子樹會分別 成為後一個子樹的右子樹. Combining minima trees 可得到長度為k+1的minima tree. homework3 時間複雜度： 假設有n個數字輸入時，每個數字最多被比較兩次，即當我們輸入到數字ai時，與stack最上面的樹根R比較，若aiR則，ai會被push到stack中，之後當有數字aj當時stack pop出來的樹根R時，stack才會一直pop數字出來與aj比較，直到有個樹根比aj小，此時被pop出來的樹根會被combine起來，存到aj的左子樹，之後便不會在被拿出來比較了，故比較次數最多不超過2n次，所以時間複雜度為O(n) 。 TA’s comments: In another opinion, since each character must perform a multi-pop operation and be push into the stack either combining with existing minima trees or forming a new minima tree