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.
82 related articles for article (PubMed ID: 34327518)
1. Any-k Algorithms for Exploratory Analysis with Conjunctive Queries. Yang X; Riedewald M; Li R; Gatterbauer W Proc 5th Int Workshop Explor Search Databases Web (2018); 2018 Jun; 2018():1-3. PubMed ID: 34327518 [TBL] [Abstract][Full Text] [Related]
2. Any-k: Anytime Top-k Tree Pattern Retrieval in Labeled Graphs. Yang X; Nicholson PK; Ajwani D; Riedewald M; Gatterbauer W; Sala A Proc Int World Wide Web Conf; 2018 Apr; 2018():489-498. PubMed ID: 30003197 [TBL] [Abstract][Full Text] [Related]
3. Optimal Algorithms for Ranked Enumeration of Answers to Full Conjunctive Queries. Tziavelis N; Ajwani D; Gatterbauer W; Riedewald M; Yang X Proceedings VLDB Endowment; 2020 May; 13(9):1582-1597. PubMed ID: 33717631 [TBL] [Abstract][Full Text] [Related]
6. Neural net algorithms that learn in polynomial time from examples and queries. Baum EB IEEE Trans Neural Netw; 1991; 2(1):5-19. PubMed ID: 18276347 [TBL] [Abstract][Full Text] [Related]
7. Geo-Social Top- Attique M; Afzal M; Ali F; Mehmood I; Ijaz MF; Cho HJ Sensors (Basel); 2020 Feb; 20(3):. PubMed ID: 32024087 [TBL] [Abstract][Full Text] [Related]
10. Fast Inbound Top-K Query for Random Walk with Restart. Zhang C; Jiang S; Chen Y; Sun Y; Han J Mach Learn Knowl Discov Databases; 2015 Sep; 9285():608-624. PubMed ID: 26709392 [TBL] [Abstract][Full Text] [Related]
11. Resource Cut, a New Bounding Procedure to Algorithms for Enumerating Tree-Like Chemical Graphs. Nishiyama Y; Shurbevski A; Nagamochi H; Akutsu T IEEE/ACM Trans Comput Biol Bioinform; 2019; 16(1):77-90. PubMed ID: 29994050 [TBL] [Abstract][Full Text] [Related]
12. MAWA∗-a memory-bounded anytime heuristic-search algorithm. Vadlamudi SG; Aine S; Chakrabarti PP IEEE Trans Syst Man Cybern B Cybern; 2011 Jun; 41(3):725-35. PubMed ID: 21095872 [TBL] [Abstract][Full Text] [Related]
13. Integrating unified medical language system and association mining techniques into relevance feedback for biomedical literature search. Ji Y; Ying H; Tran J; Dews P; Massanari RM BMC Bioinformatics; 2016 Jul; 17 Suppl 9(Suppl 9):264. PubMed ID: 27453982 [TBL] [Abstract][Full Text] [Related]
14. Using Application Programming Interfaces to Access Google Data for Health Research: Protocol for a Methodological Framework. Zepecki A; Guendelman S; DeNero J; Prata N JMIR Res Protoc; 2020 Jul; 9(7):e16543. PubMed ID: 32442159 [TBL] [Abstract][Full Text] [Related]
15. Algorithms for Regular Tree Grammar Network Search and Their Application to Mining Human-viral Infection Patterns. Smoly I; Carmel A; Shemer-Avni Y; Yeger-Lotem E; Ziv-Ukelson M J Comput Biol; 2016 Mar; 23(3):165-79. PubMed ID: 26953875 [TBL] [Abstract][Full Text] [Related]
16. Anytime Exploration for Multi-armed Bandits using Confidence Information. Jun KS; Nowak R JMLR Workshop Conf Proc; 2016 Jun; 48():974-982. PubMed ID: 29541329 [TBL] [Abstract][Full Text] [Related]
17. K-MEAP: Multiple Exemplars Affinity Propagation With Specified $K$ Clusters. Wang Y; Chen L IEEE Trans Neural Netw Learn Syst; 2016 Dec; 27(12):2670-2682. PubMed ID: 26685264 [TBL] [Abstract][Full Text] [Related]
18. A structure-based flexible search method for motifs in RNA. Veksler-Lublinsky I; Ziv-Ukelson M; Barash D; Kedem K J Comput Biol; 2007 Sep; 14(7):908-26. PubMed ID: 17803370 [TBL] [Abstract][Full Text] [Related]
19. An anytime local-to-global optimization algorithm for protein threading in theta (m2ñ2) space. Lathrop RH J Comput Biol; 1999; 6(3-4):405-18. PubMed ID: 10582575 [TBL] [Abstract][Full Text] [Related]