Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
12.4 Bibliographic Notes
V. Bafna, D. Gusfield, G. Lancia, and S. Yooseph: Haplotyping as perfect phylogeny: A direct approach. Journal of Computational Biology 10(3–4), 2003, pp. 323–340.
P. Bonizzoni, G. Della Vedova, R. Dondi, and J. Li: The haplotyping problem: An overview of computational models and solutions. Journal of Computer Science and Technology 18(6), 2003, pp. 675–688.
A. Clark: Inference of haplotypes from PCR-amplified samples of diploid populations. Molecular Biology and Evolution 7, 1990, pp. 111–122.
Z. Ding, V. Filkov, D. Gusfield: A linear-time algorithm for the perfect phylogeny haplotyping (PPH) problem. Proceedings of the 9th Annual International Conference on Research in Computational Molecular Biology (RECOMB’05), Springer LNCS 3500, pp. 585–600.
E. Eskin, E. Halperin, and R. M. Karp: Efficient reconstruction of haplotype structure via perfect phylogeny. Journal of Bioinformatics and Computational Biology 1(1), 2003, pp. 1–20.
D. Gusfield: Inference of haplotypes from samples of diploid populations: Complexity and algorithms. Journal of Computational Biology 8(3), 2001, pp. 305–323.
D. Gusfield: Haplotyping as perfect phylogeny: Conceptual framework and efficient solutions. Proceedings of the 6th Annual International Conference on Computational Biology (RECOMB’02), ACM 2002, pp. 166–175.
D. Gusfield: An overview of combinatorial methods for haplotype inference. In: S. Istrail, M. Waterman, and A. Clark (Eds.): Computational Methods for SNPs and Haplotype Inference, Springer LNBI 2983, 2004, pp. 9–25.
B. V. Halldorsson, V. Bafna, N. Edwards, R. Lippert, S. Yooseph, and S. Istrail: Combinatorial problems arising in SNP and haplotype analysis. Proceedings of the 4th International Conference on Discrete Mathematics and Theoretical Computer Science (DMTCS’03), Springer LNCS 2731, 2003, pp. 26–47.
S. Istrail, M. Waterman, and A. Clark (Eds.): Computational Methods for SNPs and Haplotype Inference, Springer LNBI 2983, 2004.
G. Lancia, V. Bafna, S. Istrail, R. Lippert, and R. Schwartz: SNPs problems, complexity, and algorithms. Proceedings of the 9th Annual European Symposium on Algorithms (ESA’01), Springer LNCS 2161, 2001, pp. 182–193.
A. Panconesi and M. Sozio: Fast Hare: A fast heuristic for single individual SNP haplotype reconstruction. Proceedings of the 4th International Workshop on Algorithms in Bioinformatics (WABI’04), Springer LNCS 3240, 2004, pp. 266–277.
R. Rizzi, V. Bafna, S. Istrail, and G. Lancia: Practical algorithms and fixed-parameter tractability for the single individual SNP haplotyping problem. Proceedings of the Second International Workshop on Algorithms in Bioinformatics (WABI’02), Springer LNCS 2452, 2002, pp. 29–43.
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(2007). Haplotyping. In: Algorithmic Aspects of Bioinformatics. Natural Computing Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71913-7_12
Download citation
DOI: https://doi.org/10.1007/978-3-540-71913-7_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-71912-0
Online ISBN: 978-3-540-71913-7
eBook Packages: Computer ScienceComputer Science (R0)