29 March 2021 in Computational and Applied Mathematics
4 November 2018 in Revista Brasileira de Física Médica
GSGiovanni Hering Scavariello
Giovanni Hering Scavariello
RMRickson Coelho Mesquita
+3
O funcionamento cerebral parece ser altamente organizado mesmo na ausência de tarefas específicas. Neste trabalho usamos teoria de grafos num experimento de neuroimagem multimodal com ressonância magnética funcional e espectroscopia no infravermelho próximo para entender melhor a conectividade funcional durante o estado de repouso. Nossos resultados sugerem que, independentemente das diferenças entre voluntários, suas propriedades de grafos é muito similar. Além disso, propomos uma nova abordagem para analisar a conectividade de um grupo baseado na frequência de distribuição de links.
22 September 2024 in bioRxiv
Protein structure prediction is usually based on the use of local conformational information coupled with long-range distance restraints. Such restraints can be derived from the knowledge of a template structure or the analysis of protein sequence alignment in the framework of models arising from the physics of disordered systems. The accuracy of approaches based on sequence alignment, however, is limited in the case where the number of aligned sequences is small. Here we derive protein conformations using only local conformations knowledge by means of the interval Branch-and-Prune algorithm. The computation efficiency is directly related to the knowledge of stereochemistry (bond angle and ω values) along the protein sequence, and in particular to the variations of the torsion angle ω. The impact of stereochemistry variations is particularly strong in the case of protein topologies defined from numerous long-range restraints, as in the case of protein of β secondary structures. The systematic enumeration of the conformations improves the efficiency of the calculations. The analysis of DNA codons permits to connect the variations of torsion angle ω to the positions of rare DNA codons.
20 October 2026 in Journal of Global Optimization
The Molecular Distance Geometry Problem is essential to structural biology, as it seeks to determine three-dimensional protein structures from partial interatomic distances. Its discretizable subclass (DMDGP) admits an exact combinatorial formulation that enables efficient exploration of the search space. However, in practical settings such as Nuclear Magnetic Resonance (NMR) spectroscopy, distances are available only within uncertainty bounds, leading to the interval variant ( i DMDGP). We propose a hybrid combinatorial–continuous framework for solving the i DMDGP. The method combines an enumeration process derived from the DMDGP with a continuous refinement stage that minimizes a nonconvex stress function penalizing deviations from admissible distance intervals. This integration supports a systematic exploration guided by discrete structure and local optimization. The formulation incorporates torsion angle intervals and chirality constraints through an atom ordering that preserves protein-backbone geometry. Numerical experiments show that the approach efficiently reconstructs geometrically valid conformations even under wide distance bounds, whereas most existing studies assume narrow ones.