MINIMUM MOSAIC INFERENCE OF A SET OF RECOMBINANTS

DOI10.1142/S0129054113400042zbMath1269.92057MaRDI QIDQ2841985

Florian Sikora, Romeo Rizzi, Guillaume Blin, Stéphane Vialette

Publication date: 30 July 2013

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

complexitySNPhaplotype

Mathematics Subject Classification ID

Problems related to evolution (92D15) Genetics and epigenetics (92D10) Computational methods for problems pertaining to biology (92-08)

Related Items (1)

Large neighbourhood search algorithms for the founder sequence reconstruction problem

Cites Work

• Reconstructing a history of recombinations from a set of sequences
• Large neighbourhood search algorithms for the founder sequence reconstruction problem
• Haplotyping Populations by Pure Parsimony: Complexity of Exact and Approximation Algorithms

This page was built for publication: MINIMUM MOSAIC INFERENCE OF A SET OF RECOMBINANTS