Minimum mosaic inference of a set of recombinants

DOI10.1142/S0129054113400042zbMATH Open1269.92057MaRDI QIDQ2841985FDOQ2841985

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

Publication date: 30 July 2013

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

Recommendations

• Improved Algorithms for Inferring the Minimum Mosaic of a Set of Recombinants
• scientific article; zbMATH DE number 1945170
• Bounds on the minimum mosaic of population sequences under recombination
• Research in Computational Molecular Biology
• Reconstructing a history of recombinations from a set of sequences

zbMATH Keywords

complexitySNPhaplotype

Mathematics Subject Classification ID

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

Cites Work

• Haplotyping populations by pure parsimony: complexity of exact and approximation algorithms
• Reconstructing a history of recombinations from a set of sequences
• Large neighbourhood search algorithms for the founder sequence reconstruction problem

Cited In (9)

• Title not available (Why is that?)
• Minimum segmentation for pan-genomic founder reconstruction in linear time
• Large neighbourhood search algorithms for the founder sequence reconstruction problem
• Research in Computational Molecular Biology
• Bounds on the minimum mosaic of population sequences under recombination
• Two strikes against the phage recombination problem
• Improved Algorithms for Inferring the Minimum Mosaic of a Set of Recombinants
• Minimal Conflicting Sets for the Consecutive Ones Property in Ancestral Genome Reconstruction
• Linear time maximum segmentation problems in column stream model

This page was built for publication: Minimum mosaic inference of a set of recombinants

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2841985)