Reginaldo M. Kuroshu , Universidade Federal de São Paulo, São José dos Campos
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TCBB.2013.83
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 non-overlapping 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.
Biology and genetics, Graph algorithms
Reginaldo M. Kuroshu, "Non-overlapping Clone Pooling for High-Throughput Sequencing", IEEE/ACM Transactions on Computational Biology and Bioinformatics, , no. 1, pp. 1, PrePrints PrePrints, doi:10.1109/TCBB.2013.83