M. Koivisto, P. Rastas, and E. Ukkonen, Recombination Systems, Theory Is Forever, p.159169, 2004.
DOI : 10.1007/978-3-540-27812-2_15

D. John, D. Kececioglu, and . Guseld, Reconstructing a history of recombinations from a set of sequences, Discrete Applied Mathematics, vol.88, issue.1- 3, p.239260, 1998.

E. Ukkonen, Finding Founder Sequences from a Set of Recombinants, Algorithms in Bioinformatics, Second International Workshop (WABI), p.277286, 2002.
DOI : 10.1007/3-540-45784-4_21

R. Schwartz, A. G. Clark, and S. Istrail, Inferring piecewise ancestral history from haploid sequences, Computational Methods for SNPs and Haplotype Inference, p.6273, 2002.
DOI : 10.1007/978-3-540-24719-7_5
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.186.3490

P. Rastas and E. Ukkonen, Haplotype Inference Via Hierarchical Genotype Parsing, Algorithms in Bioinformatics, 7th International Workshop (WABI), p.8597, 2007.
DOI : 10.1007/978-3-540-74126-8_9

Y. Wu and D. Guseld, Improved Algorithms for Inferring the Minimum Mosaic of a Set of Recombinants
DOI : 10.1007/978-3-540-73437-6_17

Q. Zhang, W. Wang, L. Mcmillan-prins, F. Pardo-manuel-de-villena, and D. Threadgill, Genotype Sequence Segmentation: Handling Constraints and Noise, Algorithms in Bioinformatics, 8th International Workshop (WABI), p.271283, 2008.
DOI : 10.1007/978-3-540-87361-7_23
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.158.4939

D. Guseld, Haplotyping as perfect phylogeny: conceptual framework and ecient solutions, 6th International Conference on Computational Biology (RECOMB), p.166175, 2002.

G. Lancia, M. C. Pinotti, and R. Rizzi, Haplotyping Populations by Pure Parsimony: Complexity of Exact and Approximation Algorithms, INFORMS Journal on Computing, vol.16, issue.4, p.348359, 2004.
DOI : 10.1287/ijoc.1040.0085

J. M. Kleinberg, C. H. Papadimitriou, and P. Raghavan, Segmentation problems, 13th ACM Symp. Theory of Computing (STOC), p.473482, 1998.

Y. Wu, Bounds on the Minimum Mosaic of Population Sequences under Recombination, Combinatorial Pattern Matching, 21st Annual Symposium (CPM), p.152163, 2010.
DOI : 10.1007/978-3-642-13509-5_15

A. Roli, S. Benedettini, T. Stützle, and C. Blum, Large neighbourhood search algorithms for the founder sequence reconstruction problem, Computers & Operations Research, vol.39, issue.2, p.213224, 2012.
DOI : 10.1016/j.cor.2011.03.012