A simple algorithm for sorting by reversal

ASIAIR > College of Computer Science > Proceedings > Item 310904400/7175

Please use this identifier to cite or link to this item: http://asiair.asia.edu.tw/ir/handle/310904400/7175

Title:	A simple algorithm for sorting by reversal
Other Titles:	一個簡單的反轉排序演算法
Authors:	張民欣;許弘駿
Contributors:	慈濟大學醫學資訊系
Keywords:	計算生物學;基因重組;反轉排序;符號排列;Computational biology;Genome rearrangement;Reversal sorting;signed permutations
Date:	2007-12-20
Issue Date:	2010-01-12 08:23:39 (UTC+0)
Publisher:	亞洲大學資訊學院;中華電腦學會
Abstract:	計算兩組符號排列間反轉距離的問題在近十年引起計算分子生物學對於基因重組問題的重視。給定兩個基因組，為含有相同元素的符號排列，找出一組排列藉由一連串反轉後，轉變成另一組排列所需的最少反轉次數。我們提出新的演算法，不需要複雜的結構，對兩組具有相同元素個數的符號排列做反轉排序。Computing reversal distance of two signed permutations has given rise to computational molecular biology with regard to genome rearrangement in the recent decade. Given two genomes represented as signed permutations of the same elements, the problem consists in finding the minimum number of reversals that transforms one genome into the other. In this paper we present a new algorithm for the problem of sorting signed permutations by reversals without complex construction.
Relation:	2007NCS全國計算機會議 12-20~21
Appears in Collections:	[College of Computer Science] Proceedings

Files in This Item:

File	Size	Format
7020.pdf	250Kb	Adobe PDF	1012	View/Open