Algorytmy kombinatoryczne w bioinformatyce − literatura

• Marta Kasprzak, Wybrane algorytmy i modele grafowe w bioinformatyce, Wydawnictwo Politechniki Poznańskiej, Poznań, 2013.
  
• Jacek Błażewicz, Złożoność obliczeniowa problemów kombinatorycznych, WNT, Warszawa, 1988.

• Michael S. Waterman, Introduction to Computational Biology. Maps, Sequences, and Genomes, Chapman & Hall, London, 1995.
• Joao Setubal, Joao Meidanis, Introduction to Computational Molecular Biology, PWS Publishing Company, Boston, MA, 1997.
• Pavel A. Pevzner, Computational Molecular Biology: an Algorithmic Approach, MIT Press, Cambridge, MA, 2000.
• Dan Gusfield, Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology, Cambridge University Press, Cambridge, MA, 1997.
• Claude Berge, Graphs and Hypergraphs, North-Holland Publishing Company, London, 1973.
• Eugene L. Lawler, Combinatorial Optimization: Networks and Matroids, Holt, Rinehart and Winston, New York, 1976.
• Christos H. Papadimitriou, Kenneth Steiglitz, Combinatorial Optimization: Algorithms and Complexity, Prentice Hall, Englewood Cliffs, 1982.
• Michael R. Garey, David S. Johnson, Computers and Intractability. A Guide to the Theory of NP-Completeness, W.H. Freeman & Co., San Francisco, 1979.