Sciweavers

JDA
2008
122views more  JDA 2008»
14 years 3 days ago
An approximation algorithm for sorting by reversals and transpositions
Abstract. Genome rearrangement algorithms are powerful tools to analyze gene orders in molecular evolution. Analysis of genomes evolving by reversals and transpositions leads to a ...
Atif Rahman, Swakkhar Shatabda, Masud Hasan
CORR
2004
Springer
168views Education» more  CORR 2004»
14 years 13 days ago
Estimating Genome Reversal Distance by Genetic Algorithm
Sorting by reversals is an important problem in inferring the evolutionary relationship between two genomes. The problem of sorting unsigned permutation has been proven to be NP-ha...
Andy Auyeung, Ajith Abraham