Computing the minimal tiling path from a physical map by integer linear programming

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5251 LNBI, Issue , 2008, Pages 148-161

  Bozdag, Serdar ^a   Close, Timothy J ^b   Lonardi, Stefano ^a  

^a University of California Riverside   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INTEGER LINEAR PROGRAMMINGS; OPTIMIZATION PROBLEMS; TILING PATHS;

BIOINFORMATICS; CLONING; DYNAMIC PROGRAMMING; INTEGER PROGRAMMING; LINEAR PROGRAMMING; LINEARIZATION; PARTICLE SIZE ANALYSIS; TECHNICAL PRESENTATIONS;

PROBLEM SOLVING;

EID: 56649109633     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-87361-7_13     Document Type: Conference Paper

References (25)

1. Rice physical map data, ftp://ftp.genome.arizona.edu/pub/fpc/rice/
2. FPC-MTP tutorial webpage. http://www.agcol.arizona.edu/software/fpc/ userGuide/mtpdemo/
3. Asano, T.: Dynamic programming on intervals. In: Hsu. W.-L., Lee, R.C.T. (eds.) ISA 1991. LNCS, vol. 557, pp. 199-207. Springer, Heidelberg (1991)
4. Bentley, D.R.: Whole-genome re-sequencing. Curr. Opin. Genet. Dev. 16(6), 545-552 (2006)
5. Bozdag, S., Close, T.J., Lonardi, S.: A compartmentalized approach to the assembly of physical maps. In: Proceedings of BIBE, pp. 218-225 (2007)
6. Edmonds, J., Karp, R.M.: Theoretical improvements in algorithmic efficiency for network flow problems. J. ACM 19(2), 248-264 (1972)
7. Engler, F.W., Hatfield, J., et al.: Locating sequence on FPC maps and selecting a minimal tiling path. Genome Res. 13(9), 2152-2163 (2003)
8. Garey, M.R., Johnson, D.S.: Computers and intractability; a guide to the theory of NP-completeness. W.H. Freeman, New York (1979)
9. Green, E.: Strategies for the Systematic Sequencing of Complex Genomes. Nature Reviews Genetics 2, 573-583(2001)
10. Gregory, S., Sekhon, M., et al.: A physical map of the mouse genome. Nature 418, 743-750 (2002)
11. Hao, J., Orlin, J.B.: A faster algorithm for finding the minimum cut in a directed graph. J. Algorithms 17(3), 424-446 (1994)
12. International Human Genome Sequencing Consortium. A physical map of the human genome. Nature 409, 934-941 (2001)
13. Krzywinski, M., Wallis, J., et al.: Integrated and Sequence-Ordered BAC- and YAC-Based Physical Maps for the Rat Genome. Genome Res. 14(4), 766-779 (2004)
14. Madishetty, K., Condamine, P., et al.: Towards a physical map of the barley "gene space" (in preparation, 2008)
15. Marra, M., Kucaba, T., et al.: A map for sequence analysis of the Arabidopsis thaliana genome. Nat. Genet. 22(3), 265-270 (1999)
16. Nelson, W., Soderlund, C.: Software for restriction fragment physical maps. In: The Handbook of Genome Mapping: Genetic and Physical Mapping, pp. 285-306 (2005)
17. Pop, M., Salzberg, S.: Bioinformatics challenges of new sequencing technology. Trends Genet. 24(3), 142-149 (2008)
18. Ren, C., Lee, M., et al.: A BAC-Based Physical Map of the Chicken Genome. Genome Res. 13(12), 2754-2758 (2003)
19. Soderlund, C., Humphray, S., et al.: Contigs Built with Fingerprints. Markers, and FPC V4.7. Genome Res. 10(11), 1772-1787 (2000)
20. Sulston, J., Mallett, F., et al.: Software for genome mapping by fingerprinting techniques. Comput. Appl. Biosci. 4(1), 125-132 (1988)
21. Sundquist, A., Ronaghi, M., et al.: Whole-genome sequencing and assembly with high-throughput, short-read technologies. PLoS ONE 2(5), 484 (2007)
22. Venter, J.C., Smith, H.O., Hood, L.: A new strategy for genome sequencing. Nature 381(6581), 364-366 (1996)
23. Warren, R.L., Varabei, D., et al.: Physical map-assisted whole-genome shotgun sequence assemblies. Genome Res. 16(6), 768-775 (2006)
24. Wu, Y., Bhat, P., et al.: Efficient and accurate construction of genetic linkage maps from noisy and missing genotyping data. In: Giancarlo, R., Hannenhalli, S. (eds.) WABI 2007. LNCS (LNBI), vol. 4645, pp. 395-406. Springer, Heidelberg (2007)
25. Zerbino, D., Birney, E.: Velvet: Algorithms for de novo short read assembly using de bruijn graphs. Genome Res. 18(5), 821-829 (2008)