| Summary: | 碩士 === 中華大學 === 生物資訊學系碩士班 === 99 === Sorting by prefix reversals of genome rearrangement is widely discussed topic on bioinformatics research. Consider genome orientation, burnt pancake graph can be constructed. For node-to-node routing on n-burnt pancake graph, Cohen and Blum first proposed O(n²) algorithm with at most 2n length of the path in 1993. If there exist (n – 1) faulty nodes, Iwasaki and Kaneko proposed O(n²) algorithm with at most (2n + 4) length of the path in 2010; extending to (n – 1) faulty clusters with diameter 3, Iwasawa proposed O(n²) algorithm with at most (2n + 10) 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-burnt pancake graph with one faulty node, the length of the path is at most (2n + 2), and time complexity is O(n²).
|
|---|
