You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
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. Figures, chapter summaries, detailed derivations, and examples, are provided.
During its 30-year existence, the International Workshop on Graph-Theoretic Concepts in Computer Science has become a distinguished and high-quality computer science event. The workshop aims at uniting theory and practice by demonstrating how graph-theoretic concepts can successfully be applied to v- ious areas of computer science and by exposing new theories emerging from applications. In this way, WG provides a common ground for the exchange of information among people dealing with several graph problems and working in various disciplines. Thereby, the workshop contributes to forming an interdis- plinary research community. The original idea of the Workshop on Graph-Theoretic Concepts in C...
Algorithms specify the way computers process information and how they execute tasks. Many recent technological innovations and achievements rely on algorithmic ideas – they facilitate new applications in science, medicine, production, logistics, traffic, communi¬cation and entertainment. Efficient algorithms not only enable your personal computer to execute the newest generation of games with features unimaginable only a few years ago, they are also key to several recent scientific breakthroughs – for example, the sequencing of the human genome would not have been possible without the invention of new algorithmic ideas that speed up computations by several orders of magnitude. The great...
Systematically teaches key paradigmic algorithm design methods Provides a deep insight into randomization
The 29th International Workshop on Graph-Theoretic Concepts in Computer Science(WG2003)washeldintheMennorodeconferenceCenterinElspeet,The Netherlands.TheworkshopwasorganizedbytheCenterforAlgorithmicSystems of the Institute of Information and Computing Sciences of Utrecht University. The workshop took place June 19–21, 2003. The 72 participants of WG 2003 came from universities and research institutes from 18 di?erent countries and ?ve di?erent continents. The workshop looks back at a long tradition. It was ?rst held in 1975, and has been held 20 times in Germany, twice in Austria, and once in Italy, Slo- kia, Switzerland, and the Czech Republic, and has now been held for the third time in ...
Automata theory is the foundation of computer science. Its applications have spread to almost all areas of computer science and many other disciplines. In addition, there is a growing number of software systems designed to manipulate automata, regular expressions, grammars, and related structures. This volume contains 24 regular papers from the 8th International Conference on Implementation and Application of Automata (CIAA 2003) held in Santa Barbara, CA, USA, in July 2003 covering various topics in the theory, implementation, and application of automata and related structures. It also includes the abstracts of two invited lectures as well as the abstracts of the poster papers displayed during the conference.
The international conference on current trends in the theory and practice of informatics SOFSEM 2000 was held 25 November–2 December 2000 in the c- ference facilities of the Dev?et Skal (Nine Rocks) Hotel, Milovy, Czech-Moravian Highlands, the Czech Republic. It was already the 27th annual meeting in the series of SOFSEM conferences organized in either the Czech or the Slovak Rep- lic. Since its establishment in 1974, SOFSEM has gone through a long dev- opment in parallel with the entire ?eld of informatics. Currently SOFSEM is a wide-scope, multidisciplinary conference, with stress on the interplay between the theory and practice of informatics. The SOFSEM scienti?c program consists mainl...
Juraj Hromkovic takes the reader on an elegant route through the theoretical fundamentals of computer science. The author shows that theoretical computer science is a fascinating discipline, full of spectacular contributions and miracles. The book also presents the development of the computer scientist's way of thinking as well as fundamental concepts such as approximation and randomization in algorithmics, and the basic ideas of cryptography and interconnection network design.
This book constitutes the thoroughly refereed postproceedings of the 29th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2003, held in Elspeet, The Netherlands in June 2003. The 30 revised full papers presented together with 2 invited papers were carefully reviewed, improved, and selected from 78 submissions. The papers present a wealth of new results for various classes of graphs, graph computations, graph algorithms, and graph-theoretical applications in various felds.