The present study introduces a novel, simple, and effective distance-based method for estimation of the applicability domain AD in case of developed and validated predictive counter-propagation artificial neural network (CP ANN) models through a proficient exploitation of the Euclidean distance (ED) metric in the structure-representation vector space. The performance of the method was evaluated and explained in a case study by using a pre-built and validated CP ANN model for prediction of the transport activity of the transmembrane protein bilitranslocase. The method was tested on two more datasets in order to confirm its performance for evaluation of the AD in CP ANN models. A comparative AD assessment using the leverage approach was performed.
COBISS.SI-ID: 5132058
A classical protein sequence alignment and homology modeling strategy were used for building three Mycobacterium tuberculosis-DNA gyrase protein models using the available topoII-DNA-6FQ crystal structure complexes originating from different organisms. The recently determined M. tuberculosis-DNA gyrase apoprotein structures and topoII-DNA-6FQ complexes were used for defining the 6-fluoroquinolones (6-FQs) binding pockets. The quality of the generated models was initially validated by docking of the cocrystallized ligands into their binding site, and subsequently by quantitative evaluation of their discriminatory performances (identification of active/inactive 6-FQs) for a set of 145 6-FQs with known biological activity values. The M. tuberculosis-DNA gyrase model with the highest estimated discriminatory power was selected and used afterwards in an additional molecular docking experimenton a mixed combinatorial set of 427 drug-like 6-FQ analogs for which the biological activity values were predicted using a prebuilt counter-propagation artificial neural network model. A novel three-level Boolean-based [T/F (true/false)] clustering algorithm was used to assess the generated binding poses: Level 1 (geometry properties assessment), Level 2 (score-based clustering and selection of the (T)-signed highly scored Level 1 poses), and Level 3 (activity-based clustering and selection of the most ĆactiveĆ (T)-signed Level 2 hits). The frequency analysis of occurrence of the fragments attached at R1 and R7 position of the (T)-signed 6-FQs selected in Level 3 revealed several novel attractive fragments and confirmed some previous findings. We believe that this methodology could be successfully usedin establishing novel possible structure-activity relationship recommendations in the 6-FQs optimization, which could be of great importance in the current antimycobacterial hit-to-lead processes.
COBISS.SI-ID: 5145626
For acyclic systems the center of a graph has been known to be either a single vertex of two adjacent vertices, that is, an edge. It has not been quite clear how to extend the concept of graph center to polycyclic systems. Several approaches to the graph center of molecular graphs of polycyclic graphs have been proposed in the literature. In most cases alternative approaches, however, while being apparently equally plausible, gave the same results for many molecules, but occasionally they differ in their characterization of molecular center. In order to reduce the number of vertices that would qualify as forming the center of the graph, a hierarchy of rules have been considered in the search for graph centers. We reconsidered the problem of “the center of a graph” by using a novel concept of graph theory, the vertex “weights,” defined by counting the number of pairs of vertices at the same distance from the vertex considered. This approach gives often the same results for graph centers of acyclic graphs as the standard definition of graph center based on vertex eccentricities. However, in some cases when two nonequivalent vertices have been found as graph center, the novel approach can discriminate between the two. The same approach applies to cyclic graphs without additional rules to locate the vertex or vertices forming the center of polycyclic graphs, vertices referred to as central vertices of a graph. In addition, the novel vertex “weights,” in the case of acyclic, cyclic, and polycyclic graphs can be interpreted as vertex centralities, a measure for how close or distant vertices are from the center or central vertices of the graph. Besides illustrating the centralities of a number of smaller polycyclic graphs, we also report on several acyclic graphs showing the same centrality values of their vertices.
COBISS.SI-ID: 5383962
We present a novel matrix representation of graphs based on the count of equal-distance common vertices to each pair of vertices in a graph. The element (i, j) of this matrix is defined as the number of vertices at the same distance from vertices (i, j). As illustrated on smaller alkanes, these novel matrices are very sensitive to molecular branching and the distribution of vertices in a graph. In particular, we show that ordered row sums of these novel matrices can facilitate solving graph isomorphism for acyclic graphs. This has been illustrated on all undecane isomers C11H24 having the same path counts (total of 25 molecules), on pair of graphs on 18 vertices having the same distance degree sequences (Slater's graphs), as well as two graphs on 21 vertices having identical several topological indices derived from information on distances between vertices.
COBISS.SI-ID: 5229850
Membrane proteins represent about a third of the gene products in most organisms, as revealed by the genome sequencing projects. They account for up to two thirds of known drugable targets, which emphasizes their critical pharmaceutical importance. Here we present a study on bilitranslocase (BTL) (TCDB 2.A.65), a membrane protein primarily involved in the transport of bilirubin from blood to liver cells. Bilitranslocase has also been identified as a potential membrane transporter for cellular uptake of several drugs and due to its implication in drug uptake, it is extremely important to advance the knowledge about its 3D structure. However, at present, only a limited knowledge is available beyond the primary structure of BTL. It has been recently confirmed experimentally that one of the four computationally predicted transmembrane segments of bilitranslocase, TM3, has a helical structure with hydrophilic amino acid residues oriented towards one side, which is typical for transmembrane domains of membrane proteins. In this study we confirmed by the use of multidimensional NMR spectroscopy that the second transmembrane segment, TM2, also appears in a form of α-helix. The stability of this polypeptide chain was verified by molecular dynamics (MD) simulation in dipalmitoyl phosphatidyl choline (DPPC) and in sodium dodecyl sulfate (SDS) micelles. The two α-helices, TM2 corroborated in this study, and TM3 confirmed in our previous investigation, provide reasonable building blocks of a potential transmembrane channel for transport of bilirubin and small hydrophilic molecules, including pharmaceutically active compounds.
COBISS.SI-ID: 5261594