Transforming cabbage into turnip polynomial algorithm for sorting signed permutations by reversals.

Transforming cabbage into turnip polynomial algorithm for sorting signed permutations by reversals.

Genomes frequently evolve by reversals &rgr;(i,j) that transform a gene order &pgr;1 ? &pgr;i&pgr;i+1 ? &pgr;j-1&pgr;j ? &pgr;n into &pgr;1 ? &pgr;i&pgr;j-1 ? &pgr;i+1&pgr;j ? &pgr;n. Reversal distance between permutations &pgr; and &sgr;is...

詳細記述

書誌詳細
出版年:Journal of the ACM 46, 1 (1999).
第一著者: Hannenhalli, Sridhar
フォーマット: 論文
言語:English
主題:
Computer applications.
Life and medical sciences.
Biology and genetics.
Theory of computation.
Computation by abstract devices.
Mathematics of computing.
Discrete mathematics.
Algorithms.