Scaffold filling under the breakpoint distance

  • Authors:

  • Haitao Jiang;Chunfang Zheng;David Sankoff;Binhai Zhu

  • Affiliations:

  • Department of Computer Science, Montana State University, Bozeman, MT and School of Computer Science and Technology, Shandong University, Jinan, China;Départment d'informatique et de recherche opérationnelle, Université de Montréal, Montréal, Canada;Department of Mathematics and Statistics, University of Ottawa, Ottawa, Canada;Department of Computer Science, Montana State University, Bozeman, MT

  • Venue:
  • RECOMB-CG'10 Proceedings of the 2010 international conference on Comparative genomics
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Motivated by the trend of genome sequencing without completing the sequence of the whole genomes, Muñoz et al. recently studied the problem of filling an incomplete multichromosomal genome (or scaffold) I with respect to a complete target genome G such that the resulting genomic distance between I′ and G is minimized, where I′ is the corresponding filled scaffold. We call this problem the one-sided scaffold filling problem. In this paper, we follow Muñoz et al. to investigate the scaffold filling problem under the breakpoint distance for the simplest unichromosomal genomes.When the input genome contains no gene repetition (i.e., is a fragment of a permutation), we show that the two-sided scaffold filling problem is polynomially solvable. However, when the input genome contains some genes which appear twice, even the one-sided scaffold filling problem becomes NP-complete. Finally, using the ideas for solving the two-sided scaffold filling problem under the breakpoint distance we show that the two-sided scaffold filling problem under the genomic/rearrangement distance is also polynomially solvable.