Approximating the double-cut-and-join distance between unsigned genomes

• المؤلفون الرئيسيون: Chen, Xin, Sun, Ruimin, Yu, Jiadong
• مؤلفون آخرون: School of Physical and Mathematical Sciences
• التنسيق: مقال
• اللغة: English
• منشور في: 2013
• الموضوعات: Mathematical Sciences
• الوصول للمادة أونلاين: https://hdl.handle.net/10356/100350; http://hdl.handle.net/10220/17879

In this paper we study the problem of sorting unsigned genomes by double-cut-and-join operations, where genomes allow a mix of linear and circular chromosomes to be present. First, we formulate an equivalent optimization problem, called maximum cycle/path decomposition, which is aimed at finding a l...