MiticCreature / Dynamic-Block-Allocation-algorithm

The Dynamic Block Allocation algorithm (DBA) represents a flexible method for partitioning string sequences into data blocks taking into account different rules imposed by a function. Two versions of this algorithm are presented, namely DBFA (Double Brute Force Algorithm) and MBFA (Multi Brute Force Algorithm).

Geek Repo:Geek Repo

Github PK Tool:Github PK Tool

Dynamic Block Allocation (DBA) algorithm

Dynamic Block Allocation Algorithm [Double Brute Force (DBFA) and Multi Brute Force (MBFA)]. The Dynamic Block Allocation (DBA) algorithm represents a flexible method for partitioning string sequences into data blocks taking into account different rules imposed by a function. Two versions of this algorithm are presented, namely DBFA (Double Brute Force Algorithm) and MBFA (Multi Brute Force Algorithm). These algorithms are originally written in Visual Basic 6.0. The ZIP package contains four applications. These applications cover both the experiments performed with this algorithm and a small implementation.

Screenshot

screenshot

screenshot

References

  • P. Gagniuc and C Ionescu-Tirgoviste. Dynamic block allocation for biological sequences. Proc. Rom. Acad., Series B, 2013, 15(3), p. 233-240.

About

The Dynamic Block Allocation algorithm (DBA) represents a flexible method for partitioning string sequences into data blocks taking into account different rules imposed by a function. Two versions of this algorithm are presented, namely DBFA (Double Brute Force Algorithm) and MBFA (Multi Brute Force Algorithm).

License:MIT License


Languages

Language:Visual Basic 6.0 93.4%Language:BASIC 6.6%