All Stories

  1. Co-lexicographically Ordering Automata and Regular Languages - Part I
  2. Towards a Logic Programming Tool for Cancer Data Analysis
  3. On the impact of discreteness and abstractions on modelling noise in gene regulatory networks
  4. Set-syllogistics meet combinatorics
  5. Hierarchical Assembly of Pools
  6. Average Linear Time and Compressed Space Construction of the Burrows-Wheeler Transform
  7. A Parallel Algorithm for the Best k-Mismatches Alignment Problem
  8. Hashing and Indexing: Succinct DataStructures and Smoothed Analysis
  9. Algorithms and Data Structures for Next-Generation Sequences
  10. Rank and simulation: the well-founded case
  11. Well-quasi-ordering hereditarily finite sets
  12. GAM-NGS: genomic assemblies merger for next generation sequencing
  13. The high-quality draft genome of peach (Prunus persica) identifies unique patterns of genetic diversity, domestication and genome evolution
  14. A randomized Numerical Aligner (rNA)
  15. Biological Networks on (a Lattice of) Hybrid Automata
  16. The Bernays-Schönfinkel-Ramsey class for set theory: decidability
  17. GapFiller: a de novo assembly approach to fill the gap within paired reads
  18. A Multi-objective Optimisation Approach to the Design of Experiment in De Novo Assembly Projects
  19. Studying cancer-cell populations by programmable models of networks
  20. GAM: Genomic Assemblies Merger
  21. Identification, reconstruction and validation of insertions in resequencing projects with GapFiller
  22. COST Action BM 1006 (SeqAhead): MC BUSINESS MEETING AND SCIENTIFIC MEETING
  23. ERNE-BS5
  24. rNA: a fast and accurate short reads numerical aligner
  25. mrNA: The MPI Randomized Numerical Aligner
  26. Programmable models of growth and mutation of cancer-cell populations
  27. Infinity, in short
  28. e-RGA: enhanced Reference Guided Assembly of Complex Genomes
  29. Counting extensional acyclic digraphs
  30. Well-Quasi-Ordering Hereditarily Finite Sets
  31. Enhanced reference guided assembly
  32. The SSR-based molecular profile of 1005 grapevine (Vitis vinifera L.) accessions uncovers new synonymy and parentages, and reveals a large admixture amongst varieties of different geographic origin
  33. The Bernays-Schönfinkel-Ramsey class for set theory: semidecidability
  34. Hybrid dynamics of stochastic programs
  35. A Randomized Numerical Aligner (rNA)
  36. Physical mapping in highly heterozygous genomes: a physical contig map of the Pinot Noir grapevine cultivar
  37. Correction: High throughput approaches reveal splicing of primary microRNA transcripts and tissue specific expression of mature microRNAs in Vitis vinifera
  38. GAM: Genomic Assemblies Merger: A Graph Based Method to Integrate Different Assemblies
  39. Hybrid Semantics of Stochastic Programs with Dynamic Reconfiguration
  40. Discrete Semantics for Hybrid Automata
  41. Automated FingerPrint Background removal: FPB
  42. Hybrid Dynamics of Stochastic π-Calculus
  43. The Importance of Being (A Little Bit) Discrete
  44. Stochastic Programs and Hybrid Automata for (Biological) Modeling
  45. High throughput approaches reveal splicing of primary microRNA transcripts and tissue specific expression of mature microRNAs in Vitis vinifera
  46. Dynamical Systems and Stochastic Programming: To Ordinary Differential Equations and Back
  47. Inclusion dynamics hybrid automata
  48. Modeling Biological Systems in Stochastic Concurrent Constraint Programming
  49. Discreteness, hybrid automata, and biology
  50. Systems Biology: Models and Logics
  51. A Complete Axiomatic System for a Process-Based Spatial Logic
  52. Symbolic Graphs: Linear Solutions to Connectivity Related Problems
  53. Constraint-Based Simulation of Biological Systems Described by Molecular Interaction Maps
  54. Stochastic Concurrent Constraint Programming and Differential Equations
  55. The grapevine genome sequence suggests ancestral hexaploidization in major angiosperm phyla
  56. MOTIF DISCOVERY FIXING MISMATCH POSITIONS
  57. Foreword
  58. A Computerized Referee
  59. Structured Motifs Search
  60. The axiom of elementary sets on the edge of Peircean expressibility
  61. An Algorithmic Account of Ehrenfeucht Games on Labeled Successor Structures
  62. Ackermann encoding, bisimulations and OBDDs
  63. Three-variable statements of set-pairing
  64. An efficient algorithm for computing bisimulation equivalence
  65. Structured motifs search
  66. AppART: a Hybrid Neural Network Based on Adaptive Resonance Theory for Universal Function Approximation
  67. Rasiowa-Sikorski Style Relational Elementary Set Theory
  68. A Sense of Life: Computational and Experimental Investigations with Models of Biochemical and Evolutionary Processes
  69. Binary Extensions of S1S and the Composition Method
  70. Biconnectivity on Symbolically Represented Graphs: A Linear Solution
  71. Model Building and Model Checking for Biochemical Processes
  72. Modeling Cellular Behavior with Hybrid Automata: Bisimulation and Collapsing
  73. Set Theory for Computing: From Decision Procedures to Declarative Programming with Sets by Domenico Cantone, Eugenio Omodeo and Alberto Policriti, Springer-Verlag, 2001. Hardback: ISBN 0-387-95197-0, $24.50/$69.95, xviii+409 pages.
  74. AppART: An ART Hybrid Stable Learning Neural Network for Universal Function Approximation
  75. Simulation as Coarsest Partition Problem
  76. XS-systems: eXtended S-Systems and Algebraic Differential Automata for Modeling Cellular Behavior
  77. Modeling Concurrent systems specified in a Temporal Concurrent Constraint language-I
  78. A Fast Bisimulation Algorithm
  79. Set Theory for Computing
  80. Quantitative Set Reasoning
  81. (*) A Syllogistic Solitaire
  82. Syllogistic Tableaux
  83. Stratified Syllogistics
  84. Logical Background
  85. Set Theory for Nonclassic Logics
  86. Logic Programming with Sets
  87. Axiomatic Views of Aggregates
  88. Decision Problems and Some Solutions
  89. Inference Techniques and Methods
  90. Sets for Problem Solving
  91. Semantic Views of Aggregates
  92. What Is Computable Set Theory?
  93. Set/Hyperset Unification Algorithms
  94. Comparing Expressiveness of Set Constructor Symbols
  95. Decidable Theories of ω-Layered Metric Temporal Structures
  96. Derivability in Locally Quantified Modal Logics via Translation in Set Theory
  97. Towards Tableau-Based Decision Procedures for Non-Well-Founded Fragments of Set Theory
  98. Solvable Set/Hyperset Contexts: II. A Goal-Driven Unification Algorithm for the Blended Case
  99. Øhrstrøm Peter and Hasle Per F. V.. Temporal logic. From ancient ideas to artificial intelligence. Studies in linguistics and philosophy, vol. 57. Kluwer Academic Publishers, Dordrecht, Boston, and London, 1995, viii + 413 pp.
  100. Complementation in the lattice of equivalence relations
  101. Decidability Results for Metric and Layered Temporal Logics
  102. Integrating Lists, Multisets, and Sets in a Logic Programming Framework
  103. Decidability of ∀*∀-Sentences in Membership Theories
  104. T-Theorem Proving I
  105. A set-theoretic translation method for (poly)modal logics
  106. Solvable set/hyperset contexts: I. Some decision procedures for the pure, finite case
  107. A set-theoretic translation method for polymodal logics
  108. A derived algorithm for evaluating ɛ-expressions over abstract sets
  109. THE DECISION PROBLEM FOR RESTRICTED UNIVERSAL QUANTIFICATION IN SET THEORY AND THE AXIOM OF FOUNDATION
  110. Expressing infinity without foundation
  111. Decision procedures for elementary sublanguages of set theory: XIII. Model graphs, reflection and decidability
  112. Note on "The Logically Simplest Form of the Infinity Axiom"
  113. Note on: ‘‘The logically simplest form of the infinity axiom” [Proc.\ Amer.\ Math.\ Soc.\ {\bf 103} (1988), no.\ 1, 274–276; MR0938682 (89h:03086)]
  114. Set-theoretic reductions of Hilbert's tenth problem
  115. The Logically Simplest Form of the Infinity Axiom
  116. Decision procedures for elementary sublanguages of set theory IX. Unsolvability of the decision problem for a restricted subclass of the Δ0-formulas in set theory
  117. The logically simplest form of the infinity axiom
  118. IEEE Trans. Profess. Commun.
  119. Hybrid Semantics for Stochastic π-Calculus
  120. Hybrid Systems and Biology
  121. Decision procedures for set/hyperset contexts