Zobrazeno 1 - 10
of 5 148
pro vyhledávání: '"A. Tomescu"'
Autor:
Sena, Francisco, Tomescu, Alexandru I.
A common step at the core of many RNA transcript assembly tools is to find a set of weighted paths that best explain the weights of a DAG. While such problems easily become NP-hard, scalable solvers exist only for a basic error-free version of this p
Externí odkaz:
http://arxiv.org/abs/2411.03871
Minimum flow decomposition (MFD) is the strongly NP-hard problem of finding a smallest set of integer weighted paths in a graph $G$ whose weighted sum is equal to a given flow $f$ on $G$. Despite its many practical applications, we lack an understand
Externí odkaz:
http://arxiv.org/abs/2409.20278
Autor:
Grigorjew, Andreas, Dias, Fernando H. C., Cracco, Andrea, Rizzi, Romeo, Tomescu, Alexandru I.
Given a flow network, the Minimum Flow Decomposition (MFD) problem is finding the smallest possible set of weighted paths whose superposition equals the flow. It is a classical, strongly NP-hard problem that is proven to be useful in RNA transcript a
Externí odkaz:
http://arxiv.org/abs/2311.10563
Computing a minimum path cover (MPC) of a directed acyclic graph (DAG) is a fundamental problem with a myriad of applications, including reachability. Although it is known how to solve the problem by a simple reduction to minimum flow, recent theoret
Externí odkaz:
http://arxiv.org/abs/2308.08960
Publikováno v:
Revista Română de Informatică și Automatică, Vol 34, Iss 3, Pp 149-164 (2024)
The research aimed to explore the potential of advanced machine learning (ML) algorithms in clinical and biomedical research. The significance of frameworks like generative adversarial networks (GANs), autoencoders, and autoregressive models in tackl
Externí odkaz:
https://doaj.org/article/fa0e21bba03a4a6394d19111acfe0d73
Autor:
Dias, Fernando H. C., Caceres, Manuel, Williams, Lucia, Mumey, Brendan, Tomescu, Alexandru I.
Many important problems in Bioinformatics (e.g., assembly or multi-assembly) admit multiple solutions, while the final objective is to report only one. A common approach to deal with this uncertainty is finding safe partial solutions (e.g., contigs)
Externí odkaz:
http://arxiv.org/abs/2301.13245
Publikováno v:
Studia Universitatis Babeş-Bolyai: Educatio Artis Gymnasticae, Vol 69, Iss 3 (2024)
Structured and purposeful physical activity has demonstrated significant effects on personality traits and behaviors among offenders, especially in reducing maladaptive behaviors. The European Prison Rules strongly advocate for all prisoners to have
Externí odkaz:
https://doaj.org/article/a0a49e866fe94f2a80219cfdd903e7d3
Autor:
Fabio Silvio Taccone, Frank Martin Brunkhorst, Gabriella Bottari, Jorge Hidalgo, Andreas Kribben, Jean-Louis Teboul, Dana Tomescu, Teresa Klaus, Joerg Scheier, Efthymios Deliargyris, Ricard Ferrer
Publikováno v:
JMIR Research Protocols, Vol 13, p e55880 (2024)
BackgroundExtracorporeal blood purification with CytoSorb has been increasingly used as an adjunctive therapy in several hyperinflammatory critical care conditions, as well as to remove elevated levels of myoglobin or bilirubin in patients with rhabd
Externí odkaz:
https://doaj.org/article/844c619529494d649017af11b45b8428
A minimum path cover (MPC) of a directed acyclic graph (DAG) $G = (V,E)$ is a minimum-size set of paths that together cover all the vertices of the DAG. Computing an MPC is a basic polynomial problem, dating back to Dilworth's and Fulkerson's results
Externí odkaz:
http://arxiv.org/abs/2211.09659
Autor:
Cairo, Massimo, Khan, Shahbaz, Rizzi, Romeo, Schmidt, Sebastian, Tomescu, Alexandru I., Zirondelli, Elia C.
In a strongly connected graph $G = (V,E)$, a cut arc (also called strong bridge) is an arc $e \in E$ whose removal makes the graph no longer strongly connected. Equivalently, there exist $u,v \in V$, such that all $u$-$v$ walks contain $e$. Cut arcs
Externí odkaz:
http://arxiv.org/abs/2210.07530