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 *

118 related articles for article (PubMed ID: 35709229)

  • 1. A construction heuristic for the capacitated Steiner tree problem.
    Van den Eynde S; Audenaert P; Colle D; Pickavet M
    PLoS One; 2022; 17(6):e0270147. PubMed ID: 35709229
    [TBL] [Abstract][Full Text] [Related]  

  • 2. A heuristic method for solving the Steiner tree problem in graphs using network centralities.
    Fujita M; Shimada Y; Kimura T; Ikeguchi T
    PLoS One; 2024; 19(6):e0303764. PubMed ID: 38843249
    [TBL] [Abstract][Full Text] [Related]  

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

  • 4. The Steiner cycle and path cover problem on interval graphs.
    Ćustić A; Lendl S
    J Comb Optim; 2022; 43(1):226-234. PubMed ID: 35125930
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Multi-start heuristic approaches for one-to-one pickup and delivery problems with shortest-path transport along real-life paths.
    Qi X; Fu Z; Xiong J; Zha W
    PLoS One; 2020; 15(2):e0227702. PubMed ID: 32027655
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Faster heuristics for graph burning.
    Gautam RK; Kare AS; S DB
    Appl Intell (Dordr); 2022; 52(2):1351-1361. PubMed ID: 34764602
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Secure and efficient routing on nodes, edges, and arcs of simple-graphs and of multi-graphs.
    Fröhlich GEA; Doerner KF; Gansterer M
    Networks (N Y); 2020 Dec; 76(4):431-450. PubMed ID: 33328694
    [TBL] [Abstract][Full Text] [Related]  

  • 8. A Column-Generation and Branch-and-Cut Approach to the Bandwidth-Packing Problem.
    Villa C; Hoffman K
    J Res Natl Inst Stand Technol; 2006; 111(2):161-85. PubMed ID: 27274927
    [TBL] [Abstract][Full Text] [Related]  

  • 9. AN EFFICIENT ALGORITHM FOR CHINESE POSTMAN WALK ON BI-DIRECTED DE BRUIJN GRAPHS.
    Kundeti V; Rajasekaran S; Dinh H
    Discrete Math Algorithms Appl; 2010; 1():184-196. PubMed ID: 25364472
    [TBL] [Abstract][Full Text] [Related]  

  • 10. A novel bio-heuristic computing algorithm to solve the capacitated vehicle routing problem based on Adleman-Lipton model.
    Wang Z; Ren X; Ji Z; Huang W; Wu T
    Biosystems; 2019 Oct; 184():103997. PubMed ID: 31369836
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Dynamic algorithms for the shortest path routing problem: learning automata-based solutions.
    Misra S; Oommen BJ
    IEEE Trans Syst Man Cybern B Cybern; 2005 Dec; 35(6):1179-92. PubMed ID: 16366244
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Algorithms for multiple genome rearrangement by signed reversals.
    Wu S; Gu X
    Pac Symp Biocomput; 2003; ():363-74. PubMed ID: 12603042
    [TBL] [Abstract][Full Text] [Related]  

  • 13. The deferred path heuristic for the generalized tree alignment problem.
    Schwikowski B; Vingron M
    J Comput Biol; 1997; 4(3):415-31. PubMed ID: 9278068
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Algorithm for shortest path search in Geographic Information Systems by using reduced graphs.
    Rodríguez-Puente R; Lazo-Cortés MS
    Springerplus; 2013; 2():291. PubMed ID: 24010024
    [TBL] [Abstract][Full Text] [Related]  

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

  • 16. A robust method for searching the smallest set of smallest rings with a path-included distance matrix.
    Lee CJ; Kang YM; Cho KH; No KT
    Proc Natl Acad Sci U S A; 2009 Oct; 106(41):17355-8. PubMed ID: 19805142
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Exact and heuristic algorithms for Space Information Flow.
    Uwitonze A; Huang J; Ye Y; Cheng W; Li Z
    PLoS One; 2018; 13(3):e0193350. PubMed ID: 29584729
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Rarity-weighted richness: a simple and reliable alternative to integer programming and heuristic algorithms for minimum set and maximum coverage problems in conservation planning.
    Albuquerque F; Beier P
    PLoS One; 2015; 10(3):e0119905. PubMed ID: 25780930
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Microcanonical optimization algorithm for the Euclidean Steiner problem in Rn with application to phylogenetic inference.
    Montenegro F; Torreão JR; Maculan N
    Phys Rev E Stat Nonlin Soft Matter Phys; 2003 Nov; 68(5 Pt 2):056702. PubMed ID: 14682906
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Better ILP models for haplotype assembly.
    Etemadi M; Bagherian M; Chen ZZ; Wang L
    BMC Bioinformatics; 2018 Feb; 19(Suppl 1):52. PubMed ID: 29504891
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 6.