-
1دورية أكاديمية
المؤلفون: 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
-
2دورية أكاديمية
المساهمون: 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), Universität Wien = University of 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 -
3دورية أكاديمية
المؤلفون: 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 -
4دورية أكاديمية
المؤلفون: 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 -
5دورية أكاديمية
المؤلفون: 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
-
6دورية أكاديمية
المؤلفون: Inenaga, Shunsuke, Puglisi, Simon J.
مصطلحات موضوعية: Front Matter, Table of Contents, Preface, Conference Organization, Theory of computation → Algorithm design techniques, Theory of computation → Data compression, Theory of computation → Design and analysis of algorithms, Theory of computation → Fixed parameter tractability, Theory of computation → Parameterized complexity and exact algorithms, Theory of computation → Pattern matching, Theory of computation → Problems, reductions and completeness, Theory of computation → Sorting and searching, Theory of computation → Theory and algorithms for application domains, Mathematics of computing → Discrete mathematics, Mathematics of computing → Combinatorics on words, Mathematics of computing → Combinatoric problems, Applied computing → Computational biology
وصف الملف: application/pdf
-
7دورية أكاديمية
المؤلفون: Inenaga, Shunsuke, Puglisi, Simon J.
مصطلحات موضوعية: LIPIcs, Volume 296, CPM 2024, Complete Volume, Theory of computation → Algorithm design techniques, Theory of computation → Data compression, Theory of computation → Design and analysis of algorithms, Theory of computation → Fixed parameter tractability, Theory of computation → Parameterized complexity and exact algorithms, Theory of computation → Pattern matching, Theory of computation → Problems, reductions and completeness, Theory of computation → Sorting and searching, Theory of computation → Theory and algorithms for application domains, Mathematics of computing → Discrete mathematics, Mathematics of computing → Combinatorics on words, Mathematics of computing → Combinatoric problems, Applied computing → Computational biology
وصف الملف: application/pdf
العلاقة: https://dx.doi.org/10.4230/LIPIcs.CPM.2024.0Test; https://dx.doi.org/10.4230/LIPIcs.CPM.2024.1Test; https://dx.doi.org/10.4230/LIPIcs.CPM.2024.2Test; https://dx.doi.org/10.4230/LIPIcs.CPM.2024.3Test; https://dx.doi.org/10.4230/LIPIcs.CPM.2024.4Test; https://dx.doi.org/10.4230/LIPIcs.CPM.2024.5Test; https://dx.doi.org/10.4230/LIPIcs.CPM.2024.6Test; https://dx.doi.org/10.4230/LIPIcs.CPM.2024.7Test; https://dx.doi.org/10.4230/LIPIcs.CPM.2024.8Test; https://dx.doi.org/10.4230/LIPIcs.CPM.2024.9Test; https://dx.doi.org/10.4230/LIPIcs.CPM.2024.10Test; https://dx.doi.org/10.4230/LIPIcs.CPM.2024.11Test; https://dx.doi.org/10.4230/LIPIcs.CPM.2024.12Test; https://dx.doi.org/10.4230/LIPIcs.CPM.2024.13Test; https://dx.doi.org/10.4230/LIPIcs.CPM.2024.14Test; https://dx.doi.org/10.4230/LIPIcs.CPM.2024.15Test; https://dx.doi.org/10.4230/LIPIcs.CPM.2024.16Test; https://dx.doi.org/10.4230/LIPIcs.CPM.2024.17Test; https://dx.doi.org/10.4230/LIPIcs.CPM.2024.18Test; https://dx.doi.org/10.4230/LIPIcs.CPM.2024.19Test
-
8دورية أكاديمية
المساهمون: 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 -
9دورية أكاديمية
المؤلفون: 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 -
10دورية أكاديمية
المؤلفون: 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://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
النص الكامل