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 *

132 related articles for article (PubMed ID: 35125930)

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

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

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

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

  • 7. Efficient enumeration of monocyclic chemical graphs with given path frequencies.
    Suzuki M; Nagamochi H; Akutsu T
    J Cheminform; 2014; 6():31. PubMed ID: 24955135
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

  • 11. Safety in Multi-Assembly via Paths Appearing in All Path Covers of a DAG.
    Caceres M; Mumey B; Husic E; Rizzi R; Cairo M; Sahlin K; Tomescu AI
    IEEE/ACM Trans Comput Biol Bioinform; 2022; 19(6):3673-3684. PubMed ID: 34847041
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Optimal parallel algorithm for shortest paths problem on interval graphs.
    Mishra PK
    J Zhejiang Univ Sci; 2004 Sep; 5(9):1135-43. PubMed ID: 15323010
    [TBL] [Abstract][Full Text] [Related]  

  • 13. The Edge-Disjoint Path Problem on Random Graphs by Message-Passing.
    Altarelli F; Braunstein A; Dall'Asta L; De Bacco C; Franz S
    PLoS One; 2015; 10(12):e0145222. PubMed ID: 26710102
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Geodesic Tracks: Computing Discrete Geodesics With Track-Based Steiner Point Propagation.
    Meng W; Xin S; Tu C; Chen S; He Y; Wang W
    IEEE Trans Vis Comput Graph; 2022 Dec; 28(12):4887-4901. PubMed ID: 34469303
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Performance of a cavity-method-based algorithm for the prize-collecting Steiner tree problem on graphs.
    Biazzo I; Braunstein A; Zecchina R
    Phys Rev E Stat Nonlin Soft Matter Phys; 2012 Aug; 86(2 Pt 2):026706. PubMed ID: 23005881
    [TBL] [Abstract][Full Text] [Related]  

  • 16. A new algorithm to find fuzzy Hamilton cycle in a fuzzy network using adjacency matrix and minimum vertex degree.
    Nagoor Gani A; Latha SR
    Springerplus; 2016; 5(1):1854. PubMed ID: 27818892
    [TBL] [Abstract][Full Text] [Related]  

  • 17. On the VC-Dimension of Unique Round-Trip Shortest Path Systems.
    Zhu CJ; Lam KY; Yin Ng JK; Bi J
    Inf Process Lett; 2019 May; 145():1-5. PubMed ID: 31741499
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Enumerating tree-like chemical graphs with given upper and lower bounds on path frequencies.
    Shimizu M; Nagamochi H; Akutsu T
    BMC Bioinformatics; 2011 Dec; 12 Suppl 14(Suppl 14):S3. PubMed ID: 22373441
    [TBL] [Abstract][Full Text] [Related]  

  • 19. A path following algorithm for the graph matching problem.
    Zaslavskiy M; Bach F; Vert JP
    IEEE Trans Pattern Anal Mach Intell; 2009 Dec; 31(12):2227-42. PubMed ID: 19834143
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Statistical mechanics of steiner trees.
    Bayati M; Borgs C; Braunstein A; Chayes J; Ramezanpour A; Zecchina R
    Phys Rev Lett; 2008 Jul; 101(3):037208. PubMed ID: 18764290
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 7.