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: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2011
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/63362774108664143544 |