论文信息 - Fast Hare: A Fast Heuristic for Single Individual SNP Haplotype Reconstruction

Fast Hare: A Fast Heuristic for Single Individual SNP Haplotype Reconstruction

We study the single individual SNP haplotype reconstruction problem. We introduce a simple heuristic and prove experimentally that is very fast and accurate. In particular, when compared with a dynamic programming of [8] it is much faster and also more accurate. We expect Fast Hare to be very useful in practical applications. We also introduce a combinatorial problem related to the SNP haplotype reconstruction problem that we call Min Element Removal. We prove its NP-hardness in the gapless case and its O(log n)-approximability in the general case.

Alessandro Panconesi | Mauro Sozio | A. Panconesi | Mauro Sozio

[1] Giuseppe Lancia,et al. Practical Algorithms and Fixed-Parameter Tractability for the Single Individual SNP Haplotyping Problem , 2002, WABI.

[2] Mihalis Yannakakis,et al. Multiway Cuts in Directed and Node Weighted Graphs , 1994, ICALP.

[3] Rita Casadio,et al. Algorithms in Bioinformatics, 5th International Workshop, WABI 2005, Mallorca, Spain, October 3-6, 2005, Proceedings , 2005, WABI.

[4] Eugene W. Myers,et al. A Dataset Generator for Whole Genome Shotgun Sequencing , 1999, ISMB.

[5] Friedhelm Meyer auf der Heide,et al. Algorithms — ESA 2001 , 2001, Lecture Notes in Computer Science.

[6] Robin Milner,et al. On Observing Nondeterminism and Concurrency , 1980, ICALP.

[7] Russell Schwartz,et al. Haplotypes and informative SNP selection algorithms: don't block out information , 2003, RECOMB '03.

[8] Russell Schwartz,et al. SNPs Problems, Complexity, and Algorithms , 2001, ESA.

[9] Jon M. Kleinberg,et al. Segmentation problems , 2004, JACM.

[10] Russell Schwartz,et al. SNPs Problems, Algorithms and Complexity , 2001 .