Genome Rearrangements: Fault-Tolerant Routing Analysis in Burnt Pancake Graph with one Faulty Node

CHUR > College Computer Science and Informatics > Department of Bioinformatics > Seminar Papers > Item 987654321/30416

Please use this identifier to cite or link to this item: http://chur.chu.edu.tw/handle/987654321/30416

Title:	Genome Rearrangements: Fault-Tolerant Routing Analysis in Burnt Pancake Graph with one Faulty Node
Authors:	吳哲賢 WU, JER-SHYAN
Contributors:	生物資訊學系 Bioinformatics
Keywords:	基因重組;字首反轉排序;燃燒煎餅圖;容錯繞線 Genome Rearrangements;Sorting by Prefix Reversals;Burnt Pancake Graph;Fault-tolerant Routing
Date:	2012
Issue Date:	2014-06-27 00:59:35 (UTC+8)
Abstract:	基因重組之字首反轉排序問題是生物資訊學近來被廣泛研究的主題，當考慮方向性的情況下，建構出燃燒煎餅圖。在n層燃燒煎餅圖上，考慮點對點繞線，Cohen跟Blum提出了O(n²)演算法，路徑長度上限為2n。當錯誤節點為n – 1個的狀態下，Iwasaki和Kaneko提出了O(n²)演算法，路徑長度上限為2n + 4；當錯誤節點擴大為n - 1群及群間直徑為3的狀態下，Kaneko等人提出了O(n²)演算法，路徑長度上限為2n + 10。在一個設計良好的穩定系統中節點發生錯誤的機率極低，而且當發生錯誤時也能在 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. If there exist (n – 1) faulty nodes, Iwasaki and Kane
Appears in Collections:	[Department of Bioinformatics] Seminar Papers

Files in This Item:

File	Description	Size	Format
s_s121_0005.pdf		26Kb	Adobe PDF	311	View/Open