6

Exploring Life: Answer Set Programming in Bioinformatics

This chapter provides a broad overview of howlogic programming, and more specifically Answer Set Programming (ASP), can be used to model and solve some popular and challenging classes of problems in the general domain of bioinformatics. In …

Loose Graph Simulations

We introduce loose graph simulations (LGS), a new notion about labelled graphs which subsumes in an intuitive and natural way subgraph isomorphism (SGI), regular language pattern matching (RLPM) and graph simulation (GS). Being a unification of all …

Parallel Answer Set Programming

Answer Set Programming (ASP) has become, in recent years, the paradigm of choice for the logic programming community and for a wide variety of application domains. Thanks to its declarative nature, ASP offers excellent opportunities for performance …

Reasoning on Relations, Modalities, and Sets

Preface

Banishing Ultrafilters from Our Consciousness

CNV and structural variation in plants prospects of NGS approaches

Deletion, insertion, and duplications larger than 1 kb are structural variants (SVs) classified as copy number variants (CNVs). Beside single nucleotide variants (SNVs), CNVs are widespread in plants and substantially contribute to intra-species …

Foreword [to Constraint Solving and Planning with Picat]

Hierarchical Assembly of Pools

This study introduces a method to address the problem of building a draft de novo assembly of complex genomes when a collection of well-assembled long-insert pools is available. Sequencing and assembling a collection of such pools reduces the …

Algorithms and Data Structures for Next Generation Sequences