Fault-Tolerant Routing Algorithm in Burnt Pancake Graph with one Faulty Node on Genome Rearrangement
碩士 === 中華大學 === 生物資訊學系碩士班 === 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²) a...
Main Authors: | Yu-Wei Wang, 王佑維 |
---|---|
Other Authors: | Jer-Shyan Wu |
Format: | Others |
Language: | zh-TW |
Published: |
2011
|
Online Access: | http://ndltd.ncl.edu.tw/handle/63362774108664143544 |
Similar Items
-
Fault-Tolerant Routing Algorithm in Pancake Graph with one Faulty Node on Genome Rearrangement
by: Chou, Yu-Sheng, et al.
Published: (2011) -
On The Spanning Connectivity of the Burnt Pancake Graphs
by: Li-ping Yu, et al.
Published: (2009) -
The Hamiltonian properties for faulty pancake graphs
by: 梁高源
Published: (2003) -
Engineering bacteria to solve the Burnt Pancake Problem
by: Rosemond Sabriya, et al.
Published: (2008-05-01) -
The Study for Ring Embedding in Faulty Generalized Pancake Networks
by: Ying-Zhi Lai, et al.
Published: (2004)