BIOMARKERS

Molecular Biopsy of Human Tumors

- a resource for Precision Medicine *

189 related articles for article (PubMed ID: 30514202)

  • 1. Shortest path counting in probabilistic biological networks.
    Ren Y; Ay A; Kahveci T
    BMC Bioinformatics; 2018 Dec; 19(1):465. PubMed ID: 30514202
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Characterizing the topology of probabilistic biological networks.
    Todor A; Dobra A; Kahveci T
    IEEE/ACM Trans Comput Biol Bioinform; 2013; 10(4):970-83. PubMed ID: 24334390
    [TBL] [Abstract][Full Text] [Related]  

  • 3. ProMotE: an efficient algorithm for counting independent motifs in uncertain network topologies.
    Ren Y; Sarkar A; Kahveci T
    BMC Bioinformatics; 2018 Jun; 19(1):242. PubMed ID: 29940838
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Probabilistic inference and ranking of gene regulatory pathways as a shortest-path problem.
    Jensen JD; Jensen DM; Clement MJ; Snell QO
    BMC Bioinformatics; 2013; 14 Suppl 13(Suppl 13):S5. PubMed ID: 24266986
    [TBL] [Abstract][Full Text] [Related]  

  • 5. A New Algorithm for Counting Independent Motifs in Probabilistic Networks.
    Sarkar A; Ren Y; Elhesha R; Kahveci T
    IEEE/ACM Trans Comput Biol Bioinform; 2019; 16(4):1049-1062. PubMed ID: 29994098
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Pattern Discovery in Multilayer Networks.
    Ren Y; Sarkar A; Veltri P; Ay A; Dobra A; Kahveci T
    IEEE/ACM Trans Comput Biol Bioinform; 2022; 19(2):741-752. PubMed ID: 34398763
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Characterizing building blocks of resource constrained biological networks.
    Ren Y; Ay A; Dobra A; Kahveci T
    BMC Bioinformatics; 2019 Jun; 20(Suppl 12):318. PubMed ID: 31216986
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Shortest path based network analysis to characterize cognitive load states of human brain using EEG based functional brain networks.
    Thilaga M; Ramasamy V; Nadarajan R; Nandagopal D
    J Integr Neurosci; 2018; 17(2):133-148. PubMed ID: 28968248
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Cycle Based Network Centrality.
    Zhou X; Liang X; Zhao J; Zhang S
    Sci Rep; 2018 Aug; 8(1):11749. PubMed ID: 30082835
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Hierarchical decomposition of dynamically evolving regulatory networks.
    Ay A; Gong D; Kahveci T
    BMC Bioinformatics; 2015 May; 16():161. PubMed ID: 25976669
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Counting motifs in dynamic networks.
    Mukherjee K; Hasan MM; Boucher C; Kahveci T
    BMC Syst Biol; 2018 Apr; 12(Suppl 1):6. PubMed ID: 29671392
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Finding shortest and nearly shortest path nodes in large substantially incomplete networks by hyperbolic mapping.
    Kitsak M; Ganin A; Elmokashfi A; Cui H; Eisenberg DA; Alderson DL; Korkin D; Linkov I
    Nat Commun; 2023 Jan; 14(1):186. PubMed ID: 36650144
    [TBL] [Abstract][Full Text] [Related]  

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

  • 14. Network orientation via shortest paths.
    Silverbush D; Sharan R
    Bioinformatics; 2014 May; 30(10):1449-55. PubMed ID: 24470573
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Probabilistic biological network alignment.
    Todor A; Dobra A; Kahveci T
    IEEE/ACM Trans Comput Biol Bioinform; 2013; 10(1):109-21. PubMed ID: 23702548
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Identification of large disjoint motifs in biological networks.
    Elhesha R; Kahveci T
    BMC Bioinformatics; 2016 Oct; 17(1):408. PubMed ID: 27716036
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Spreading paths in partially observed social networks.
    Onnela JP; Christakis NA
    Phys Rev E Stat Nonlin Soft Matter Phys; 2012 Mar; 85(3 Pt 2):036106. PubMed ID: 22587148
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Shortest Paths in Multiplex Networks.
    Ghariblou S; Salehi M; Magnani M; Jalili M
    Sci Rep; 2017 May; 7(1):2142. PubMed ID: 28526822
    [TBL] [Abstract][Full Text] [Related]  

  • 19. An improved method for completely uncertain biological network alignment.
    Shen B; Zhao M; Zhong W; He J
    Biomed Res Int; 2015; 2015():253854. PubMed ID: 26000284
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Path ensembles and a tradeoff between communication efficiency and resilience in the human connectome.
    Avena-Koenigsberger A; Mišić B; Hawkins RX; Griffa A; Hagmann P; Goñi J; Sporns O
    Brain Struct Funct; 2017 Jan; 222(1):603-618. PubMed ID: 27334341
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 10.