论文信息 - Genome Aliquoting Revisited

Genome Aliquoting Revisited

We prove that the genome aliquoting problem, the problem of finding a recent polyploid ancestor of a genome, with breakpoint distance can be solved in polynomial time. We propose an aliquoting algorithm that is a 2-approximation for the genome aliquoting problem with double cut and join distance, improving upon the previous best solution to this problem, Feijao and Meidanis' 4-approximation algorithm.

David Sankoff | Robert Warren

[1] David Sankoff,et al. Genome aliquoting with double cut and join , 2009, BMC Bioinformatics.

[2] David Sankoff,et al. Genome Halving with Double Cut and Join , 2009, APBC.

[3] Pavel A. Pevzner,et al. Whole Genome Duplications and Contracted Breakpoint Graphs , 2007, SIAM J. Comput..

[4] David Sankoff,et al. Multichromosomal median and halving problems under different genomic distances , 2009, BMC Bioinformatics.

[5] João Meidanis,et al. SCJ: A Variant of Breakpoint Distance for Which Sorting, Genome Median and Genome Halving Problems Are Easy , 2009, WABI.

[6] David Sankoff,et al. The Reconstruction of Doubled Genomes , 2003, SIAM J. Comput..

[7] Jens Stoye,et al. A Unifying View of Genome Rearrangements , 2006, WABI.

[8] David Sankoff,et al. The Median Problem for Breakpoints in Comparative Genomics , 1997, COCOON.

[9] Julia Mixtacki,et al. Genome Halving under DCJ Revisited , 2008, COCOON.