On the Complexity of SNP Block Partitioning Under the Perfect Phylogeny Model

@inproceedings{Gramm2006OnTC,
  title={On the Complexity of SNP Block Partitioning Under the Perfect Phylogeny Model},
  author={Jens Gramm and Tzvika Hartman and Till Nierhoff and Roded Sharan and Till Tantau},
  booktitle={WABI},
  year={2006}
}
Recent technologies for typing single nucleotide polymorphisms (SNPs) across a population are producing genome-wide genotype data for tens of thousands of SNP sites. The emergence of such large data sets underscores the importance of algorithms for large-scale haplotyping. Common haplotyping approaches first partition the SNPs into blocks of high linkage-disequilibrium, and then infer haplotypes for each block separately. We investigate an integrated haplotyping approach where a partition of… CONTINUE READING

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 28 references

A note on phasing long genomic regions using local haplotype predictions

  • E. Eskin, E. Halperin, R. Sharan
  • Journal of Bioinformatics and Computational…
  • 2006
1 Excerpt

On the complexity of SNP block partitioning under the perfect phylogeny model

  • Jens Gramm, Tzvika Hartman, Till Nierhoff, Roded Sharan, Till Tantau
  • In Proc. of the sixth Workshop on Algorithms in…
  • 2006
1 Excerpt

Handbook of Computational Molecular Biology, chapter Combinatorial Methods for Haplotype Inference

  • Dan Gusfield, Steven Hecht Orzack
  • 2005
1 Excerpt

Haplotype Inference

  • R. M. Karp
  • CRC Handbook on Bioinformatics
  • 2005

Similar Papers

Loading similar papers…