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.
2. New algorithms for maximum disjoint paths based on tree-likeness. Fleszar K; Mnich M; Spoerhase J Math Program; 2018; 171(1):433-461. PubMed ID: 30956356 [TBL] [Abstract][Full Text] [Related]
3. Dynamic Graph Stream Algorithms in Huang Z; Peng P Algorithmica; 2019; 81(5):1965-1987. PubMed ID: 31057194 [TBL] [Abstract][Full Text] [Related]
4. Faster Cut Sparsification of Weighted Graphs. Forster S; de Vos T Algorithmica; 2023; 85(4):929-964. PubMed ID: 37008076 [TBL] [Abstract][Full Text] [Related]
5. Asymptotically optimal approximation of single qubit unitaries by Clifford and T circuits using a constant number of ancillary qubits. Kliuchnikov V; Maslov D; Mosca M Phys Rev Lett; 2013 May; 110(19):190502. PubMed ID: 23705696 [TBL] [Abstract][Full Text] [Related]
6. An O (N2 log N) restriction map comparison and search algorithm. Myers EW; Huang X Bull Math Biol; 1992 Jul; 54(4):599-618. PubMed ID: 1591534 [TBL] [Abstract][Full Text] [Related]
7. O(N(2)log(2)N) filtered backprojection reconstruction algorithm for tomography. Basu S; Bresler Y IEEE Trans Image Process; 2000; 9(10):1760-73. PubMed ID: 18262914 [TBL] [Abstract][Full Text] [Related]
8. New Tools and Connections for Exponential-Time Approximation. Bansal N; Chalermsook P; Laekhanukit B; Nanongkai D; Nederlof J Algorithmica; 2019; 81(10):3993-4009. PubMed ID: 31496549 [TBL] [Abstract][Full Text] [Related]
9. A Linear-Time Algorithm for 4-Coloring Some Classes of Planar Graphs. Liang Z; Wei H Comput Intell Neurosci; 2021; 2021():7667656. PubMed ID: 34650606 [TBL] [Abstract][Full Text] [Related]
10. Searching protein 3-D structures in linear time. Shibuya T J Comput Biol; 2010 Mar; 17(3):203-19. PubMed ID: 20377441 [TBL] [Abstract][Full Text] [Related]
12. Spin-the-bottle Sort and Annealing Sort: Oblivious Sorting via Round-robin Random Comparisons. Goodrich MT Algorithmica; 2014 Mar; 68(4):835-858. PubMed ID: 24550575 [TBL] [Abstract][Full Text] [Related]
13. Computing Classical-Quantum Channel Capacity Using Blahut-Arimoto Type Algorithm: A Theoretical and Numerical Analysis. Li H; Cai N Entropy (Basel); 2020 Feb; 22(2):. PubMed ID: 33285996 [TBL] [Abstract][Full Text] [Related]
14. A practical O(n log2 n) time algorithm for computing the triplet distance on binary trees. Sand A; Brodal GS; Fagerberg R; Pedersen CN; Mailund T BMC Bioinformatics; 2013; 14 Suppl 2(Suppl 2):S18. PubMed ID: 23368759 [TBL] [Abstract][Full Text] [Related]
15. An O(n log n)-time algorithm for the restriction scaffold assignment problem. Colannino J; Damian M; Hurtado F; Iacono J; Meijer H; Ramaswami S; Toussaint G J Comput Biol; 2006 May; 13(4):979-89. PubMed ID: 16761922 [TBL] [Abstract][Full Text] [Related]
16. A linear memory algorithm for Baum-Welch training. Miklós I; Meyer IM BMC Bioinformatics; 2005 Sep; 6():231. PubMed ID: 16171529 [TBL] [Abstract][Full Text] [Related]
17. Active Thermochemical Tables: accurate enthalpy of formation of hydroperoxyl radical, HO2. Ruscic B; Pinzon RE; Morton ML; Srinivasan NK; Su MC; Sutherland JW; Michael JV J Phys Chem A; 2006 Jun; 110(21):6592-601. PubMed ID: 16722670 [TBL] [Abstract][Full Text] [Related]
18. Improved algorithms for finding gene teams and constructing gene team trees. Wang BF; Lin CH IEEE/ACM Trans Comput Biol Bioinform; 2011; 8(5):1258-72. PubMed ID: 21116042 [TBL] [Abstract][Full Text] [Related]
19. Randomized approximate nearest neighbors algorithm. Jones PW; Osipov A; Rokhlin V Proc Natl Acad Sci U S A; 2011 Sep; 108(38):15679-86. PubMed ID: 21885738 [TBL] [Abstract][Full Text] [Related]
20. Thermodynamics of single-stranded RNA and DNA interactions with oligolysines containing tryptophan. Effects of base composition. Mascotti DP; Lohman TM Biochemistry; 1993 Oct; 32(40):10568-79. PubMed ID: 7691177 [TBL] [Abstract][Full Text] [Related] [Next] [New Search]