Advances in sequencing technology have allowed scientists to study the human genome in greater depth and on a larger scale than ever before - as many as hundreds of millions of short reads in the course of a few days. But what are the best ways to deal with this flood of data? Algorithms for Next-Generation Sequencing is an invaluable tool for students and researchers in bioinformatics and computational biology, biologists seeking to process and manage the data generated by next-generation sequencing, and as a textbook or a self-study resource. In addition to offering an in-depth description of the algorithms for processing sequencing data, it also presents useful case studies describing the applications of this technology.

Thoroughly Describes Biological Applications, Computational Problems, and Various Algorithmic Solutions Developed from the author's own teaching material, Algorithms in Bioinformatics: A Practical Introduction provides an in-depth introduction to the algorithmic techniques applied in bioinformatics. For each topic, the author clearly details the biological motivation and precisely defines the corresponding computational problems. He also includes detailed examples to illustrate each algorithm and end-of-chapter exercises for students to familiarize themselves with the topics. Supplementary material is available at http://www.comp.nus.edu.sg/~ksung/algo_in_bioinfo/ This classroom-tested textbook begins with basic molecular biology concepts. It then describes ways to measure sequence similarity, presents simple applications of the suffix tree, and discusses the problem of searching sequence databases. After introducing methods for aligning multiple biological sequences and genomes, the text explores applications of the phylogenetic tree, methods for comparing phylogenetic trees, the problem of genome rearrangement, and the problem of motif finding. It also covers methods for predicting the secondary structure of RNA and for reconstructing the peptide sequence using mass spectrometry. The final chapter examines the computational problem related to population genetics.

Advances in sequencing technology have allowed scientists to study the human genome in greater depth and on a larger scale than ever before - as many as hundreds of millions of short reads in the course of a few days. But what are the best ways to deal with this flood of data? Algorithms for Next-Generation Sequencing is an invaluable tool for students and researchers in bioinformatics and computational biology, biologists seeking to process and manage the data generated by next-generation sequencing, and as a textbook or a self-study resource. In addition to offering an in-depth description of the algorithms for processing sequencing data, it also presents useful case studies describing the applications of this technology.

This book constitutes the refereed post-conference proceedings of the 29th International Workshop on Combinatorial Algorithms, IWOCA 2018, held in Singapore, Singapore, in July 2018. The 31 regular papers presented in this volume were carefully reviewed and selected from 69 submissions. They cover diverse areas of combinatorical algorithms, complexity theory, graph theory and combinatorics, combinatorial optimization, cryptography and information security, algorithms on strings and graphs, graph drawing and labelling, computational algebra and geometry, computational biology, probabilistic and randomised algorithms, algorithms for big data analytics, and new paradigms of computation.

This book constitutes the proceedings of the 12th International Workshop on Algorithms and Computation, WALCOM 2018, held in Dhaka, Bangladesh, in March 2018. The 22 full papers presented were carefully reviewed and selected from 50 submissions. The papers cover diverse areas of algorithms and computation, such as approximation algorithms, computational geometry, combinatorial algorithms, computational biology, computational complexity, data structures, graph and network algorithms, and online algorithms.

This book constitutes the refereed proceedings of the 14th International Conference on Algorithms and Computation, WALCOM 2020, held in Singapore in March/April 2020. The 23 full and 4 short papers presented were carefully reviewed and selected from 66 submissions. The papers focus on algorithmic graph theory and combinatorics, computational biology, computational geometry, data structures, experimental algorithm methodologies, graph algorithms, graph drawing, parallel and distributed algorithms, network optimization.