Computing the Minimal Tiling Path from a Physical Map by Integer Linear Programming

Authors:
Serdar Bozdag;Timothy J Close;Stefano Lonardi
Affiliations:
Dept. of Computer Science and Eng., University of California, Riverside,;Dept. of Botany and Plant Sciences, University of California, Riverside,;Dept. of Computer Science and Eng., University of California, Riverside,
Venue:
WABI '08 Proceedings of the 8th international workshop on Algorithms in Bioinformatics
Year:
2008

Citing 5
Cited 1

A faster algorithm for finding the minimum cut in a directed graph

SODA selected papers from the third annual ACM-SIAM symposium on Discrete algorithms
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems

Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Dynamic Programming on Intervals

ISA '91 Proceedings of the 2nd International Symposium on Algorithms
Efficient and accurate construction of genetic linkage maps from noisy and missing genotyping data

WABI'07 Proceedings of the 7th international conference on Algorithms in Bioinformatics

A Graph-Theoretical Approach to the Selection of the Minimum Tiling Path from a Physical Map

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the problem of selecting the minimal tiling path (MTP) from a set of clones arranged in a physical map. We formulate the constraints of the MTP problem in a graph theoretical framework, and we derive an optimization problem that is solved via integer linear programming. Experimental results show that when we compare our algorithm to the commonly used software FPC, the MTP produced by our method covers a higher portion of the genome, even using a smaller number of MTP clones. These results suggest that if one would employ the MTP produced by our method instead of FPC's in a clone-by-clone sequencing project, one would reduce by about 12% the sequencing cost.