Weak Kernels
暂无分享,去创建一个
[1] Zhi-Zhong Chen,et al. An Approximation Algorithm for the Minimum Co-Path Set Problem , 2010, Algorithmica.
[2] Michael R. Fellows,et al. Parameterized Complexity , 1998 .
[3] Binhai Zhu,et al. Efficient Exact and Approximate Algorithms for the Complement of Maximal Strip Recovery , 2010, AAIM.
[4] Guillaume Fertin,et al. Tractability and approximability of maximal strip recovery , 2012, Theor. Comput. Sci..
[5] Pavel A. Pevzner,et al. Transforming Cabbage into Turnip: Polynomial Algorithm for Sorting Signed Permutations by Reversals , 1999, J. ACM.
[6] Lusheng Wang,et al. On the Tractability of Maximal Strip Recovery , 2009, TAMC.
[7] Rolf Niedermeier,et al. Invitation to data reduction and problem kernelization , 2007, SIGA.
[8] Leslie G. Valiant,et al. Relative Complexity of Checking and Evaluating , 1976, Inf. Process. Lett..
[9] Moni Naor,et al. On the Compressibility of NP Instances and Cryptographic Applications , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).
[10] Jens Stoye,et al. On Sorting by Translocations , 2005, RECOMB.
[11] Yijia Chen,et al. A Logic for PTIME and a Parameterized Halting Problem , 2009, 2009 24th Annual IEEE Symposium on Logic In Computer Science.
[12] Donna K. Slonim,et al. Building human genome maps with radiation hybrids , 1997, RECOMB '97.
[13] Guillaume Fertin,et al. Tractability and approximability of maximal strip recovery , 2011, Theor. Comput. Sci..
[14] Robert E. Tarjan,et al. Finding a Maximum Independent Set , 1976, SIAM J. Comput..
[15] R. Myers,et al. A radiation hybrid map of the proximal long arm of human chromosome 11 containing the multiple endocrine neoplasia type 1 (MEN-1) and bcl-1 disease loci. , 1991, American journal of human genetics.
[16] Lusheng Wang,et al. Exact and approximation algorithms for the complementary maximal strip recovery problem , 2012, J. Comb. Optim..
[17] Michael R. Fellows,et al. On Problems without Polynomial Kernels (Extended Abstract) , 2008, ICALP.
[18] Yu Lin,et al. Sorting signed permutations by inversions in O(nlogn) time. , 2010, Journal of computational biology : a journal of computational molecular cell biology.
[19] David Sankoff,et al. Algorithms for the Extraction of Synteny Blocks from Comparative Maps , 2007, WABI.
[20] David Sankoff,et al. Removing Noise and Ambiguities from Comparative Maps in Rearrangement Analysis , 2007, IEEE/ACM Transactions on Computational Biology and Bioinformatics.
[21] Mihir Bellare,et al. The Complexity of Decision Versus Search , 1991, SIAM J. Comput..
[22] D. Sankoff,et al. Removing Noise and Ambiguities from Comparative Maps in Rearrangement Analysis , 2007, IEEE/ACM Transactions on Computational Biology and Bioinformatics.
[23] Minghui Jiang,et al. Inapproximability of Maximal Strip Recovery: II , 2009, FAW.
[24] Pavel A. Pevzner,et al. To cut…or not to cut (applications of comparative physical maps in molecular evolution) , 1996, SODA '96.
[25] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[26] Alberto Caprara,et al. Sorting by reversals is difficult , 1997, RECOMB '97.
[27] Henning Fernau,et al. Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves , 2009, STACS.
[28] Rolf Niedermeier,et al. A generalization of Nemhauser and Trotterʼs local optimization theorem , 2009, J. Comput. Syst. Sci..
[29] Bin Fu,et al. On recovering syntenic blocks from comparative maps , 2008, J. Comb. Optim..
[30] David S. Johnson,et al. Approximation algorithms for combinatorial problems , 1973, STOC.
[31] Marek Karpinski,et al. 1.375-Approximation Algorithm for Sorting by Reversals , 2002, ESA.
[32] Marie-France Sagot,et al. Sorting by Reversals in Subquadratic Time , 2004, CPM.
[33] Lusheng Wang,et al. An O(n2) algorithm for signed translocation , 2005, J. Comput. Syst. Sci..
[34] Jörg Flum,et al. Parameterized Complexity Theory , 2006, Texts in Theoretical Computer Science. An EATCS Series.
[35] Minghui Jiang,et al. Inapproximability of maximal strip recovery , 2009, Theor. Comput. Sci..
[36] Guillaume Fertin,et al. Maximal strip recovery problem with gaps: Hardness and approximation algorithms , 2009, J. Discrete Algorithms.
[37] Sundar Vishwanathan,et al. An Approximation Algorithm for the Asymmetric Travelling Salesman Problem with Distances One and Two , 1992, Inf. Process. Lett..
[38] Michael R. Fellows,et al. The Lost Continent of Polynomial Time: Preprocessing and Kernelization , 2006, IWPEC.
[39] David A. Bader,et al. A Linear-Time Algorithm for Computing Inversion Distance between Signed Permutations with an Experimental Study , 2001, J. Comput. Biol..
[40] Binhai Zhu,et al. Algorithms for sorting unsigned linear genomes by the DCJ operations , 2011, Bioinform..
[41] Stephen A. Cook,et al. The complexity of theorem-proving procedures , 1971, STOC.
[42] R. Myers,et al. Radiation hybrid mapping: a somatic cell genetic method for constructing high-resolution maps of mammalian chromosomes. , 1990, Science.
[43] Yu Lin,et al. Sorting Signed Permutations by Inversions in O(nlogn) Time , 2009, RECOMB.
[44] Haim Kaplan,et al. Faster and simpler algorithm for sorting signed permutations by reversals , 1997, SODA '97.
[45] Haim Kaplan,et al. A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals , 1999, SIAM J. Comput..
[46] Binhai Zhu,et al. Radiation Hybrid Map Construction Problem Parameterized , 2012, COCOA.
[47] Donna K. Slonim,et al. Building Human Genome Maps with Radiation Hybrids , 1997, J. Comput. Biol..
[48] Pavel A. Pevzner,et al. Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals , 1995, JACM.
[49] Gerhard J. Woeginger,et al. A Faster FPT Algorithm for Finding Spanning Trees with Many Leaves , 2003, MFCS.
[50] Lance Fortnow,et al. Infeasibility of instance compression and succinct PCPs for NP , 2007, J. Comput. Syst. Sci..