In this study two actual types of problems are considered and solved: 1) determining the maximum common connected fragment of the T-tree (T-directed tree) which does not change with time; 2) determining all maximum common connected fragments of the T-tree (T-directed tree) which do not change with time. The choice of the primary study of temporal directed trees and trees is justified by the wid...

The Maximum Common Subgraph problem has been long proven NP-hard. Nevertheless, it countless practical applications, and researchers are still searching for exact solutions scalable heuristic approaches. Driven by applications in molecular science cyber-security, we concentrate on the among an indefinite number of graphs. We first extend a state-of-the-art branch-and-bound procedure working two...

Empty p0 p2 . . . pξ pξ+2 . . . Nonempty p1 p3 . . . pξ+1 pξ+3 . . . where pξ, ξ < α, is descending in P and Nonempty wins the game of length α if he can play α times. A poset P is called weakly α-game-closed if Player Nonempty has a winning strategy in the Banach-Mazur game of length α, where Nonempty is allowed to play at limit stages. P is called strongly α-game-closed if Player Nonempty has...

The effect of Triton X-100, Na cholate and Tween 80 on the solubilization of integral membrane proteins in intact cells, spheroplasts and inner-membrane fragments of Salmonella typhimurium was studied. The detergents were used in various concentrations (1.6 to 64 mM) and cytochromes b and d were used as marker to monitor the solubilization of membrane-bound proteins. Results showed that no inne...

the effect of triton x-100, na cholate and tween 80 on the solubilization of integral membrane proteins in intact cells, spheroplasts and inner-membrane fragments of salmonella typhimurium was studied. the detergents were used in various concentrations (1.6 to 64 mm) and cytochromes b and d were used as marker to monitor the solubilization of membrane-bound proteins. results showed that no inne...

Amplified fragment length polymorphism (AFLP) markers with a total of 256 EcoRI + ANN - MseI + CNN primer combinations were investigated employing the common wheat cultivar Triticum aestivum 'Chinese Spring.' On average, 103 fragments per primer combination were amplified, ranging from a maximum of 226 fragments to a minimum of 18 fragments. The primer combinations E + AAA - M + CNN and E + ATT...

Reassembly of fragmented objects from a collection of randomly mixed fragments is a common problem in classical forensics. In this paper we address the digital forensic equivalent, i.e., reassembly of document fragments, using statistical modelling tools applied in data compression. We propose a general process model for automatically analyzing a collection fragments to reconstruct the original...

Reassembly of fragmented objects from a collection of randomly mixed fragments is a common problem in classical forensics. In this paper we address the digital forensic equivalent, i.e., reassembly of document fragments, using statistical modelling tools applied in data compression. We propose a general process model for automatically analyzing a collection fragments to reconstruct the original...