Combinatorial Pattern Matching Algorithms in Computational Biology Using Perl and R, Valiente

Автор: Korte, Bernhard, Vygen, Jens
Название: Combinatorial Optimization (algorithms and Combinatorics 21) 5th ed.
ISBN: 3642244874 ISBN-13(EAN): 9783642244872
Издательство: Springer
Рейтинг:
Цена: 60510.00 T
Наличие на складе: Невозможна поставка.
Описание: This comprehensive textbook on combinatorial optimization places special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. It is based on numerous courses on combinatorial optimization and specialized topics, mostly at graduate level. This book reviews the fundamentals, covers the classical topics (paths, flows, matching, matroids, NP-completeness, approximation algorithms) in detail, and proceeds to advanced and recent topics, some of which have not appeared in a textbook before. Throughout, it contains complete but concise proofs, and also provides numerous exercises and references. This fifth edition has again been updated, revised, and significantly extended, with more than 60 new exercises and new material on various topics, including Cayley's formula, blocking flows, faster b-matching separation, multidimensional knapsack, multicommodity max-flow min-cut ratio, and sparsest cut. Thus, this book represents the state of the art of combinatorial optimization.

Автор: Alberto Apostolico; Maxime Crochemore; Zvi Galil;
Название: Combinatorial Pattern Matching
ISBN: 3540560246 ISBN-13(EAN): 9783540560241
Издательство: Springer
Рейтинг:
Цена: 43780.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Combinatorial pattern matching is a field dealing with the searching and matching of strings and other, more complicated patterns such as trees, regular expressions and extended expressions. This volume contains a series of papers presented at a symposium on the subject.

Автор: Maxime Crochemore; Dan Gusfield
Название: Combinatorial Pattern Matching
ISBN: 3540580948 ISBN-13(EAN): 9783540580942
Издательство: Springer
Рейтинг:
Цена: 55890.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: The goal of this conference was to derive combinatorial properties for complicated patterns and structures, and then to exploit these properties in order to achieve superior performance for corresponding computational problems.

Автор: Dan Hirschberg; Gene Meyers
Название: Combinatorial Pattern Matching
ISBN: 3540612580 ISBN-13(EAN): 9783540612582
Издательство: Springer
Рейтинг:
Цена: 74530.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Comprising 26 papers presented at the 7th Annual Symposium on Combinatorial Pattern Matching (CPM), this work examines the importance of CPM, an area of algorithmics, in information retrieval, pattern recognition, compiling, data compression, program analysis, and molecular biology.

Автор: Dechang Chen; Xiuzhen Cheng
Название: Pattern Recognition and String Matching
ISBN: 1402009534 ISBN-13(EAN): 9781402009532
Издательство: Springer
Рейтинг:
Цена: 231990.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Presents a collection of 28 articles contributed by experts of pattern recognition, string matching, or both. This book contains fundamental concepts and notations, as well as reports on research with respect to both methodology and applications. It also includes string matching related techniques for structural pattern recognition.

Автор: Dechang Chen; Xiuzhen Cheng
Название: Pattern Recognition and String Matching
ISBN: 1461379520 ISBN-13(EAN): 9781461379522
Издательство: Springer
Рейтинг:
Цена: 163040.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: The research and development of pattern recognition have proven to be of importance in science, technology, and human activity. The aim, intent, and motivation for publishing this book is to pro- vide a reference tool for the increasing number of readers who depend upon pattern recognition or string matching in some way.

Автор: Christian Reidys
Название: Combinatorial Computational Biology of RNA
ISBN: 1489981470 ISBN-13(EAN): 9781489981479
Издательство: Springer
Рейтинг:
Цена: 97820.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book brings together the author`s research in the study of RNA structures, presenting new combinatorics and combinatorial structures which enhance both mathematics and biology. The author produces pseudo knotted structures, providing an alternative approach.

Автор: Goldberg
Название: Efficient Algorithms for Listing Combinatorial Structures
ISBN: 0521450217 ISBN-13(EAN): 9780521450218
Издательство: Cambridge Academ
Рейтинг:
Цена: 116160.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: First published in 1993, this thesis is concerned with the design of efficient algorithms for listing combinatorial structures. Some related work is also included which compares the listing problem with the difficulty of solving the existence problem, the construction problem, the random sampling problem, and the counting problem.

Автор: Zsuzsanna Lipt?k; William F. Smyth
Название: Combinatorial Algorithms
ISBN: 3319295152 ISBN-13(EAN): 9783319295152
Издательство: Springer
Рейтинг:
Цена: 52170.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book constitutes the thoroughly refereedpost-workshop proceedings for the 26 International Workshop on combinatorialAlgorithms, IWOCA 2015, held in Verona, Italy, in October 2015. The 29 revised full papers presented were carefullyreviewed and selected from a total of 90 submissions.

Автор: Herbert S. Wilf
Название: Combinatorial Algorithms: An Update
ISBN: 0898712319 ISBN-13(EAN): 9780898712315
Издательство: Mare Nostrum (Eurospan)
Рейтинг:
Цена: 39290.00 T
Наличие на складе: Невозможна поставка.
Описание: Surveys some of the work that has been done since the appearance of the second edition of this book. Topics include progress in: Gray Codes, listing of subsets of given size of a given universe, listing rooted and free trees, selecting free trees and unlabeled graphs uniformly at random, and ranking and unranking problems on unlabeled trees.

Автор: Iliopoulos
Название: Combinatorial Algorithms
ISBN: 3319946668 ISBN-13(EAN): 9783319946665
Издательство: Springer
Рейтинг:
Цена: 46570.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание:

Some Recent New Directions in Multivariate Algorithmics.- Survey of some recent near polynomial time results for Parity Games.- Range Minimum Queries and Applications.- Collision-free Routing Problem with Restricted L-path.- Linear clique-width of bi-complement reducible graphs.- Linear Ramsey numbers.- Graphs that are Not Pairwise Compatible: A New Proof Technique Efficient Unbounded Fault-Tolerant Aggregate Signatures Using Nested Cover-Free Families.- Minimum Polygons for Fixed Visibility VC-Dimension.- Minsum k-Sink Problem on Dynamic Flow Path Networks.- Fully leafed induced subtrees.- Pattern matching for k--track permutations.- Approximation algorithms for the p-hub center routing problem in parameterized metric graphs.- On the Area Requirements of Straight-Line Orthogonal Drawings of A Fixed-Parameter Algorithm for the Max-Cut Problem on Embedded 1-Planar Graphs.- Covering with Clubs: Complexity and Approximability.- On the Expected Number of Distinct Gapped Palindromic Factors.- Computational Complexity of Robot Arm Simulation Problems.- Evaluation of Tie-breaking and Parameter ordering for the IPO Family of Algorithms used in Covering Array Generation.- Efficient Enumeration of Subgraphs and Induced Subgraphs with Bounded Girth.- An Optimal Algorithm for Online Prize-collecting Node-weighted Median of 3 Permutations, 3-Cycles and 3-Hitting Set Problem.- Structural Parameterizations for Colorful Components.- Analysis of Information Leakage due to Operative Errors in Card-based Protocols.- Zero-Suppression and Computation Models.- The Crossing Number of Seq-Shellable Drawings of Complete Graphs.- Cryptographic limitations on polynomial-time a posteriori query learning.- Placing Segments On Parallel Arcs.- Branch-and-bound algorithm for Symmetric Travelling Salesman Problem.- LZ-ABT: A Practical Algorithm for nalpha-Balanced Grammar Compression.- Faster Coreset Construction for Projective Clustering via Low-Rank Approximation.- Separating Interaction Effects Using Locating and Detecting Arrays.- An Efficient Representation of Partitions of Integers.- How far from a worst solution a random solution of a k-CSP instance can be?.

Автор: Martin Gr?tschel; Laszlo Lovasz; Alexander Schrijv
Название: Geometric Algorithms and Combinatorial Optimization
ISBN: 3642782426 ISBN-13(EAN): 9783642782428
Издательство: Springer
Рейтинг:
Цена: 121110.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Moreover, despite the success of the interior point methods for the solution of explicitly given linear programs there is still no method known that solves implicitly given linear programs, such as those described in this book, and that is both practically and theoretically efficient.