| Summary: | 碩士 === 中華大學 === 生物資訊學系碩士班 === 99 === Genome rearrangement is given two distinct objects with the same genomes but different ordering to transfer each other. Sorting by prefix reversals is very important transfer operation, pancake graph can be constructed. For node-to-node routing on n-pancake graph, Gates and Papadimitriou first proposed O(n) algorithm with at most 5(n+1)/3 length of the path in 1979. If there exist (n - 2) faulty nodes, Kaneko and Sawada proposed O(n) algorithm with at most 5(n+1)/3+8/3 length of the path in 2007; extending to (n - 2) faulty clusters with diameter 2, they also proposed O(n) algorithm with at most 5(n+1)/3+7 length of the path.
Under well-designed steady system, the probability of faulty node is very low, and it can be repaired well soon. So the most case of node-to-node fault-tolerant routing is only one faulty node. In this thesis, we propose one efficient fault-tolerant routing algorithm in n-pancake graph with one faulty node, the length of the path is at most 5(n+1)/3+４/3, and time complexity is O(n).
|
|---|
