Zobrazeno 1 - 10
of 131
pro vyhledávání: '"Joachim Niehren"'
Autor:
Antonio Al Serhali, Joachim Niehren
Publikováno v:
Algorithms, Vol 17, Iss 8, p 339 (2024)
We demonstrate how to evaluate stepwise hedge automata (Shas) with subhedge projection while completely projecting irrelevant subhedges. Since this requires passing finite state information top-down, we introduce the notion of downward stepwise hedge
Externí odkaz:
https://doaj.org/article/55ceda0c709b4907aad3674779a29775
Publikováno v:
Logical Methods in Computer Science, Vol Volume 20, Issue 1 (2024)
In this paper, we study the problem of optimizing a linear program whose variables are the answers to a conjunctive query. For this we propose the language LP(CQ) for specifying linear programs whose constraints and objective functions depend on the
Externí odkaz:
https://doaj.org/article/1539c988a37243508dfaa62a3539d77e
Autor:
Ariane Théatre, Carolina Cano-Prieto, Marco Bartolini, Yoann Laurin, Magali Deleu, Joachim Niehren, Tarik Fida, Saïcha Gerbinet, Mohammad Alanjary, Marnix H. Medema, Angélique Léonard, Laurence Lins, Ana Arabolaza, Hugo Gramajo, Harald Gross, Philippe Jacques
Publikováno v:
Frontiers in Bioengineering and Biotechnology, Vol 9 (2021)
Surfactin is a lipoheptapeptide produced by several Bacillus species and identified for the first time in 1969. At first, the biosynthesis of this remarkable biosurfactant was described in this review. The peptide moiety of the surfactin is synthesiz
Externí odkaz:
https://doaj.org/article/67c541f9309e45fbb16342b5e50afd56
Autor:
Jean-Sébastien Guez, Françoise Coucheney, Joany Guy, Max Béchet, Pierre Fontanille, Nour-Eddine Chihib, Joachim Niehren, François Coutte, Philippe Jacques
Publikováno v:
Metabolites, Vol 12, Iss 2, p 107 (2022)
Mycosubtilin belongs to the family of lipopeptides. Different isoforms with various antifungal activities can be obtained according to the length and the isomery of the fatty acid. In this work, the activities of the mycosubtilin isoforms were first
Externí odkaz:
https://doaj.org/article/78eda6234b474aad9d29236858b4141c
Publikováno v:
Computation, Vol 9, Iss 11, p 113 (2021)
We study the problem of how to compute the boolean abstraction of the solution set of a linear equation system over the positive reals. We call a linear equation system ϕ exact for the boolean abstraction if the abstract interpretation of ϕ over th
Externí odkaz:
https://doaj.org/article/5de9c14dc891457885d83935d9c73366
Autor:
Joachim Niehren, Momar Sakho
Publikováno v:
Algorithms, Vol 14, Iss 3, p 68 (2021)
We consider the problem of determinizing and minimizing automata for nested words in practice. For this we compile the nested regular expressions (NREs) from the usual XPath benchmark to nested word automata (NWAs). The determinization of these NWAs,
Externí odkaz:
https://doaj.org/article/c9bb603ee76546a5b2059378c91baf9a
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 161, Iss Proc. GandALF 2014, Pp 189-202 (2014)
Automata for unordered unranked trees are relevant for defining schemas and queries for data trees in Json or Xml format. While the existing notions are well-investigated concerning expressiveness, they all lack a proper notion of determinism, which
Externí odkaz:
https://doaj.org/article/9c80b16a26c848a69226d39e5b55b9a5
Publikováno v:
Computation, Vol 5, Iss 1, p 14 (2017)
Reaction networks can be simplified by eliminating linear intermediate species in partial steadystates. Inthispaper,westudythequestionwhetherthisrewriteprocedureisconfluent,so that for any given reaction network with kinetic constraints, a unique n
Externí odkaz:
https://doaj.org/article/ea7772baddda4b55845452130fb62578
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol 4, Iss 2 (2001)
The system FT ≤ of ordering constraints over feature trees has been introduced as an extension of the system FT of equality constraints over feature trees. We investigate the first-order theory of FT ≤ and its fragments in detail, both over finit
Externí odkaz:
https://doaj.org/article/9595cec478cb4121a18735a9de9b17bd
Publikováno v:
Information and Computation
Information and Computation, 2022, 286, ⟨10.1016/j.ic.2021.104776⟩
Information and Computation, Elsevier, 2021, ⟨10.1016/j.ic.2021.104776⟩
Information and Computation, 2022, 286, ⟨10.1016/j.ic.2021.104776⟩
Information and Computation, Elsevier, 2021, ⟨10.1016/j.ic.2021.104776⟩
International audience; We study the complexity of regular matching and inclusion for compressed tree patterns with context variables subject to regular constraints. Context variables with regular constraints permit to properly generalize on unranked
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a47e856556eeb1a8af5d43e92eaaa9d7
https://inria.hal.science/hal-03151014/document
https://inria.hal.science/hal-03151014/document
