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.
8.4 Bibliographic Notes
C. Armen and C. Stein: Improved length bounds for the shortest superstring problem (extended abstract). Proceedings of the Fourth International Workshop on Algorithms and Data Structures (WADS’95), Springer LNCS 955, 1995, pp. 494–505.
C. Armen and C. Stein: A 2 2/3 superstring approximation algorithm. Discrete Applied Mathematics 88, 1998, pp. 29–57.
A. Ben-Dor, I. Pe’er, R. Shamir, and R. Sharan: On the Complexity of Positional Sequencing by Hybridization. Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching (CPM’99), Springer LNCS 1645, 1999, pp. 88–100.
A. Blum, T. Jiang, M. Li, J. Tromp, and M. Yannakakis: Linear Approximation of Shortest Superstrings. Journal of the ACM 41(4), 1994, pp. 630–647.
A. M. Frieze, F. P. Preparata, and E. Upfal: Optimal Reconstruction of a Sequence from its Probes. Journal of Computational Biology 6(3/4), 1999, pp. 361–368.
J. Gallant, D. Maier, and J. A. Storer: On finding minimal length superstrings. Journal of Computer and System Sciences 20, 1980, pp. 50–58.
D. Gusfield: Algorithms on Strings, Trees, and Sequences. Cambridge University Press, 1997.
T. A. Jenkyns: The greedy travelling salesman’s problem. Networks 9, 1979, pp. 363–373.
J. D. Kececioglu: Exact and approximation algorithms for DNA sequence reconstruction. PhD Thesis 1991, University of Arizona, Tucson, Technical Report 91-26.
J. D. Kececioglu and E. W. Myers: Combinatorial Algorithms for DNA Sequence Assembly. Algorithmica 13, 1995, pp. 7–51.
E. W. Myers: Whole-genome DNA sequencing. IEEE Computing in Science and Engineering, 1999, pp. 33–43.
C. Papadimitriou and K. Steiglitz: Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall, 1982.
P. A. Pevzner: L-tuple DNA sequencing: computer analysis. Journal of Biomolecular Structure Dynamics 7, 1989, pp. 63–73.
P. A. Pevzner: Computational Molecular Biology — An Algorithmic Approach. MIT Press, 2000.
J. Setubal and J. Meidanis: Introduction to Computational Molecular Biology. PWS Publishing Company, 1997.
Z. Sweedyk: A 2 1/2-Approximation Algorithm for Shortest Superstring. SIAM Journal on Computing 29(3), 1999, pp. 954–986.
J. Tarhio and E. Ukkonen: A greedy approximation algorithm for constructing shortest common superstrings. Theoretical Computer Science 57, 1988, pp. 131–145.
J. S. Turner: Approximation Algorithms for the Shortest Common Superstring Problem. Information and Computation 83, 1989, pp. 1–20.
E. Ukkonen: A linear-time algorithm for finding approximate shortest common superstrings. Algorithmica 5, 1990, pp. 313–323.
V. Vassilevska: Explicit Inapproximability Bounds for the Shortest Superstring Problem Proceedings of the 30th International Symposium on Mathematical Foundations of Computer Science (MFCS 2005), Springer LNCS 3618, 2005, pp. 793–800.
M. S. Waterman: Introduction to Computational Biology — Maps, Sequences and Genomes. Chapman & Hall/CRC, 1995.
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(2007). DNA Sequencing. In: Algorithmic Aspects of Bioinformatics. Natural Computing Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71913-7_8
Download citation
DOI: https://doi.org/10.1007/978-3-540-71913-7_8
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)