A graph-theoretical approach to the selection of the minimum tiling path from a physical map.
The problem of computing the minimum tiling path (MTP) from a set of clones arranged in a physical map is a cornerstone of hierarchical (clone-by-clone) genome sequencing projects. We formulate this problem in a graph theoretical framework, and then solve by a combination of minimum hitting set and minimum spanning tree algorithms. The tool implementing this strategy, called FMTP, shows improved performance compared to the widely used software FPC. When we execute FMTP and FPC on the same physical map, the MTP produced by FMTP covers a higher portion of the genome, and uses a smaller number of clones. For instance, on the rice genome the MTP produced by our tool would reduce by about 11 percent the cost of a clone-by-clone sequencing project. Source code, benchmark data sets, and documentation of FMTP are freely available at >http://code.google.com/p/fingerprint-based-minimal-tiling-path/ under MIT license.
Department of Mathematics, Statistics and Computer Science, Marquette University, PO Box 1881, Milwaukee, WI 53201-1881, USA. serdar.bozdag@marquette.edu
Serdar
S
Bozdag
Timothy J
TJ
Close
Stefano
S
Lonardi
D000465:Algorithms; D002874:Chromosome Mapping / Q000379:methods*; D018745:Genome, Plant; D023281:Genomics / Q000379:methods*; D001467:Hordeum / Q000235:genetics; D020407:Internet; D012275:Oryza / Q000235:genetics; D017422:Sequence Analysis, DNA / Q000379:methods*; D012984:Software