Hans-Joachim Böckenhauer Book order

This Festschrift volume is published in honor of Juraj Hromkovič on the occasion of his 60th birthday. Juraj Hromkovič is a leading expert in the areas of automata and complexity theory, algorithms for hard problems, and computer science education. The contributions in this volume reflect the breadth and impact of his work. The volume contains 35 full papers related to Juraj Hromkovič’s research. They deal with various aspects of the complexity of finite automata, the information content of online problems, stability of approximation algorithms, reoptimization algorithms, computer science education, and many other topics within the fields of algorithmics and complexity theory. Moreover, the volume contains a prologue and an epilogue of laudatios from several collaborators, colleagues, and friends.

Advances in bioinformatics and systems biology require improved computational methods for analyzing data, while progress in molecular biology is in turn influencing the development of computer science methods. This book introduces some key problems in bioinformatics, discusses the models used to formally describe these problems, and analyzes the algorithmic approaches used to solve them. After introducing the basics of molecular biology and algorithmics, Part I explains string algorithms and alignments; Part II details the field of physical mapping and DNA sequencing; and Part III examines the application of algorithmics to the analysis of biological data. Exciting application examples include predicting the spatial structure of proteins, and computing haplotypes from genotype data. This book describes topics in detail and presents formal models in a mathematically precise, yet intuitive manner, with many figures and chapter summaries, detailed derivations, and examples. It is well suited as an introduction into the field of bioinformatics, and will benefit students and lecturers in bioinformatics and algorithmics, while also offering practitioners an update on current research topics.