These tools will no longer be maintained as of December 31, 2024. Archived website can be found here. PubMed4Hh GitHub repository can be found here. Contact NLM Customer Service if you have questions.


BIOMARKERS

Molecular Biopsy of Human Tumors

- a resource for Precision Medicine *

114 related articles for article (PubMed ID: 39072212)

  • 1. Slim Tree-Cut Width.
    Ganian R; Korchemna V
    Algorithmica; 2024; 86(8):2714-2738. PubMed ID: 39072212
    [TBL] [Abstract][Full Text] [Related]  

  • 2. The Power of Cut-Based Parameters for Computing Edge-Disjoint Paths.
    Ganian R; Ordyniak S
    Algorithmica; 2021; 83(2):726-752. PubMed ID: 33707803
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Treewidth-based algorithms for the small parsimony problem on networks.
    Scornavacca C; Weller M
    Algorithms Mol Biol; 2022 Aug; 17(1):15. PubMed ID: 35987645
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Tree diet: reducing the treewidth to unlock FPT algorithms in RNA bioinformatics.
    Marchand B; Ponty Y; Bulteau L
    Algorithms Mol Biol; 2022 Apr; 17(1):8. PubMed ID: 35366923
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Benchmarking treewidth as a practical component of tensor network simulations.
    Dumitrescu EF; Fisher AL; Goodrich TD; Humble TS; Sullivan BD; Wright AL
    PLoS One; 2018; 13(12):e0207827. PubMed ID: 30562341
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Non-Preemptive Tree Packing.
    Lendl S; Woeginger G; Wulf L
    Algorithmica; 2023; 85(3):783-804. PubMed ID: 36883187
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Counting Linear Extensions: Parameterizations by Treewidth.
    Eiben E; Ganian R; Kangas K; Ordyniak S
    Algorithmica; 2019; 81(4):1657-1683. PubMed ID: 31007326
    [TBL] [Abstract][Full Text] [Related]  

  • 8. On Certain Topological Indices of Three-Layered Single-Walled Titania Nanosheets.
    Arockiaraj M; Liu JB; Arulperumjothi M; Prabhu S
    Comb Chem High Throughput Screen; 2022; 25(3):483-495. PubMed ID: 33109055
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Solving Problems on Graphs of High Rank-Width.
    Eiben E; Ganian R; Szeider S
    Algorithmica; 2018; 80(2):742-771. PubMed ID: 31997848
    [TBL] [Abstract][Full Text] [Related]  

  • 10. An efficient 3-approximation algorithm for the Steiner tree problem with the minimum number of Steiner points and bounded edge length.
    Shin D; Choi S
    PLoS One; 2023; 18(11):e0294353. PubMed ID: 37988376
    [TBL] [Abstract][Full Text] [Related]  

  • 11. qTorch: The quantum tensor contraction handler.
    Fried ES; Sawaya NPD; Cao Y; Kivlichan ID; Romero J; Aspuru-Guzik A
    PLoS One; 2018; 13(12):e0208510. PubMed ID: 30532242
    [TBL] [Abstract][Full Text] [Related]  

  • 12. SLIM: Simultaneous Logic-in-Memory Computing Exploiting Bilayer Analog OxRAM Devices.
    Kingra SK; Parmar V; Chang CC; Hudec B; Hou TH; Suri M
    Sci Rep; 2020 Feb; 10(1):2567. PubMed ID: 32054872
    [TBL] [Abstract][Full Text] [Related]  

  • 13. A Scalable Method for Readable Tree Layouts.
    Gray K; Li M; Ahmed R; Rahman MK; Azad A; Kobourov S; Borner K
    IEEE Trans Vis Comput Graph; 2024 Feb; 30(2):1564-1578. PubMed ID: 37159326
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Fast and parallel decomposition of constraint satisfaction problems.
    Gottlob G; Okulmus C; Pichler R
    Constraints; 2022; 27(3):284-326. PubMed ID: 35965950
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Phylogenetic tree reconstruction via graph cut presented using a quantum-inspired computer.
    Onodera W; Hara N; Aoki S; Asahi T; Sawamura N
    Mol Phylogenet Evol; 2023 Jan; 178():107636. PubMed ID: 36208695
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Characterizing compatibility and agreement of unrooted trees via cuts in graphs.
    Vakati S; Fernández-Baca D
    Algorithms Mol Biol; 2014; 9():13. PubMed ID: 24742332
    [TBL] [Abstract][Full Text] [Related]  

  • 17. MTC: A Fast and Robust Graph-Based Transductive Learning Method.
    Zhang YM; Huang K; Geng GG; Liu CL
    IEEE Trans Neural Netw Learn Syst; 2015 Sep; 26(9):1979-91. PubMed ID: 25376047
    [TBL] [Abstract][Full Text] [Related]  

  • 18. RGFinder: a system for determining semantically related genes using GO graph minimum spanning tree.
    Taha K
    IEEE Trans Nanobioscience; 2015 Jan; 14(1):24-37. PubMed ID: 25343765
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Exact approaches for scaffolding.
    Weller M; Chateau A; Giroudeau R
    BMC Bioinformatics; 2015; 16 Suppl 14(Suppl 14):S2. PubMed ID: 26451725
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Efficient FPT Algorithms for (Strict) Compatibility of Unrooted Phylogenetic Trees.
    Baste J; Paul C; Sau I; Scornavacca C
    Bull Math Biol; 2017 Apr; 79(4):920-938. PubMed ID: 28247121
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 6.