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 *

120 related articles for article (PubMed ID: 21867496)

  • 1. Exploiting bounded signal flow for graph orientation based on cause-effect pairs.
    Dorn B; Hüffner F; Krüger D; Niedermeier R; Uhlmann J
    Algorithms Mol Biol; 2011 Aug; 6():21. PubMed ID: 21867496
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Parameterized Complexity of Eulerian Deletion Problems.
    Cygan M; Marx D; Pilipczuk M; Pilipczuk M; Schlotter I
    Algorithmica; 2014; 68(1):41-61. PubMed ID: 24415818
    [TBL] [Abstract][Full Text] [Related]  

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

  • 4. Tractable Cases of (*,2)-Bounded Parsimony Haplotyping.
    Keijsper J; Oosterwijk T
    IEEE/ACM Trans Comput Biol Bioinform; 2015; 12(1):234-47. PubMed ID: 26357092
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Parameterized Algorithmics for Finding Exact Solutions of NP-Hard Biological Problems.
    Hüffner F; Komusiewicz C; Niedermeier R; Wernicke S
    Methods Mol Biol; 2017; 1526():363-402. PubMed ID: 27896752
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Parameterized algorithmics for finding connected motifs in biological networks.
    Betzler N; van Bevern R; Fellows MR; Komusiewicz C; Niedermeier R
    IEEE/ACM Trans Comput Biol Bioinform; 2011; 8(5):1296-308. PubMed ID: 21282862
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Stable Matchings with Covering Constraints: A Complete Computational Trichotomy.
    Mnich M; Schlotter I
    Algorithmica; 2020; 82(5):1136-1188. PubMed ID: 32214574
    [TBL] [Abstract][Full Text] [Related]  

  • 8. New algorithms for maximum disjoint paths based on tree-likeness.
    Fleszar K; Mnich M; Spoerhase J
    Math Program; 2018; 171(1):433-461. PubMed ID: 30956356
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Connectivity problems on heterogeneous graphs.
    Wu J; Khodaverdian A; Weitz B; Yosef N
    Algorithms Mol Biol; 2019; 14():5. PubMed ID: 30899321
    [TBL] [Abstract][Full Text] [Related]  

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

  • 11. Continuous facility location on graphs.
    Hartmann TA; Lendl S; Woeginger GJ
    Math Program; 2022; 192(1-2):207-227. PubMed ID: 35300152
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Optimally orienting physical networks.
    Silverbush D; Elberfeld M; Sharan R
    J Comput Biol; 2011 Nov; 18(11):1437-48. PubMed ID: 21999286
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Complexity of Secure Sets.
    Bliem B; Woltran S
    Algorithmica; 2018; 80(10):2909-2940. PubMed ID: 29937611
    [TBL] [Abstract][Full Text] [Related]  

  • 14. On the complexity of Minimum Path Cover with Subpath Constraints for multi-assembly.
    Rizzi R; Tomescu AI; Mäkinen V
    BMC Bioinformatics; 2014; 15 Suppl 9(Suppl 9):S5. PubMed ID: 25252805
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Fixed-parameter tractability of the maximum agreement supertree problem.
    Guillemot S; Berry V
    IEEE/ACM Trans Comput Biol Bioinform; 2010; 7(2):342-53. PubMed ID: 20431153
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Parameterized Complexity and Inapproximability of Dominating Set Problem in Chordal and Near Chordal Graphs.
    Liu C; Song Y
    J Comb Optim; 2010 Apr; 20(2):1-15. PubMed ID: 23874144
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Matching algorithms for assigning orthologs after genome duplication events.
    Fertin G; Hüffner F; Komusiewicz C; Sorge M
    Comput Biol Chem; 2018 Jun; 74():379-390. PubMed ID: 29650458
    [TBL] [Abstract][Full Text] [Related]  

  • 18. On the Minimum Error Correction Problem for Haplotype Assembly in Diploid and Polyploid Genomes.
    Bonizzoni P; Dondi R; Klau GW; Pirola Y; Pisanti N; Zaccaria S
    J Comput Biol; 2016 Sep; 23(9):718-36. PubMed ID: 27280382
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Explaining a Weighted DAG with Few Paths for Solving Genome-Guided Multi-Assembly.
    Tomescu AI; Gagie T; Popa A; Rizzi R; Kuosmanen A; Mäkinen V
    IEEE/ACM Trans Comput Biol Bioinform; 2015; 12(6):1345-54. PubMed ID: 26671806
    [TBL] [Abstract][Full Text] [Related]  

  • 20. A new fast algorithm for solving the minimum spanning tree problem based on DNA molecules computation.
    Wang Z; Huang D; Meng H; Tang C
    Biosystems; 2013 Oct; 114(1):1-7. PubMed ID: 23871964
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 6.