Fault-Tolerant Routing Algorithm in Pancake Graph with one Faulty Node on Genome Rearrangement
碩士 === 中華大學 === 生物資訊學系碩士班 === 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...
Main Authors: | Chou, Yu-Sheng, 周育生 |
---|---|
Other Authors: | Jer-Shyan Wu |
Format: | Others |
Language: | zh-TW |
Published: |
2011
|
Online Access: | http://ndltd.ncl.edu.tw/handle/93353967011803051347 |
Similar Items
-
Fault-Tolerant Routing Algorithm in Burnt Pancake Graph with one Faulty Node on Genome Rearrangement
by: Yu-Wei Wang, et al.
Published: (2011) -
The Hamiltonian properties for faulty pancake graphs
by: 梁高源
Published: (2003) -
The Study for Ring Embedding in Faulty Generalized Pancake Networks
by: Ying-Zhi Lai, et al.
Published: (2004) -
Algorithm-Based Fault-Tolerant Strategies in Faulty Hypercube and Star Graph Multicomputers
by: Chen Yuh Shyan, et al.
Published: (1996) -
Fault Tolerance Measures in Recursive Circulant Graph on Forbidden Faulty Sets
by: Yi-Chung Lai, et al.
Published: (2006)