Welcome to our book review site go-pdf.online!

You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.

Sign up

Combinatorics of Genome Rearrangements
  • Language: en
  • Pages: 305

Combinatorics of Genome Rearrangements

  • Type: Book
  • -
  • Published: 2009
  • -
  • Publisher: MIT Press

A comprehensive survey of a rapidly expanding field of combinatorial optimization, mathematically oriented but offering biological explanations when required. From one cell to another, from one individual to another, and from one species to another, the content of DNA molecules is often similar. The organization of these molecules, however, differs dramatically, and the mutations that affect this organization are known as genome rearrangements. Combinatorial methods are used to reconstruct putative rearrangement scenarios in order to explain the evolutionary history of a set of species, often formalizing the evolutionary events that can explain the multiple combinations of observed genomes a...

SOFSEM '98: Theory and Practice of Informatics
  • Language: en
  • Pages: 460

SOFSEM '98: Theory and Practice of Informatics

  • Type: Book
  • -
  • Published: 2003-06-29
  • -
  • Publisher: Springer

This book constitutes the proceedings of the 25th Seminar on Current Trends in Theory and Practice of Informatics, SOFSEM'98, held in Jasna, Slovakia, in November 1998. The volume presents 19 invited survey articles by internationally well-known authorities together with 18 revised full research papers carefully reviewed and selected for inclusion in the book. The areas covered include history of models of computation, algorithms, formal methods, practical aspects of software engineering, database systems, parallel and distributed systems, electronic commerce, and electronic documents and digital libraries.

SOFSEM 2004: Theory and Practice of Computer Science
  • Language: en
  • Pages: 398

SOFSEM 2004: Theory and Practice of Computer Science

This book constitutes the refereed proceedings of the 30th Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2004, held in Merín, Czech Republic, in January 2004. The volume presents 10 invited lectures and 22 full papers selected from 136 submissions. Among the topics covered are computer science theory, programming theory, database systems, information systems, cognitive technologies and Web technologies.

SOFSEM 2013: Theory and Practice of Computer Science
  • Language: en
  • Pages: 579

SOFSEM 2013: Theory and Practice of Computer Science

  • Type: Book
  • -
  • Published: 2013-01-12
  • -
  • Publisher: Springer

This book constitutes the refereed proceedings of the 39th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2013, held in Špindlerův Mlýn, Czech Republic, in January 2013. The 37 revised full papers presented in this volume were carefully reviewed and selected from 98 submissions. The book also contains 10 invited talks, 5 of which are in full-paper length. The contributions are organized in topical sections named: foundations of computer science; software and Web engineering; data, information, and knowledge engineering; and social computing and human factors.

Algorithms and Complexity
  • Language: en
  • Pages: 1014

Algorithms and Complexity

  • Type: Book
  • -
  • Published: 1990-09-12
  • -
  • Publisher: Elsevier

This first part presents chapters on models of computation, complexity theory, data structures, and efficient computation in many recognized sub-disciplines of Theoretical Computer Science.

A Survey of Combinatorial Theory
  • Language: en
  • Pages: 476

A Survey of Combinatorial Theory

  • Type: Book
  • -
  • Published: 2014-05-12
  • -
  • Publisher: Elsevier

A Survey of Combinatorial Theory covers the papers presented at the International Symposium on Combinatorial Mathematics and its Applications, held at Colorado State University (CSU), Fort Collins, Colorado on September 9-11, 1971. The book focuses on the principles, operations, and approaches involved in combinatorial theory, including the Bose-Nelson sorting problem, Golay code, and Galois geometries. The selection first ponders on classical and modern topics in finite geometrical structures; balanced hypergraphs and applications to graph theory; and strongly regular graph derived from the perfect ternary Golay code. Discussions focus on perfect ternary Golay code, finite projective and af...

Mathematical Foundations of Computer Science 1986
  • Language: en
  • Pages: 810
SOFSEM 2012: Theory and Practice of Computer Science
  • Language: en
  • Pages: 690

SOFSEM 2012: Theory and Practice of Computer Science

This book constitutes the refereed proceedings of the 38th Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2012, held in Špindlerův Mlýn, Czech Republic, in January 2012. The 43 revised papers presented in this volume were carefully reviewed and selected from 121 submissions. The book also contains 11 invited talks, 10 of which are in full-paper length. The contributions are organized in topical sections named: foundations of computer science; software and Web engineering; cryptography, security, and verification; and artificial intelligence.

SOFSEM 2012: Theory and Practice of Computer Science
  • Language: en
  • Pages: 674

SOFSEM 2012: Theory and Practice of Computer Science

  • Type: Book
  • -
  • Published: 2012-01-18
  • -
  • Publisher: Springer

This book constitutes the refereed proceedings of the 38th Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2012, held in Špindlerův Mlýn, Czech Republic, in January 2012. The 43 revised papers presented in this volume were carefully reviewed and selected from 121 submissions. The book also contains 11 invited talks, 10 of which are in full-paper length. The contributions are organized in topical sections named: foundations of computer science; software and Web engineering; cryptography, security, and verification; and artificial intelligence.

Handbook of Combinatorics Volume 1
  • Language: en
  • Pages: 1124

Handbook of Combinatorics Volume 1

  • Type: Book
  • -
  • Published: 1995-12-11
  • -
  • Publisher: Elsevier

Handbook of Combinatorics, Volume 1 focuses on basic methods, paradigms, results, issues, and trends across the broad spectrum of combinatorics. The selection first elaborates on the basic graph theory, connectivity and network flows, and matchings and extensions. Discussions focus on stable sets and claw free graphs, nonbipartite matching, multicommodity flows and disjoint paths, minimum cost circulations and flows, special proof techniques for paths and circuits, and Hamilton paths and circuits in digraphs. The manuscript then examines coloring, stable sets, and perfect graphs and embeddings and minors. The book takes a look at random graphs, hypergraphs, partially ordered sets, and matroids. Topics include geometric lattices, structural properties, linear extensions and correlation, dimension and posets of bounded degree, hypergraphs and set systems, stability, transversals, and matchings, and phase transition. The manuscript also reviews the combinatorial number theory, point lattices, convex polytopes and related complexes, and extremal problems in combinatorial geometry. The selection is a valuable reference for researchers interested in combinatorics.