Zobrazeno 1 - 10
of 9 815
pro vyhledávání: '"A, Sorge"'
Autor:
Firbas, Alexander, Sorge, Manuel
Vertex splitting is a graph operation that replaces a vertex $v$ with two nonadjacent new vertices and makes each neighbor of $v$ adjacent with one or both of the introduced vertices. Vertex splitting has been used in contexts from circuit design to
Externí odkaz:
http://arxiv.org/abs/2401.16296
Publikováno v:
Journal of Dairy Science, Vol 107, Iss 10, Pp 8452-8463 (2024)
ABSTRACT: The objective of this study was to analyze the in vitro antimicrobial resistance (AMR) of Streptococcusdysgalactiae, Strep. agalactiae, and Strep. canis over a 10-yr period from 2012 to 2022 against the most commonly used antimicrobial agen
Externí odkaz:
https://doaj.org/article/225e978456064bea9b79600b128d0581
Publikováno v:
Journal of Dairy Science, Vol 107, Iss 10, Pp 8402-8412 (2024)
ABSTRACT: The objective of this study was to describe the prevalence of antimicrobial resistance of Escherichia coli, Klebsiella oxytoca, Klebsiellapneumoniae, and Serratiamarcescens from quarter milk samples submitted to the udder health laboratory
Externí odkaz:
https://doaj.org/article/fa550e5b07174e26af03c2ee7db8fab9
Autor:
Firbas, Alexander, Dobler, Alexander, Holzer, Fabian, Schafellner, Jakob, Sorge, Manuel, Villedieu, Anaïs, Wißmann, Monika
Clustering a graph when the clusters can overlap can be seen from three different angles: We may look for cliques that cover the edges of the graph with bounded overlap, we may look to add or delete few edges to uncover the cluster structure, or we m
Externí odkaz:
http://arxiv.org/abs/2309.00504
Random forests and, more generally, (decision\nobreakdash-)tree ensembles are widely used methods for classification and regression. Recent algorithmic advances allow to compute decision trees that are optimal for various measures such as their size
Externí odkaz:
http://arxiv.org/abs/2306.04423
Autor:
Matteo Sorge, Giulia Savoré, Andrea Gallo, Davide Acquarone, Mauro Sbroggiò, Silvia Velasco, Federica Zamporlini, Saveria Femminò, Enrico Moiso, Giampaolo Morciano, Elisa Balmas, Andrea Raimondi, Gabrielle Nattenberg, Rachele Stefania, Carlo Tacchetti, Angela Maria Rizzo, Paola Corsetto, Alessandra Ghigo, Emilia Turco, Fiorella Altruda, Lorenzo Silengo, Paolo Pinton, Nadia Raffaelli, Nathan J Sniadecki, Claudia Penna, Pasquale Pagliaro, Emilio Hirsch, Chiara Riganti, Guido Tarone, Alessandro Bertero, Mara Brancaccio
Publikováno v:
EMBO Molecular Medicine, Vol 16, Iss 10, Pp 2450-2484 (2024)
Abstract Defining the molecular mechanisms underlying cardiac resilience is crucial to find effective approaches to protect the heart. A physiologic level of ROS is produced in the heart by fatty acid oxidation, but stressful events can boost ROS and
Externí odkaz:
https://doaj.org/article/fbbe12027f6940b5871e50bcfc957a2f
Autor:
Femke C.C. Klouwer, Stefan D. Roosendaal, Carla E. M. Hollak, Mirjam Langeveld, Bwee Tien Poll-The, Arlette J. van Sorge, Nicole I. Wolf, Marjo S. van der Knaap, Marc Engelen
Publikováno v:
Orphanet Journal of Rare Diseases, Vol 19, Iss 1, Pp 1-9 (2024)
Abstract Background Alpha-methylacyl-CoA racemase (AMACR) deficiency is a rare peroxisomal enzyme deficiency caused by biallelic variants in the AMACR gene. This deficiency leads to the accumulation of toxic bile acid intermediates (R)-trihydroxychol
Externí odkaz:
https://doaj.org/article/06bcf3f754ad448a8d1311bfc4c466de
Autor:
Chen, Jiehua, Haydn, Sebastian Vincent, Khavidaki, Negar Layegh, Simola, Sofia, Sorge, Manuel
In many applications, we want to influence the decisions of independent agents by designing incentives for their actions. We revisit a fundamental problem in this area, called GAME IMPLEMENTATION: Given a game in standard form and a set of desired st
Externí odkaz:
http://arxiv.org/abs/2212.00699
Publikováno v:
Journal of Artificial Intelligence Research, 74:1687-1713, 2022
Treewidth and hypertree width have proven to be highly successful structural parameters in the context of the Constraint Satisfaction Problem (CSP). When either of these parameters is bounded by a constant, then CSP becomes solvable in polynomial tim
Externí odkaz:
http://arxiv.org/abs/2210.07040
Autor:
Hatzel, Meike, Jaffke, Lars, Lima, Paloma T., Masařík, Tomáš, Pilipczuk, Marcin, Sharma, Roohani, Sorge, Manuel
Publikováno v:
Proceedings: ACM-SIAM Symposium on Discrete Algorithms, SODA 2023
We show fixed-parameter tractability of the Directed Multicut problem with three terminal pairs (with a randomized algorithm). This problem, given a directed graph $G$, pairs of vertices (called terminals) $(s_1,t_1)$, $(s_2,t_2)$, and $(s_3,t_3)$, a
Externí odkaz:
http://arxiv.org/abs/2207.07425