A Polynomial Time Solution for Permutation Scaffold Filling

• Published in: Combinatorial Optimization and Applications Vol. 10043; pp. 782 - 789
• Main Authors: Liu, Nan, Zou, Peng, Zhu, Binhai
• Format: Book Chapter
• Language: English
• Published: Switzerland Springer International Publishing AG 2016; Springer International Publishing
• Series: Lecture Notes in Computer Science
• Subjects: Algorithms & data structures; Discrete mathematics; Mathematical theory of computation
• ISBN: 9783319487489; 3319487485
• ISSN: 0302-9743; 1611-3349
• DOI: 10.1007/978-3-319-48749-6_60

Recently, the scaffold filling problem has attracted a lot of attention due to its potential applications in processing incomplete genomic data. However, almost all the current research assumes that a scaffold is given as an incomplete sequence (i.e., missing genes can be inserted anywhere in the incomplete sequence). This differs significantly from most of the real genomic dataset, where a scaffold is given as a sequence of contigs. We show in this paper that when a scaffold is given as a sequence of contigs, and when the genome contains no duplication of genes, the corresponding scaffold filling problem, with the objective being maximizing the number of adjacencies between the filled scaffold and a complete reference genome, is polynomially solvable.