The restriction mapping problem revisited

Journal of Computer and System Sciences

Volumn 65, Issue 3, 2002, Pages 526-544

  Pandurangan, Gopal ^a,c   Ramesh, H ^b  

^a Brown Univerity   (United States)

^b INDIAN INSTITUTE OF SCIENCE   (India)

^c Purdue University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; DNA; GRAPHIC METHODS; OPTIMIZATION; TREES (MATHEMATICS);

EVOLUTIONARY DISTANCE; PEPTIDE SEQUENCING PROBLEM; PROTEIN MOLECULES; RESTRICTION MAPPLING;

GENES;

EID: 23844517757     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/S0022-0000(02)00008-9     Document Type: Article

References (20)

1. L. Allison, C.N. Yee, Restriction site mapping is in separation theory, Comput. Appl. Biol. Sci. 4 (1988) 97-101.
2. J. Blazewicz, P. Formanowicz, M. Kasprzak, M. Jaroszewski, W.T. Markiewicz, Simplified partial digest method for DNA restriction maps construction, Bioinformatics 17 (5) (2001) 398-404
3. (also appeared as a poster in The Fifth International Conference on Computational Biology (RECOMB), Montreal, Canada, 2001).
4. T. Chen, M. Kao, M. Tepel, J. Rush, G.M. Church, A dynamic programming approach to de novo peptide sequencing via tandem mass spectrometry, in: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), San Francisco, CA, 2000, pp. 389-398.
5. V. Dancik, T.A. Addona, K.R. Clauser, J.E. Vath, P.A. Pevzner, De nova peptide sequencing via tandem mass spectrometry: a graph-theoretical approach, in: Proceedings of the Third Annual International Conference on Computational Molecular Biology (RECOMB), Lyon, France, 1999.
6. T. Dakic, On the Turnpike problem, Ph.D. Thesis, Simon Fraser University, August 2000.
7. T.I. Dix, D.H. Kieronska, Errors between sites in restriction site mapping, Comput. Appl. Biol. Sci. 4 (1988) 117-123.
8. L. Goldstein, M.S. Waterman, Mapping DNA by stochastic relaxation, Adv. Appl. Math. 8 (1987) 194-207.
9. R.M. Karp, R. Shamir, Algorithms for optical mapping, in: Proceedings of the Second International Conference on Computational Biology (RECOMB), New York, NY, 1998, pp. 117-124.
10. L. Newberg, D. Naor, A lower bound on the number of solutions of the probed partial digest problem, Adv. Appl. Math. 14 (1993) 172-183.
11. P.A. Pevzner, Computational Molecular Biology: An Algorithmic Approach, MIT Press, Cambridge, 2000.
12. J. Rosenblatt, P. Seymour, The structure of homometric sets, SIAM J. Algebraic Discrete Methods 3 (1982) 343-350.
13. J. Sambrook, E.F. Fritsch, T. Maniatis, Molecular Cloning, a Laboratory Manual, 2nd Edition, Cold Spring Harbor Laboratory Press, New York, 1989.
14. D.C. Schwartz, X. Li, L.I. Hernandez, S.P. Ramnarain, E.J. Huff, Y.K. Wang, Ordered restriction maps of Saccharomyces cerevisiac chromosomes constructed by optical mapping, Science 262 (1993) 110-114.
15. S.S. Skiena, W.D. Smith, P. Lemke, Reconstructing sets from interpoint distances, in: Proceedings of the Sixth ACM Symposium on Computational Geometry, Berkeley, CA, 1990, pp. 332-339.
16. S.S. Skiena, G. Sundaram, A partial digest approach to restriction site mapping, Bull. Math. Biol. 56 (2) (1994) 275-294.
17. M. Stefik, Inferring DNA structures from segmentation data, Artif. Intell. 11 (1978) 85-114.
18. M.S. Waterman, Introduction to Computational Biology: Maps, Sequences and Genomes, 1st Edition, Chapman & Hall, New York, 1995.
19. M.A. Weiss, Data Structures and Algorithm Analysis in C+ +, Benjamin/Cummings, Menlo Park, CA, 1994.
20. Z. Zhang, An exponential example for a partial digest mapping algorithm, J. Comput. Biol. 1 (3) (1994) 235-239.