Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
7.4 Bibliographic Notes
F. Alizadeh, R. M. Karp, L. A. Newberg, and D. K. Weisser: Physical mapping of chromosomes: A combinatorial problem in computational biology. Algorithmica 13(1/2), 1995, pp. 52–76.
F. Alizadeh, R. M. Karp, D. K. Weisser, and G. Zweig: Physical mapping of chromosomes using unique probes. Journal of Computational Biology 2(2), 1995, pp. 159–184.
K. S. Booth and G. S. Lueker: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. Journal of Computer and System Sciences 13, 1976, pp. 335–379.
M. Cieliebak: Algorithms and Hardness Results for DNA Physical Mapping, Protein Identification, and Related Combinatorial Problems. PhD thesis, ETH Zurich, 2003.
M. Cieliebak, S. Eidenbenz, and G. J. Woeginger: Double Digest Revisited: Complexity and Approximability in the Presence of Noisy Data. Technical Report of the ETH Zurich 382, 2002.
M. Cieliebak, S. Eidenbenz, and P. Penna: Noisy Data Make the Partial Digest Problem NP-hard. Technical Report of the ETH Zurich 381, 2002.
K. J. Danna, G. H. Sack, and D. Nathans: Studies of simian virus 40 DNA. VII. a cleavage map of the SV40 genome. Journal of Molecular Biology 78, 1973, pp. 263–276.
D. R. Fulkerson and O. A. Gross: Incidence matrices and interval graphs. Pacific Journal of Mathematics 15(3), 1965, pp. 835–855.
M. R. Garey and D. S. Johnson: Computers and Intractability — A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, 1979.
L. Goldstein and M.S. Waterman: Mapping DNA by stochastic relaxation. Advances in Applied Mathematics 8, 1987, pp. 194–207.
M. C. Golumbic: Algorithmic Graph Theory and Perfect Graphs. Academic Press 1980.
D. Greenberg and S. Istrail: Physical mapping by STS hybridization: Algorithmic strategies and the challenge of software evaluation. Journal of Computational Biology 2(2), 1995, pp. 219–274.
J. Hromkoviç: Algorithmics for Hard Problems, 2nd edition. Springer, 2003.
R. M. Karp and R. Shamir: Algorithms for Optical Mapping. Journal of Computational Biology 7(1/2), 2000, pp. 303–316.
E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, and D. B. Shmoys (eds.): The Traveling Salesman Problem. Wiley, 1985.
P. A. Pevzner: DNA physical mapping and alternating Eulerian cycles in colored graphs. Algorithmica 13, 1995, pp. 77–105.
P. A. Pevzner: Computational Molecular Biology — An Algorithmic Approach. MIT Press, 2000.
J. Rosenblatt and P. D. Seymour: The structure of homometric sets. SIAM Journal on Algebraic and Discrete Methods 3(3), 1982, pp. 343–350.
W. Schmitt and M. S. Waterman: Multiple solutions of DNA restriction mapping problem. Advances in Applied Mathematics 12, 1991, pp. 412–427.
J. Setubal and J. Meidanis: Introduction to Computational Molecular Biology. PWS Publishing Company, 1997.
S. S. Skiena, W. D. Smith, P. Lemke: Reconstructing sets from interpoint distances (extended abstract). Proceedings of the 6th Annual Symposium on Computational Geometry, ACM 1990, pp. 332–339.
S. S. Skiena G. Sundaram: A partial digest approach to restriction site mapping. Bulletin of Mathematical Biology 56(2), 1994, pp. 275–294.
M. S. Waterman: Introduction to Computational Biology — Maps, Sequences and Genomes. Chapman & Hall/CRC, 1995.
Z. Zhang: An exponential example for a partial digest mapping algorithm. Journal of Computational Biology 1(3), 1994, pp. 235–239.
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(2007). Physical Mapping. In: Algorithmic Aspects of Bioinformatics. Natural Computing Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71913-7_7
Download citation
DOI: https://doi.org/10.1007/978-3-540-71913-7_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-71912-0
Online ISBN: 978-3-540-71913-7
eBook Packages: Computer ScienceComputer Science (R0)