المؤلفون: Hua-Ting Yao, Bertrand Marchand, Sarah J. Berkemer, Yann Ponty, Sebastian Will

المصدر: Algorithms for Molecular Biology, Vol 19, Iss 1, Pp 1-29 (2024)

مصطلحات موضوعية: Bioinformatics, Fixed-parameter tractable algorithms, Tree decomposition, Boltzmann sampling, Network phylogeny, RNA sequence design, Biology (General), QH301-705.5, Genetics, QH426-470

وصف الملف: electronic resource

العلاقة: https://doaj.org/toc/1748-7188Test

الوصول الحر: https://doaj.org/article/a2492a3f7a8045d591547dfa7e014558Test

المؤلفون: Yao, Hua-Ting, Marchand, Bertrand, Berkemer, Sarah J., Ponty, Yann, Will, Sebastian

المساهمون: Algorithms and Models for Integrative BIOlogy (AMIBIO), Laboratoire d'informatique de l'École polytechnique Palaiseau (LIX), École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS), University of Vienna Vienna, École polytechnique (X)-Centre National de la Recherche Scientifique (CNRS), Laboratoire d'Informatique Gaspard-Monge (LIGM), École des Ponts ParisTech (ENPC)-Centre National de la Recherche Scientifique (CNRS)-Université Gustave Eiffel, École polytechnique (X)

المصدر: ISSN: 1748-7188 ; Algorithms for Molecular Biology ; https://inria.hal.science/hal-04211173Test ; Algorithms for Molecular Biology, 2024, ⟨10.1186/s13015-024-00258-2⟩.

مصطلحات موضوعية: Bioinformatics Fixed-parameter tractable algorithms Tree decomposition Boltzmann sampling Network phylogeny RNA sequence design RNA alignment Pseudoknots, Bioinformatics, Fixed-parameter tractable algorithms, Tree decomposition, Boltzmann sampling, Network phylogeny, RNA sequence design, RNA alignment, Pseudoknots, [INFO.INFO-BI]Computer Science [cs]/Bioinformatics [q-bio.QM], [SCCO.COMP]Cognitive science/Computer science

العلاقة: hal-04211173; https://inria.hal.science/hal-04211173Test; https://inria.hal.science/hal-04211173v2/documentTest; https://inria.hal.science/hal-04211173v2/file/s13015-024-00258-2-2.pdfTest

الإتاحة: https://doi.org/10.1186/s13015-024-00258-2Test
https://inria.hal.science/hal-04211173Test
https://inria.hal.science/hal-04211173v2/documentTest
https://inria.hal.science/hal-04211173v2/file/s13015-024-00258-2-2.pdfTest

المؤلفون: Feier, Cristina, Gogacz, Tomasz, Murlak, Filip

المساهمون: Cristina Feier and Tomasz Gogacz and Filip Murlak

مصطلحات موضوعية: conjunctive two-way regular path queries, fixed-parameter tractable evaluation, semantic treewidth, Datalog encoding, optimization

وصف الملف: application/pdf

العلاقة: Is Part Of LIPIcs, Volume 290, 27th International Conference on Database Theory (ICDT 2024); urn:nbn:de:0030-drops-198048; https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2024.22Test

الإتاحة: https://doi.org/10.4230/LIPIcs.ICDT.2024.22Test
https://nbn-resolving.org/urn:nbn:de:0030-drops-198048Test

المؤلفون: Kowalska, Katarzyna, Pilipczuk, Michał

المساهمون: Katarzyna Kowalska and Michał Pilipczuk

مصطلحات موضوعية: Geometric Set Cover, fixed-parameter tractability, weighted parameterized problems, parameterized approximation scheme

وصف الملف: application/pdf

العلاقة: Is Part Of LIPIcs, Volume 289, 41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024); urn:nbn:de:0030-drops-197572; https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2024.47Test

الإتاحة: https://doi.org/10.4230/LIPIcs.STACS.2024.47Test
https://nbn-resolving.org/urn:nbn:de:0030-drops-197572Test

المؤلفون: Chuan-Min Lee

المصدر: Axioms, Vol 13, Iss 6, p 382 (2024)

مصطلحات موضوعية: signed clique transversal, minus clique transversal, b-fold clique transversal, {b}-clique transversal, fixed parameter tractable, para-NP-complete, Mathematics, QA1-939

وصف الملف: electronic resource

العلاقة: https://www.mdpi.com/2075-1680/13/6/382Test; https://doaj.org/toc/2075-1680Test

الوصول الحر: https://doaj.org/article/7e035e0d37dd481ca9179fc0cd8c7b1bTest

المؤلفون: Bessy, Stéphane, Hörsch, Florian, Maia, Ana Karolinna, Rautenbach, Dieter, Sau, Ignasi

المساهمون: Algorithmes, Graphes et Combinatoire (LIRMM, Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM), Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM)-Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM), Optimisation Combinatoire (G-SCOP_OC), Laboratoire des sciences pour la conception, l'optimisation et la production (G-SCOP), Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP ), Université Grenoble Alpes (UGA)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP ), Université Grenoble Alpes (UGA), Parallelism, Graphs and Optimization Research Group (ParGO), Universidade Federal do Ceará = Federal University of Ceará (UFC), Universität Ulm - Ulm University Ulm, Allemagne, ANR-20-CE48-0008,ELIT,Un Parcours par les Limites de l'Efficacité(2020)

المصدر: ISSN: 0166-218X ; Discrete Applied Mathematics ; https://hal-lirmm.ccsd.cnrs.fr/lirmm-04352990Test ; Discrete Applied Mathematics, 2024, 346, pp.80-94. ⟨10.1016/j.dam.2023.11.026⟩.

مصطلحات موضوعية: Digraphs, Packing problems, Arborescences, Branching flows, Safe spanning trees, Parameterized complexity, Fixed-parameter tractability, [INFO]Computer Science [cs], [MATH]Mathematics [math]

العلاقة: lirmm-04352990; https://hal-lirmm.ccsd.cnrs.fr/lirmm-04352990Test; https://hal-lirmm.ccsd.cnrs.fr/lirmm-04352990/documentTest; https://hal-lirmm.ccsd.cnrs.fr/lirmm-04352990/file/Re-re-submission_DAM.pdfTest

الإتاحة: https://doi.org/10.1016/j.dam.2023.11.026Test
https://hal-lirmm.ccsd.cnrs.fr/lirmm-04352990Test
https://hal-lirmm.ccsd.cnrs.fr/lirmm-04352990/documentTest
https://hal-lirmm.ccsd.cnrs.fr/lirmm-04352990/file/Re-re-submission_DAM.pdfTest

المؤلفون: Kelk, Steven, Linz, Simone, Meuwese, Ruben

المصدر: Kelk , S , Linz , S & Meuwese , R 2024 , ' Deep kernelization for the Tree Bisection and Reconnection (TBR) distance in phylogenetics ' , Journal of Computer and System Sciences , vol. 142 , 103519 . https://doi.org/10.1016/j.jcss.2024.103519Test

مصطلحات موضوعية: Agreement forest, Fixed parameter tractability, Kernelization, Phylogenetics, TBR distance

العلاقة: https://cris.maastrichtuniversity.nl/en/publications/d6c59ff7-5d24-4a1c-a185-c92fde23d593Test

الإتاحة: https://doi.org/10.1016/j.jcss.2024.103519Test
https://cris.maastrichtuniversity.nl/en/publications/d6c59ff7-5d24-4a1c-a185-c92fde23d593Test

المؤلفون: Bliznets, Ivan, Bukov, Anton, Sagunov, Danil

المصدر: Bliznets , I , Bukov , A & Sagunov , D 2024 , ' Fair division with minimal withheld information in social networks ' , Theoretical Computer Science , vol. 991 , 114446 . https://doi.org/10.1016/j.tcs.2024.114446Test

مصطلحات موضوعية: EF1 allocation, Fair division, Fixed-parameter tractable, FPT-algorithm

وصف الملف: application/pdf

العلاقة: https://research.rug.nl/en/publications/62938168-9976-4435-aff9-22d2fa41d73dTest

الإتاحة: https://doi.org/10.1016/j.tcs.2024.114446Test
https://hdl.handle.net/11370/62938168-9976-4435-aff9-22d2fa41d73dTest
https://research.rug.nl/en/publications/62938168-9976-4435-aff9-22d2fa41d73dTest
https://pure.rug.nl/ws/files/938849205/1-s2.0-S0304397524000616-main_1_.pdfTest
http://www.scopus.com/inward/record.url?scp=85184992621&partnerID=8YFLogxKTest

المؤلفون: Baril, Ambroise, Couceiro, Miguel, Lagerkvist, Victor

المساهمون: Knowledge representation, reasonning (ORPAILLEUR), Department of Natural Language Processing & Knowledge Discovery (LORIA - NLPKD), Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), Linköpings universitet

المصدر: https://hal.science/hal-04434071Test ; 2024.

مصطلحات موضوعية: Semiring, Dynamic Programming, Fixed Parameter Tractability, Constraint Satisfaction Problems, Connected Dominating Set, [INFO]Computer Science [cs], [MATH]Mathematics [math]

العلاقة: hal-04434071; https://hal.science/hal-04434071Test; https://hal.science/hal-04434071/documentTest; https://hal.science/hal-04434071/file/Article_Semiring.pdfTest

الإتاحة: https://hal.science/hal-04434071Test
https://hal.science/hal-04434071/documentTest
https://hal.science/hal-04434071/file/Article_Semiring.pdfTest

المؤلفون: Huszár, Kristóf, Spreer, Jonathan

المساهمون: Laboratoire de l'Informatique du Parallélisme (LIP), École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS), Centre National de la Recherche Scientifique (CNRS), The University of Sydney, Chambers, Erin W., Gudmundsson, Joachim, ANR-19-P3IA-0002,3IA@cote d'azur,3IA Côte d'Azur(2019), ANR-20-CE48-0007,AlgoKnot,Aspects algorithmiques et combinatoires de la théorie des nœuds(2020), ANR-18-CE40-0032,GrR,Reconfiguration de Graphes(2018), ANR-21-CE48-0014,TWIN-WIDTH,Twin-width: théorie et applications(2021), ANR-10-LABX-0059,CARMIN,Centers of Hosting and International Mathematical Encounters(2010)

المصدر: Leibniz International Proceedings in Informatics (LIPIcs) ; 39th International Symposium on Computational Geometry (SoCG 2023) ; https://hal.science/hal-04055617Test ; 39th International Symposium on Computational Geometry (SoCG 2023), Jun 2023, Dallas, United States. pp.42:1--42:18, ⟨10.4230/LIPIcs.SoCG.2023.42⟩

مصطلحات موضوعية: fixed-parameter tractability, generalized Heegaard splittings, JSJ decompositions, pathwidth, treewidth, triangulations, computational 3-manifold topology, MSC: 57Q15, 57N10, 05C75, 57M15, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.2: Nonnumerical Algorithms and Problems, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory, [MATH.MATH-GT]Mathematics [math]/Geometric Topology [math.GT], [INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG]

جغرافية الموضوع: Dallas, United States

العلاقة: info:eu-repo/semantics/altIdentifier/arxiv/2303.06789; hal-04055617; https://hal.science/hal-04055617Test; https://hal.science/hal-04055617/documentTest; https://hal.science/hal-04055617/file/2303.06789.pdfTest; ARXIV: 2303.06789

الإتاحة: https://doi.org/10.4230/LIPIcs.SoCG.2023.42Test
https://hal.science/hal-04055617Test
https://hal.science/hal-04055617/documentTest
https://hal.science/hal-04055617/file/2303.06789.pdfTest