A uniform framework for ordered restriction map problems

Journal of Computational Biology

Volumn 5, Issue 4, 1998, Pages 725-739

  Parida, Laxmi ^a  

^a POLYTECHNIC UNIVERSITY   (United States)

Author keywords

BFC problem; Combinatorial optimization; EBFC problem; Optical mapping; Physical mapping; Single molecule methods; WCA problem

Indexed keywords

ARTICLE; DNA DETERMINATION; MATHEMATICAL ANALYSIS; PRIORITY JOURNAL; RESTRICTION MAPPING; STATISTICAL MODEL;

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

References (15)

1. Anantharaman, T., Mishra, B., and Schwartz, D. 1997. Genomics via optical mapping II: ordered restriction maps. J. Comput. Biol. 4, 99-118.
2. Arora, S., Karger, D., and Karpinski, M. 1996. Polynomial time approximation schemes for dense instances of NP-Hard problems. S.T.O.C. 28, 314-318.
3. Cooper, N.G., ed. 1994. The Human Genome Project - Deciphering the Blueprint of Heredity. University Science Books, Mill Valley, CA.
4. Dancik, V., Hannenhalli, S., and Muthukrishnan, S. 1997. Hardness of flip-cut problems from optical mapping J. Comput. Biol. 4(2), 119-125.
5. Garey, M., and Johnson, D. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman Press, New York.
6. Geiger, D., and Parida, L. 1996. A Model and Solution to the DNA Flipping String Problem. Courant Institute of Mathematical Sciences, New York University, TR1996-720.
7. Geiger, D., and Parida, L. 1998. Mass Estimation of DNA Molecules and Extraction of Ordered Restriction Maps in Optical Mapping Imagery, to appear in Algorithmica.
8. Karp, R.M., and Shamir, R. 1998. Algorithms for optical mapping, 117-124. In: Ishail, S., Pevzner, P., and Waterman, M. (eds.). Proceedings of the International Conference on Computational Molecular Biology (RECOMB 98). ACM Press, New York.
9. Lee, J.K., Dancik, V., and Waterman, M.S. 1998. Estimation for restriction sites observed by optical mapping using reversible-jump Markov chain Monte Carlo, 147-152. In: Proceedings of the International Conference on Computational Molecular Biology (RECOMB 98). ACM Press, New York.
10. Meng, X., Benson, K., Chada, K., Huff, E., and Schwartz, D. 1995. Optical mapping of lambda bacteriophage clones using restriction endonucleases. Nat. Genet. 9, 432-438.
11. Muthukrishnan, S., and Panda, L. 1997. Towards constructing physical maps by optical mapping: an effective, simple, combinatorial approach, 209-215. In Proceedings of the International Conference on Computational Molecular Biology (RECOMB 97), ACM Press, New York.
12. Parida, L. 1997. Inapproximability of Flip-Cut, Shift-Cut and Other Related Problems From Optical Mapping, Courant Institute of Mathematical Sciences, New York University, TR1997-740.
13. Parida, L., and Mishra, B. 1998. Partitioning K clones: hardness results and practical algorithms for the K-populations problem, 192-201. In Proceedings of the ACM Conference on Computational Molecular Biology (RECOMB 98).
14. Schwartz, D., Li, X., Hernandez, L., Ramnarain, S., Huff, E., and Wang, Y. 1995. Ordered restriction map of Saccharomyces cerevisiae chromosomes constructed by optical mapping. Proc. Natl. Acad. Sci., U.S.A. 92; 165-169.
15. Wang, Y., Huff, E., and Schwartz, D. 1995. Optical mapping of site-directed cleavages on single DNA molecules by the RecA-assisted restriction endonuclease technique, Proc. Natl. Acad. Sci., U.S.A. 92, 165-169.