You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
The Asian Computing Science Conference (ASIAN) series was initiated in 1995 to provide a forum for researchers in computer science in Asia to meet and to promote interaction with researchers from other regions. The previous ?ve conferences were held, respectively, in Bangkok, Singapore, Kathmandu, Manila, and Phuket. The proceedings were published in the Lecture Notes in Computer Science Series of Springer-Verlag. This year’s conference (ASIAN2000) attracted 61 submissions from which 18 papers were selected through an electronic program committee (PC) meeting. The themes for this year’s conference are: – Logics in Computer Science – Data Mining – Networks and Performance The key no...
The advent of genome sequencing and associated technologies has transformed biologists' ability to measure important classes of molecules and their interactions. This expanded cellular view has opened the field to thousands of interactions that previously were outside the researchers' reach. The processing and interpretation of these new vast quantities of interconnected data call for sophisticated mathematical models and computational methods. Systems biology meets this need by combining genomic knowledge with theoretical, experimental and computational approaches from a number of traditional scientific disciplines to create a mechanistic explanation of cellular systems and processes. Syste...
The two-volume set LNCS 14461 and LNCS 14462 constitutes the refereed proceedings of the 17th International Conference on Combinatorial Optimization and Applications, COCOA 2023, held in Hawaii, HI, USA, during December 15–17, 2023. The 73 full papers included in the proceedings were carefully reviewed and selected from 117 submissions. They were organized in topical sections as follows: Part I: Optimization in graphs; scheduling; set-related optimization; applied optimization and algorithm; Graph planer and others; Part II: Modeling and algorithms; complexity and approximation; combinatorics and computing; optimization and algorithms; extreme graph and others; machine learning, blockchain and others.
Guided by standard bioscience workflows in high-throughput sequencing analysis, this book for graduate students, researchers, and professionals in bioinformatics and computer science offers a unified presentation of genome-scale algorithms. This new edition covers the use of minimizers and other advanced data structures in pangenomics approaches.
This book constitutes the refereed proceedings of the 17th Annual Symposium on Combinatorial Pattern Matching, CPM 2006, held in Barcelona, Spain in July 2006. The 33 revised full papers presented together with 3 invited talks were carefully reviewed and selected from 88 submissions. The papers are organized in topical sections on data structures, indexing data structures, probabilistic and algebraic techniques, applications in molecular biology, string matching, data compression, and dynamic programming.
This book constitutes the refereed proceedings of the 25th International Symposium on Algorithms and Computation, ISAAC 2014, held in Jeonju, Korea, in December 2014. The 60 revised full papers presented together with 2 invited talks were carefully reviewed and selected from 171 submissions for inclusion in the book. The focus of the volume in on the following topics: computational geometry, combinatorial optimization, graph algorithms: enumeration, matching and assignment, data structures and algorithms, fixed-parameter tractable algorithms, scheduling algorithms, computational complexity, computational complexity, approximation algorithms, graph theory and algorithms, online and approximation algorithms, and network and scheduling algorithms.
This book constitutes the refereed proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching, CPM 2000, held in Montreal, Canada, in June 2000.The 29 revised full papers presented together with 3 invited contributions and 2 tutorial lectures were carefully reviewed and selected from 44 submissions. The papers are devoted to current theoretical and algorithmic issues of searching and matching strings and more complicated patterns such as trees, regular expression graphs, point sets and arrays as well as to advanced applications of CPM in areas such as Internet, computational biology, multimedia systems, information retrieval, data compression, and pattern recognition.
This book constitutes the refereed proceedings of the 15th Annual Symposium on Combinatorial Pattern Matching, CPM 2004, held in Istanbul, Turkey in July 2004. The 36 revised full papers presented were carefully reviewed and selected from 79 submissions. The papers are devoted to current theoretical and computational aspects of searching and matching of strings and more complicate patterns, such as trees, regular expressions, graphs, point sets, and arrays. Among the application fields addressed are computational biology, bioinformatics, genomics, proteinomics, the web, data compression, coding, multimedia, information retrieval, data analysis, pattern recognition, and computer vision.