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 *

145 related articles for article (PubMed ID: 35366923)

  • 1. 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]  

  • 2. 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]  

  • 3. Automated design of dynamic programming schemes for RNA folding with pseudoknots.
    Marchand B; Will S; Berkemer SJ; Ponty Y; Bulteau L
    Algorithms Mol Biol; 2023 Dec; 18(1):18. PubMed ID: 38041153
    [TBL] [Abstract][Full Text] [Related]  

  • 4. 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]  

  • 5. Infrared: a declarative tree decomposition-powered framework for bioinformatics.
    Yao HT; Marchand B; Berkemer SJ; Ponty Y; Will S
    Algorithms Mol Biol; 2024 Mar; 19(1):13. PubMed ID: 38493130
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Complexity of Secure Sets.
    Bliem B; Woltran S
    Algorithmica; 2018; 80(10):2909-2940. PubMed ID: 29937611
    [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. Querying graphs in protein-protein interactions networks using feedback vertex set.
    Blin G; Sikora F; Vialette S
    IEEE/ACM Trans Comput Biol Bioinform; 2010; 7(4):628-35. PubMed ID: 20498512
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Parameterized runtime analyses of evolutionary algorithms for the planar euclidean traveling salesperson problem.
    Sutton AM; Neumann F; Nallaperuma S
    Evol Comput; 2014; 22(4):595-628. PubMed ID: 24479542
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Approximate search for known gene clusters in new genomes using PQ-trees.
    Zimerman GR; Svetlitsky D; Zehavi M; Ziv-Ukelson M
    Algorithms Mol Biol; 2021 Jul; 16(1):16. PubMed ID: 34243815
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Fast and accurate search for non-coding RNA pseudoknot structures in genomes.
    Huang Z; Wu Y; Robertson J; Feng L; Malmberg RL; Cai L
    Bioinformatics; 2008 Oct; 24(20):2281-7. PubMed ID: 18687694
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Clifford Algebras Meet Tree Decompositions.
    Włodarczyk M
    Algorithmica; 2019; 81(2):497-518. PubMed ID: 30872883
    [TBL] [Abstract][Full Text] [Related]  

  • 13. New algorithms for structure informed genome rearrangement.
    Ozeri E; Zehavi M; Ziv-Ukelson M
    Algorithms Mol Biol; 2023 Dec; 18(1):17. PubMed ID: 38037088
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Performance Analysis of Evolutionary Algorithms for Steiner Tree Problems.
    Lai X; Zhou Y; Xia X; Zhang Q
    Evol Comput; 2017; 25(4):707-723. PubMed ID: 27959580
    [TBL] [Abstract][Full Text] [Related]  

  • 15. ET-Motif: Solving the Exact (l, d)-Planted Motif Problem Using Error Tree Structure.
    Al-Okaily A; Huang CH
    J Comput Biol; 2016 Jul; 23(7):615-23. PubMed ID: 27152692
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Tree decomposition based fast search of RNA structures including pseudoknots in genomes.
    Song Y; Liu C; Malmberg R; Pan F; Cai L
    Proc IEEE Comput Syst Bioinform Conf; 2005; ():223-34. PubMed ID: 16447980
    [TBL] [Abstract][Full Text] [Related]  

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

  • 18. Efficient implied alignment.
    Washburn AJ; Wheeler WC
    BMC Bioinformatics; 2020 Jul; 21(1):296. PubMed ID: 32646365
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Computing a Consensus Phylogeny via Leaf Removal.
    Chen ZZ; Ueta S; Li J; Wang L
    J Comput Biol; 2020 Feb; 27(2):175-188. PubMed ID: 31638413
    [No Abstract]   [Full Text] [Related]  

  • 20. Counting and sampling gene family evolutionary histories in the duplication-loss and duplication-loss-transfer models.
    Chauve C; Ponty Y; Wallner M
    J Math Biol; 2020 Apr; 80(5):1353-1388. PubMed ID: 32060618
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 8.