Computer science : Theory and applications ; 15th International computer science symposium in Russia, CSR 2020, Yekaterinburg, Russia, June 29 – July 3, 2020, Proceedings
This book constitutes the proceedings of the 15th International Computer Science Symposium in Russia, CSR 2020, held in Yekaterinburg, Russia, in June 2020. The 25 full papers and 6 invited papers were carefully reviewed and selected from 49 submissions. The papers cover a broad range of topics, such as: algorithms and data structures; computational complexity, including hardness of approximation and parameterized complexity; randomness in computing, approximation algorithms, fixed-parameter algorithms; combinatorial optimization, constraint satisfaction, operations research; computational geometry; string algorithms; formal languages and automata, including applications to computational linguistics; codes and cryptography; combinatorics in computer science; computational biology; applications of logic to computer science, proof complexity; database theory; distributed computing; fundamentals of machine learning, including learning theory, grammatical inference and neural computing; computational social choice; quantum computing and quantum cryptography; theoretical aspects of big data.
Combinatorial pattern matching ; Vol. 3537 ; 16th Annual Symposium, CPM 2005, Jeju Island, Korea, June 19-22, 2005, Proceedings
This volume presents the proceedings of The 16th Annual Symposium on Combinatorial Pattern Matching was heldon Jeju Island, Korea on June 19–22, 2005. the Program Committee accepted 37 of the submissionsto be presented at the conference. This collection of papers offers original research contributionsin combinatorial pattern matching and its applications.In addition to the selected papers
Algorithmic Aspects of Bioinformatics
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.


