
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Ekhine Irurozki, Borja Calvo, Jose A. Lozano, "A Preprocessing Procedure for Haplotype Inference by Pure Parsimony," IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 8, no. 5, pp. 11831195, September/October, 2011.  
BibTex  x  
@article{ 10.1109/TCBB.2010.125, author = {Ekhine Irurozki and Borja Calvo and Jose A. Lozano}, title = {A Preprocessing Procedure for Haplotype Inference by Pure Parsimony}, journal ={IEEE/ACM Transactions on Computational Biology and Bioinformatics}, volume = {8}, number = {5}, issn = {15455963}, year = {2011}, pages = {11831195}, doi = {http://doi.ieeecomputersociety.org/10.1109/TCBB.2010.125}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE/ACM Transactions on Computational Biology and Bioinformatics TI  A Preprocessing Procedure for Haplotype Inference by Pure Parsimony IS  5 SN  15455963 SP1183 EP1195 EPD  11831195 A1  Ekhine Irurozki, A1  Borja Calvo, A1  Jose A. Lozano, PY  2011 KW  Biology and genetics KW  haplotype inference KW  optimization. VL  8 JA  IEEE/ACM Transactions on Computational Biology and Bioinformatics ER   
[1] P. Bonizzoni, G. Vedova, R. Dondi, and J. Li, “The Haplotyping Problem: An Overview of Computational Models and Solutions,” J. Computer Science and Technology, vol. 18, pp. 675688, Nov. 2003.
[2] D. Gusfield, “An Overview of Combinatorial Methods for Haplotype Inference,” Proc. DIMACS/RECOMB Satellite Workshop Computational Methods for SNPs and Haplotype Inference, pp. 599600, 2004.
[3] G. Lancia, M.C. Pinotti, and R. Rizzi, “Haplotyping Populations by Pure Parsimony: Complexity, Exact and Approximation Algorithms,” INFORMS J. Computing, vol. 16, pp. 348359, 2004.
[4] D. Gusfield, “Haplotype Inference by Pure Parsimony,” Proc. 14th Ann. Symp. Combinatorial Pattern Matching, pp. 144155, 2003.
[5] D. Gusfield, “A New Statistical Method for Haplotype Reconstruction from Population Data,” Am. J. Human Genetics, vol. 68, pp. 978989, 2001.
[6] R. Sharan, B.V. Halldorsson, and S. Istrail, “Islands of Tractability for Parsimony Haplotyping,” IEEE/ACM Trans. Computational Biology and Bioinformatics, vol. 3, no. 3, pp. 303311, JulySept. 2006.
[7] S. Climer, A.R. Templeton, and W. Zhang, “How Frugal is Mother Nature with Haplotypes?” Bioinformatics, vol. 25, pp. 6874, 2009.
[8] D. Catanzaro, A. Godi, and M. Labbe, “A Class Representative Model for Pure Parsimony Haplotyping,” INFORMS J. Computing, vol. 22, pp. 195209, 2010.
[9] E. Erdem and F. Türe, “Efficient Haplotype Inference with Answer Set Programming,” Proc. 23rd Nat'l Conf. Artificial Intelligence (AAAI '08), pp. 436441, 2008.
[10] J. Neigenfind, G. Gyetvai, R. Basekow, S. Diehl, U. Achenbach, C. Gebhardt, J. Selbig, and B. Kersten, “Haplotype Inference from Unphased SNP Data in Heterozygous Polyploids Based on SAT,” BMC Genomics, vol. 9, no. 1, pp. 356382, 2008.
[11] D.G. Brown and I.M. Harrower, “Integer Programming Approaches to Haplotype Inference by Pure Parsimony,” IEEE/ACM Trans. Computational Biology and Bioinformatics, vol. 3, no. 2, pp. 141154, Apr.June 2006.
[12] B. Halldorsson, V. Vafna, N. Edwards, R. Lippert, S. Yooseph, and S. Istrail, “A Survey of Computational Methods for Determining Haplotypes,” Proc. DIMACS/RECOMB Satellite Workshop Computational Methods for SNPs and Haplotype Inference, pp. 2647, 2004.
[13] L. Wang and Y. Xu, “Haplotype Inference by Maximum Parsimony,” Bioinformatics, vol. 19, pp. 17731780, 2003.
[14] R.S. Wang, X.S. Zhang, and L. Sheng, “Haplotype Inference by Pure Parsimony via Genetic Algorithm,” Proc. Int'l Symp. Operations Research and Its Applications, pp. 171184, 2005.
[15] L. Di Gaspero and A. Roli, “Stochastic Local Search for LargeScale Instances of the Haplotype Inference Problem by Pure Parsimony,” J. Algorithms, vol. 63, nos. 13, pp. 5569, 2008.
[16] I. Lynce, A. MarquesSilva, and Jo, “Efficient Haplotype Inference with Boolean Satisfiability,” Proc. 21st Nat'l Conf. Artificial Intelligence (AAAI '06), pp. 104109, 2006.
[17] A. Graça, J. MarquesSilva, I. Lynce, and A.L. Oliveira, “Efficient Haplotype Inference with PseudoBoolean Optimization,” Proc. Second Int'l Conf. Algebraic Biology, pp. 125139, 2007.
[18] A. Graça, J. MarquesSilva, I. Lynce, and A.L. Oliveira, “Efficient Haplotype Inference with Combined CP and OR Techniques,” Proc. Fifth Int'l Conf. Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, pp. 308312, 2008.
[19] The Int'l HapMap Consortium, “A Second Generation Human Haplotype Map of over 3.1 Million SNPs,” Nature, vol. 449, no. 7164, pp. 851861, 2007.
[20] J. He and A. Zelikovsky, “Linear Reduction for Haplotype Inference,” Proc. Fourth Int'l Workshop Algorithms in Bioinformatics, pp. 242253, 2004.
[21] K. Kalpakis and P. Namjoshi, “Haplotype Phasing Using Semidefinite Programming,” Proc. Fifth IEEE Symp. Bioinformatics and Bioeng. (BIBE), pp. 145152, 2005.
[22] R.R. Hudson, “Generating Samples under a WrightFisher Neutral Model of Genetic Variation,” Bioinformatics, vol. 18, no. 2, pp. 337338, 2002.
[23] V. Bafna, D. Gusfield, S. Hannenhalli, and S. Yooseph, “A Note on Efficient Computation of Haplotypes via Perfect Phylogeny,” J. Computational Biology, vol. 11, no. 5, pp. 858866, 2004.