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 *

168 related articles for article (PubMed ID: 25886624)

  • 1. Fast approximate quadratic programming for graph matching.
    Vogelstein JT; Conroy JM; Lyzinski V; Podrazik LJ; Kratzer SG; Harley ET; Fishkind DE; Vogelstein RJ; Priebe CE
    PLoS One; 2015; 10(4):e0121002. PubMed ID: 25886624
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Learning graph matching.
    Caetano TS; McAuley JJ; Cheng L; Le QV; Smola AJ
    IEEE Trans Pattern Anal Mach Intell; 2009 Jun; 31(6):1048-58. PubMed ID: 19372609
    [TBL] [Abstract][Full Text] [Related]  

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

  • 4. Graph Matching: Relax at Your Own Risk.
    Lyzinski V; Fishkind DE; Fiori M; Vogelstein JT; Priebe CE; Sapiro G
    IEEE Trans Pattern Anal Mach Intell; 2016 Jan; 38(1):60-73. PubMed ID: 26656578
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Neural Graph Matching Network: Learning Lawler's Quadratic Assignment Problem With Extension to Hypergraph and Multiple-Graph Matching.
    Wang R; Yan J; Yang X
    IEEE Trans Pattern Anal Mach Intell; 2022 Sep; 44(9):5261-5279. PubMed ID: 33961550
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Factorized Graph Matching.
    Zhou F; de la Torre F
    IEEE Trans Pattern Anal Mach Intell; 2016 Sep; 38(9):1774-1789. PubMed ID: 26595909
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Path matching and graph matching in biological networks.
    Yang Q; Sze SH
    J Comput Biol; 2007; 14(1):56-67. PubMed ID: 17381346
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Approximate Graph Edit Distance in Quadratic Time.
    Riesen K; Ferrer M; Bunke H
    IEEE/ACM Trans Comput Biol Bioinform; 2020; 17(2):483-494. PubMed ID: 26390496
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Fast deep neural correspondence for tracking and identifying neurons in
    Yu X; Creamer MS; Randi F; Sharma AK; Linderman SW; Leifer AM
    Elife; 2021 Jul; 10():. PubMed ID: 34259623
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Matched Filters for Noisy Induced Subgraph Detection.
    Sussman DL; Park Y; Priebe CE; Lyzinski V
    IEEE Trans Pattern Anal Mach Intell; 2020 Nov; 42(11):2887-2900. PubMed ID: 31059426
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Constrained Nets for Graph Matching and Other Quadratic Assignment Problems.
    Simić PD
    Neural Comput; 1991; 3(2):268-281. PubMed ID: 31167309
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Bisected graph matching improves automated pairing of bilaterally homologous neurons from connectomes.
    Pedigo BD; Winding M; Priebe CE; Vogelstein JT
    Netw Neurosci; 2023; 7(2):522-538. PubMed ID: 37409218
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Convergence properties of the softassign quadratic assignment algorithm.
    Rangarajan A; Vuille A; Mjolsness E
    Neural Comput; 1999 Aug; 11(6):1455-74. PubMed ID: 10423503
    [TBL] [Abstract][Full Text] [Related]  

  • 14. A joint graph inference case study: the C. elegans chemical and electrical connectomes.
    Chen L; Vogelstein JT; Lyzinski V; Priebe CE
    Worm; 2016; 5(2):e1142041. PubMed ID: 27386164
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Learnable Graph Matching: A Practical Paradigm for Data Association.
    He J; Huang Z; Wang N; Zhang Z
    IEEE Trans Pattern Anal Mach Intell; 2024 Jul; 46(7):4880-4895. PubMed ID: 38319774
    [TBL] [Abstract][Full Text] [Related]  

  • 16. On the Hardness of Sequence Alignment on De Bruijn Graphs.
    Gibney D; Thankachan SV; Aluru S
    J Comput Biol; 2022 Dec; 29(12):1377-1396. PubMed ID: 36450127
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Approximate labeling via graph cuts based on linear programming.
    Komodakis N; Tziritas G
    IEEE Trans Pattern Anal Mach Intell; 2007 Aug; 29(8):1436-53. PubMed ID: 17568146
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Graph Matching with Adaptive and Branching Path Following.
    Wang T; Ling H; Lang C; Feng S
    IEEE Trans Pattern Anal Mach Intell; 2018 Dec; 40(12):2853-2867. PubMed ID: 29989966
    [TBL] [Abstract][Full Text] [Related]  

  • 19. A Functional Representation for Graph Matching.
    Wang FD; Xue N; Zhang Y; Xia GS; Pelillo M
    IEEE Trans Pattern Anal Mach Intell; 2020 Nov; 42(11):2737-2754. PubMed ID: 31144627
    [TBL] [Abstract][Full Text] [Related]  

  • 20. A Biogeography-Based Optimization Algorithm Hybridized with Tabu Search for the Quadratic Assignment Problem.
    Lim WL; Wibowo A; Desa MI; Haron H
    Comput Intell Neurosci; 2016; 2016():5803893. PubMed ID: 26819585
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 9.