You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
In parallel to the printed book, each new volume is published electronically in LNCS Online. --Book Jacket.
To examine, analyze, and manipulate a problem to the point of designing an algorithm for solving it is an exercise of fundamental value in many fields. With so many everyday activities governed by algorithmic principles, the power, precision, reliability and speed of execution demanded by users have transformed the design and construction of algorithms from a creative, artisanal activity into a full-fledged science in its own right. This book is aimed at all those who exploit the results of this new science, as designers and as consumers. The first chapter is an overview of the related history, demonstrating the long development of ideas such as recursion and more recent formalizations such ...
Contains papers related to the 1994-98 DIMACS "Special Year" in Mathematical Support for Biology, which involved a series of tutorials, workshops, and lectures. Papers reflect diverse work at the interface between the mathematical sciences and molecular biology. Topics include new uses for uniform lifted alignments, sequence alignment and phylogeny construction, formal language theory and biological macromolecules, parallel strategies for DNA manipulation analysis, and visualizing measures of genetic distance. No index. Annotation copyrighted by Book News, Inc., Portland, OR
This book constitutes the proceedings of the 22nd International Conference on Developments in Language Theory, DLT 2018, held in Tokyo, Japan, in September 2018. The 39 full papers presented in this volume were carefully reviewed and selected from 84 submissions. The papers cover the following topics and areas: combinatorial and algebraic properties of words and languages; grammars, acceptors and transducers for strings, trees, graphics, arrays; algebraic theories for automata and languages; codes; efficient text algorithms; symbolic dynamics; decision problems; relationships to complexity theory and logic; picture description and analysis, polyominoes and bidimensional patterns; cryptography; concurrency; celluar automata; bio-inspired computing; quantum computing.
The refereed proceedings of the 11th Annual International Computing and Combinatorics Conference, COCOON 2005, held in Kunming, China in August 2005. The 96 revised full papers presented together with abstracts of 3 invited talks were carefully reviewed and selected from 353 submissions. The papers cover most aspects of theoretical computer science and combinatorics related to computing and are organized in topical sections on bioinformatics, networks, string algorithms, scheduling, complexity, steiner trees, graph drawing and layout design, quantum computing, randomized algorithms, geometry, codes, finance, facility location, graph theory, graph algorithms.
We are pleased to present the proceedings of the Second Workshop on Al- rithms in Bioinformatics (WABI 2002), which took place on September 17-21, 2002 in Rome, Italy. The WABI workshop was part of a three-conference me- ing, which, in addition to WABI, included the ESA and APPROX 2002. The three conferences are jointly called ALGO 2002, and were hosted by the F- ulty of Engineering, University of Rome “La Sapienza”. Seehttp://www.dis. uniroma1.it/ ̃algo02 for more details. The Workshop on Algorithms in Bioinformatics covers research in all areas of algorithmic work in bioinformatics and computational biology. The emphasis is on discrete algorithms that address important problems in mol...
The first comprehensive overview of preprocessing, mining, and postprocessing of biological data Molecular biology is undergoing exponential growth in both the volume and complexity of biological data and knowledge discovery offers the capacity to automate complex search and data analysis tasks. This book presents a vast overview of the most recent developments on techniques and approaches in the field of biological knowledge discovery and data mining (KDD) providing in-depth fundamental and technical field information on the most important topics encountered. Written by top experts, Biological Knowledge Discovery Handbook: Preprocessing, Mining, and Postprocessing of Biological Data covers ...
This book constitutes the refereed proceedings of the 11th International Workshop on Algorithms in Bioinformatics, WABI 2011, held in Saarbrücken, Germany, in September 2011. The 30 papers presented were carefully reviewed and selected from 77 submissions. They cover aspects of algorithms in bioinformatics, computational biology and systems biology.
This two-volume set of IFIP-AICT 675 and 676 constitutes the refereed proceedings of the 19th IFIP WG 12.5 International Conference on Artificial Intelligence Applications and Innovations, AIAI 2023, held in León, Spain, during June 14–17, 2023. This event was held in hybrid mode. The 75 regular papers and 17 short papers presented in this two-volume set were carefully reviewed and selected from 185 submissions. The papers cover the following topics: Deep Learning (Reinforcement/Recurrent Gradient Boosting/Adversarial); Agents/Case Based Reasoning/Sentiment Analysis; Biomedical - Image Analysis; CNN - Convolutional Neural Networks YOLO CNN; Cyber Security/Anomaly Detection; Explainable AI/Social Impact of AI; Graph Neural Networks/Constraint Programming; IoT/Fuzzy Modeling/Augmented Reality; LEARNING (Active-AutoEncoders-Federated); Machine Learning; Natural Language; Optimization-Genetic Programming; Robotics; Spiking NN; and Text Mining /Transfer Learning.
This major revision of Berstel and Perrin's classic Theory of Codes has been rewritten with a more modern focus and a much broader coverage of the subject. The concept of unambiguous automata, which is intimately linked with that of codes, now plays a significant role throughout the book, reflecting developments of the last 20 years. This is complemented by a discussion of the connection between codes and automata, and new material from the field of symbolic dynamics. The authors have also explored links with more practical applications, including data compression and cryptography. The treatment remains self-contained: there is background material on discrete mathematics, algebra and theoretical computer science. The wealth of exercises and examples make it ideal for self-study or courses. In summary, this is a comprehensive reference on the theory of variable-length codes and their relation to automata.