Nonoverlapping Clone Pooling for High-Throughput Sequencing

Authors:
Reginaldo M. Kuroshu
Affiliations:
Universidade Federal de São Paulo, São José dos Campos
Venue:
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Year:
2013

Citing 3
Cited 0

Approximation algorithms for bin packing: a survey

Approximation algorithms for NP-hard problems
Approximation algorithms for time constrained scheduling

Information and Computation
Optimal pooling for genome re-sequencing with ultra-high-throughput short-read technologies

Bioinformatics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Simultaneously sequencing multiple clones using second-generation sequencers can speed up many essential clone-based sequencing methods. However, in applications such as fosmid clone sequencing and full-length cDNA sequencing, it is important to create pools of clones that do not overlap on the genome for the identification of structural variations and alternatively spliced transcripts, respectively. We define the nonoverlapping clone pooling problem and provide practical solutions based on optimal graph coloring and bin-packing algorithms with constant absolute worst-case ratios, and further extend them to cope with repetitive mappings. Using theoretical analysis and experiments, we also show that the proposed methods are applicable.