Background The process of generating raw genome sequence data continues to become
cheaper, faster, and more accurate. However, assembly of such data into high-quality, finished …

In this paper, we describe the method of finite state machine (FSM) induction using genetic
algorithm with fitness function, cross-over and mutation based on testing and model checking…

In the paper we describe the extended finite-state machine (EFSM) induction method which
uses SAT-solver. Input data for the induction algorithm is a set of test scenarios. The …

This report describes the application of potentiometric multisensor system for estimation of
water samples toxicity in terms of Microtox ® analyzer—a widespread instrument for toxicity …

Bruijn Superwalk with Multiplicities Problem is the problem of finding a walk in the de Bruijn
graph containing several walks as subwalks and passing through each edge the exactly …

Finite automata system for the complex behavior objects control is described in the paper. It
consists of top-level finite automaton used for switching between control modes and low-…

In this paper, we describe a genetic algorithm for induction of finite automata with continuous
and discrete output actions. Input data for the algorithm is a set of tests. Each test consists …

In this paper we consider the problem of extended finite-state machines induction. The input
data for this problem is a set of tests. Each test consists of two sequences - an input …

The technology of modeling of one class of multi-agent systems with automata based
programming is proposed in the paper. The technology is illustrated on the example of system of …

The paired de Bruijn graph is an extension of de Bruijn graph incorporating mate pair information
for genome assembly proposed by Mevdedev et al. However, unlike in an ordinary de …