Construction of DNA restriction maps based on a simplified experiment

Bioinformatics

Volumn 17, Issue 5, 2001, Pages 398-404

  Blazewicz J ^a,b   Formanowicz, P ^a,b   Kasprzak, M ^a,b   Jaroszewski, M ^a   Markiewicz, W T ^b  

^a POZNAN UNIVERSITY OF TECHNOLOGY   (Poland)

^b INSTITUTE OF BIOORGANIC CHEMISTRY   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

DNA;

ALGORITHM; ARTICLE; CONTROLLED STUDY; DIGESTION; DNA DETERMINATION; ERROR; EXPERIMENT; GENE CONSTRUCT; MOLECULAR BIOLOGY; PRIORITY JOURNAL; RESTRICTION MAPPING;

EID: 17544392789     PISSN: 13674803     EISSN: 13674811     Source Type: Journal    
DOI: 10.1093/bioinformatics/17.5.398     Document Type: Article

References (18)

1. Alizadeh, F., Karp, R.M., Weisser, D.K. and Zweig, G. (1995) Physical mapping of chromosomes using unique end-probes. J. Comput. Biol., 2, 159-184.
2. Bellon, B. (1988) Construction of restriction maps. Comput. Appl. Biosci., 4, 111-115.
3. Blazewicz, J., Formanowicz, P., Jaroszewski, M., Kasprzak, M. and Markiewicz, W.T. (1999) Algorytmy konstruowania map restrykcyjnych. Report RA-004/99, Poznań Supercomputing and Networking Center.
4. Błażewicz, J., Kasprzak, M., Sterna, M. and Wȩglarz, J. (1996) Selected combinatorial optimization problems arising in molecular biology. Ricerca Operativa, 80, 35-63.
5. Chang, W.I. and Marr, T. (1992) Personal communication to S. Skiena.
6. Dix, T.I. and Kieronska, D.H. (1988) Errors between sites in restriction site mapping. Comput. Appl. Biosci., 4, 117-123.
7. Goldstein, L. and Waterman, M.S. (1987) Mapping DNA by stochastic relaxation. Adv. Appl. Math., 8, 194-207.
8. Grigorjev, A.V. and Mironov, A.A. (1990) Mapping DNA by stochastic relaxation: a new approach to fragment sizes. Comput. Appl. Biosci., 6, 107-111.
9. Maniatis, T., Fritsch, E.F. and Sambrook, J. (1982) Molecular Cloning, a Laboratory Manual. Cold Spring Harbor Laboratory, Cold Spring Harbor, NY.
10. Newberg, L. and Naor, D. (1993) A lower bound on the number of solutions to the probed partial digest problem. Adv. Appl. Math., 14.
11. Pevzner, P.A. (1995) Physical mapping and alternating Eulerian cycles in colored graphs. Algorithmica, 13, 77-105.
12. Rosenblatt, J. and Seymour, P. (1982) The structure of homeometric sets. SIAM J. Alg. Disc. Math., 3, 343-350.
13. Schmitt, W. and Waterman, M.S. (1991) Multiple solutions of DNA restriction mapping problem. Adv. Appl. Math., 12, 412-427.
14. Setubal, J. and Meidanis, J. (1997) Introduction to Computational Biology. PWS, Boston, MA.
15. Skiena, S.S. and Sundaram, G. (1994) A partial digest approach to restriction site mapping. Bull. Math. Biol., 56, 275-294.
16. Skiena, S.S., Smith, W.D. and Lemke, P. (1990) Reconstructing sets from interpoint distances. In Proceedings of the Sixth ACM Symposium on Computational Geometry, pp. 332-339.
17. Tuffery, P., Dessen, P., Mugnier, C. and Hazout, S. (1988) Restriction map constructing using a complete sentences compatibility algorithm. Comput. Appl. Biosci., 4, 103-110.
18. Waterman, M.S. (1995) Introduction to Computational Biology. Maps, Sequences and Genomes. Chapman & Hall, London.