Algorithms for computing and integrating physical maps using unique probes

Journal of Computational Biology

Volumn 4, Issue 4, 1997, Pages 449-466

  Jain, Mudita ^a   Myers, Eugene W ^a  

^a University of Arizona   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DNA;

ALGORITHM; ARTICLE; CHROMOSOME MAP; CLUSTER ANALYSIS; DNA HYBRIDIZATION; MATHEMATICAL MODEL; MOLECULAR BIOLOGY; MOLECULAR CLONING; PRIORITY JOURNAL;

EID: 0030671537     PISSN: 10665277     EISSN: None     Source Type: Journal    
DOI: 10.1089/cmb.1997.4.449     Document Type: Article

References (15)

1. Alizadeh, F., Karp, R.M., Weisser, D.K. and Zweig, G. 1995. Physical mapping of chromosomes using unique probes. Proceedings of the 4th ACM-SIAM Symposium on Discrete Algorithms, 13, 52-76.
2. Arratia, R., Lander, E.S., Tavare, S. and Waterson, M.S. 1991. Genomic mapping by anchoring random clones: A mathematical analysis. Genomics 11, 806-827.
3. Booth, K.S. and Leuker, O.S. 1976. Testing for the consecutive ones property, interval graphs, and graph planarity using pq-tree algorithms. J. Comp. and Syst. Sci. 13, 335-379.
4. Christof, T., Jünger, M., John Kececioglu, J., Mutizel, P., and Reinelt, G. 1997. A branch-and-cut approach to physical mapping with end-probes. Proceedings of the First Annual International Conference on Computational Molecular Biology. Santa Fe, NM, 84-92.
5. Chandru, V. and Rao, M.R. 1996. Combinatorial optimization: An integer programming perspective. ACM Computing Surveys 28, 55-58.
6. Golumbic, M.C., Kaplan, H., and Shamir, R. 1994. On the complexity of dna physical mapping. Advances in Applied Mathematics 15, 251-261.
7. Jain, M. and Myers, E.W. 1995. A note on scoring clones given a probe ordering. Journal of Computational Biology 2, 33-37.
8. Jünger, M., Reinelt, G., and Theinel, S. 1995. Practical problem solving with cutting plane algorithms in combinatorial optimization. DIMACS Series in Discrete Mathematics 20, 111-152.
9. Kou, T.K. 1997. Polynomial complete consecutive information retrieval problems. SIAM Journal on Computing, 6(1), 67-75.
10. Manber, U. 1989. Introduction to Algorithms - A Creative Approach. Addison-Wesley, Reading, MA.
11. Opatrny, J. 1979. Total ordering problem. SIAM Journal of Computing 8, 111-114.
12. Padberg, M.W. and Grötschel, M. 1985. Polyhedral computations. In Lawler, E.L., Lenstra, J.K., Kan, A.H., and Shmoys, D.B. eds, The Travelling Salesman Problem, 307-360. John Wiley and Sons Ltd.
13. Reinelt, G. 1985. The Linear Ordering Problem: Algorithms and Applications. Helderman Verlag, Berlin.
14. Raghavan, P. and Thompson, C.D. 1987. Randomized rounding: A technique for provably good algorithms and algorithmic proofs. Combinatorica, 7(4), 365-374.
15. Shmoys, D.B. 1995. Computing near-optimal solutions to combinatorial optimization problems. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 20, 355-397.