This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
3.4 Bibliographic Notes
A. V. Aho, J. E. Hopcroft, and J. D. Ullman: The Design and Analysis of Computer Algorithms. Addison-Wesley, 1974.
A. V. Aho, J. E. Hopcroft, and J. D. Ullman: Data Structures and Algorithms. Addison-Wesley, 1983.
G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, and M. Protasi: Complexity and Approximation — Combinatorial Optimization Problems and Their Approximability Properties, Springer, 1999.
N. Christofides: Worst-case analysis of a new heuristic for the travelling salesman problem. Technical Report, Graduate School of Industrial Administration, Carnegie Mellon University, 1976.
T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein: Introduction to Algorithms, 2nd edition. McGraw-Hill, 2001.
M. Crochemore and W. Rytter: Text Algorithms. Oxford University Press, 1994.
R. Diestel: Graph Theory (Graduate Texts in Mathematics; 173), 3rd edition. Springer, 2005.
M. R. Garey and D. S. Johnson: Computers and Intractability — A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, 1979.
M. C. Golumbic: Algorithmic Graph Theory and Perfect Graphs. Academic Press 1980.
D. Gusfield: Algorithms on Strings, Trees, and Sequences. Cambridge University Press, 1997.
F. Harary: Graph Theory. Addison-Wesley, 1972.
J. E. Hopcroft, R. Motwani, and J D. Ullman: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley 2001, 2nd edition.
J. Hromkoviç: Theoretical Computer Science. Springer, 2004.
J. Hromkoviç: Algorithmics for Hard Problems, 2nd edition. Springer, 2003.
M. Sipser: Introduction to the Theory of Computation. PWS Publishing Company, 1997.
V. V. Vazirani: Approximation Algorithms. Springer, 2001.
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(2007). Basic Concepts: Strings, Graphs, and Algorithms. In: Algorithmic Aspects of Bioinformatics. Natural Computing Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71913-7_3
Download citation
DOI: https://doi.org/10.1007/978-3-540-71913-7_3
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)