Solving Hard Computational Problems Efficiently: Asymptotic Parametric Complexity 3-Coloring Algorithm

Abstract

Many practical problems in almost all scientific and technological disciplines have been classified as computationally hard (NP-hard or even NP-complete). In life sciences, combinatorial optimization problems frequently arise in molecular biology, e.g., genome sequencing; global alignment of multiple genomes; identifying siblings or discovery of dysregulated pathways. In almost all of these problems, there is the need for proving a hypothesis about certain property of an object that can be present if and only if it adopts some particular admissible structure (an NP-certificate) or be absent (no admissible structure), however, none of the standard approaches can discard the hypothesis when no solution can be found, since none can provide a proof that there is no admissible structure. This article presents an algorithm that introduces a novel type of solution method to “efficiently” solve the graph 3-coloring problem; an NP-complete problem. The proposed method provides certificates (proofs) in both cases: present or absent, so it is possible to accept or reject the hypothesis on the basis of a rigorous proof. It provides exact solutions and is polynomial-time (i.e., efficient) however parametric. The only requirement is sufficient computational power, which is controlled by the parameter . Nevertheless, here it is proved that the probability of requiring a value of to obtain a solution for a random graph decreases exponentially: , making tractable almost all problem instances. Thorough experimental analyses were performed. The algorithm was tested on random graphs, planar graphs and 4-regular planar graphs. The obtained experimental results are in accordance with the theoretical expected results.

GIT2 Acts as a Systems-Level Coordinator of Neurometabolic Activity and Pathophysiological Aging

“…Intensively complex, multidimensional events such as whole somatic aging are likely to be coordinated by a series of differential protein hierarchies, in which lower-dimensionality protein functions, e.g., simple mitogen-activated protein kinase (MAPK) cascades are orchestrated and connected to other linear pathways by master-controlling “keystone” or “hub” proteins ( 13 ). Experimental research into the potential molecular interactions that regulate aging across an organisms life span quickly engenders signaling complexity issues comparable to the mathematical difficulties of optimally solving NP-hard (Non-deterministic Polynomial-time hard) or NP-complete calculations ( 112 , 113 ). Therefore, a more pragmatic approach to the investigation of hyper complex signaling architectures, both for mechanistic knowledge and for eventual therapeutic manipulation of highly complex systems, is to identify the central coordinators of these complex systems.…”

Distributed computing and data storage in proteomics: Many hands make light work, and a stronger memory

“…Furthermore, because of continuous advances in MS and proteomics methods, the size of the generated data will continue to increase in the foreseeable future . As a result, the field of proteomics has encountered computational requirements that far exceed the specifications of most common desktop computers . Indeed, for any computational process, the overall speed is determined by the size and amount of the input data, the amount of compute cores that can simultaneously perform calculations, and the availability of the necessary storage capacity.…”

Frequencies Assignment in Cellular Networks

“…Indeed it suffices to identify each cell of the considered network to a node of the graph and each non null component of the compatibility matrix to an edge of the graph. The computational complexity of graph coloring is known to be NP-hard [4]. The minimum number of colors for coloring a graph is its chromatic number.…”