Haplotyping as perfect phylogeny, Proceedings of the sixth annual international conference on Computational biology , RECOMB '02, pp.166-175, 2002. ,
DOI : 10.1145/565196.565218
Reconstructing a history of recombinations from a set of sequences, Discrete Applied Mathematics, vol.88, issue.1-3, pp.1-3, 1998. ,
DOI : 10.1016/S0166-218X(98)00074-2
Segmentation problems, pp.473-482, 1998. ,
Recombination Systems, Lecture Notes in Computer Science, vol.3113, pp.159-169, 2004. ,
DOI : 10.1007/978-3-540-27812-2_15
Haplotyping Populations by Pure Parsimony: Complexity of Exact and Approximation Algorithms, INFORMS Journal on Computing, vol.16, issue.4, pp.348-359, 2004. ,
DOI : 10.1287/ijoc.1040.0085
Haplotype Inference Via Hierarchical Genotype Parsing, Lecture Notes in Computer Science, vol.4645, pp.85-97, 2007. ,
DOI : 10.1007/978-3-540-74126-8_9
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.97.7418
Tabu Search for the Founder Sequence Reconstruction Problem: A Preliminary Study, Lecture Notes in Computer Science, vol.35, issue.3, pp.1035-1042, 2009. ,
DOI : 10.1145/937503.937505
Inferring Piecewise Ancestral History from Haploid Sequences, Lecture Notes in Computer Science, vol.2983, pp.62-73, 2002. ,
DOI : 10.1007/978-3-540-24719-7_5
Finding Founder Sequences from a Set of Recombinants, Lecture Notes in Computer Science, vol.2452, pp.277-286, 2002. ,
DOI : 10.1007/3-540-45784-4_21
Bounds on the Minimum Mosaic of Population Sequences under Recombination, Lecture Notes in Computer Science, vol.6129, pp.152-163, 2010. ,
DOI : 10.1007/978-3-642-13509-5_15
Improved Algorithms for Inferring the Minimum Mosaic of a Set of Recombinants, Lecture Notes in Computer Science, vol.4580, pp.150-161, 2007. ,
DOI : 10.1007/978-3-540-73437-6_17
Genotype Sequence Segmentation: Handling Constraints and Noise, Lecture Notes in Computer Science, vol.5251, pp.271-283, 2008. ,
DOI : 10.1007/978-3-540-87361-7_23