论文信息 - Parameterized Algorithms for Minimum Tree Cut/Paste Distance and Minimum Common Integer Partition

Parameterized Algorithms for Minimum Tree Cut/Paste Distance and Minimum Common Integer Partition

We study two NP-hard problems formulated in computational biology. The minimum tree cut/paste distance problem asks for the minimum number of cut/paste operations we need to apply to transform a tree to another tree. The minimum common integer partition problem asks for a minimum-cardinality integer partition of a number that refines two given integer partitions of the same number. We give parameterized algorithms for both problems.

[1] Bonnie Kirkpatrick,et al. Comparing Pedigree Graphs , 2010, J. Comput. Biol..

[2] Guohui Lin,et al. An Improved Approximation Algorithm for the Minimum Common Integer Partition Problem , 2014, ISAAC.

[3] Michael R. Fellows,et al. Fundamentals of Parameterized Complexity , 2013 .

[4] Tao Jiang,et al. On the minimum common integer partition problem , 2006, TALG.

[5] Xin He,et al. Computing Distances between Evolutionary Trees , 1998 .

[6] A. D. Gordon,et al. Obtaining common pruned trees , 1985 .

[7] Hong Zhu,et al. Minimum common string partition revisited , 2010, J. Comb. Optim..

[8] Christian Komusiewicz,et al. Minimum Common String Partition Parameterized by Partition Size Is Fixed-Parameter Tractable , 2013, SODA.

[9] Xin Chen,et al. Assignment of orthologous genes via genome rearrangement , 2005, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

[10] Tao Jiang,et al. MSOAR: A High-Throughput Ortholog Assignment System Based on Genome Rearrangement , 2007, J. Comput. Biol..

[11] Kuo-Chung Tai,et al. The Tree-to-Tree Correction Problem , 1979, JACM.

[12] David P. Woodruff. Better Approximations for the Minimum Common Integer Partition Problem , 2006, APPROX-RANDOM.

[13] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .

[14] Peter Damaschke,et al. Minimum Common String Partition Parameterized , 2008, WABI.