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.
135 related articles for article (PubMed ID: 25140318)
1. An efficient parallel algorithm for multiple sequence similarities calculation using a low complexity method. Marucci EA; Zafalon GF; Momente JC; Neves LA; Valêncio CR; Pinto AR; Cansian AM; de Souza RC; Shiyou Y; Machado JM Biomed Res Int; 2014; 2014():563016. PubMed ID: 25140318 [TBL] [Abstract][Full Text] [Related]
2. Parallelization of MAFFT for large-scale multiple sequence alignments. Nakamura T; Yamada KD; Tomii K; Katoh K Bioinformatics; 2018 Jul; 34(14):2490-2492. PubMed ID: 29506019 [TBL] [Abstract][Full Text] [Related]
3. A fast, lock-free approach for efficient parallel counting of occurrences of k-mers. Marçais G; Kingsford C Bioinformatics; 2011 Mar; 27(6):764-70. PubMed ID: 21217122 [TBL] [Abstract][Full Text] [Related]
4. Multiple alignment of DNA sequences with MAFFT. Katoh K; Asimenos G; Toh H Methods Mol Biol; 2009; 537():39-64. PubMed ID: 19378139 [TBL] [Abstract][Full Text] [Related]
5. An improved distance matrix computation algorithm for multicore clusters. Al-Neama MW; Reda NM; Ghaleb FF Biomed Res Int; 2014; 2014():406178. PubMed ID: 25013779 [TBL] [Abstract][Full Text] [Related]
6. KCMBT: a k-mer Counter based on Multiple Burst Trees. Mamun AA; Pal S; Rajasekaran S Bioinformatics; 2016 Sep; 32(18):2783-90. PubMed ID: 27283950 [TBL] [Abstract][Full Text] [Related]
7. Parallel Tiled Codes Implementing the Smith-Waterman Alignment Algorithm for Two and Three Sequences. Palkowski M; Bielecki W J Comput Biol; 2018 Oct; 25(10):1106-1119. PubMed ID: 29993269 [TBL] [Abstract][Full Text] [Related]
8. Parallel Implementation of MAFFT on CUDA-Enabled Graphics Hardware. Zhu X; Li K; Salah A; Shi L; Li K IEEE/ACM Trans Comput Biol Bioinform; 2015; 12(1):205-18. PubMed ID: 26357090 [TBL] [Abstract][Full Text] [Related]
9. Parallel algorithms for large-scale biological sequence alignment on Xeon-Phi based clusters. Lan H; Chan Y; Xu K; Schmidt B; Peng S; Liu W BMC Bioinformatics; 2016 Jul; 17 Suppl 9(Suppl 9):267. PubMed ID: 27455061 [TBL] [Abstract][Full Text] [Related]
10. Efficient computation of spaced seeds. Ilie S BMC Res Notes; 2012 Feb; 5():123. PubMed ID: 22373455 [TBL] [Abstract][Full Text] [Related]
11. CSA: an efficient algorithm to improve circular DNA multiple alignment. Fernandes F; Pereira L; Freitas AT BMC Bioinformatics; 2009 Jul; 10():230. PubMed ID: 19627599 [TBL] [Abstract][Full Text] [Related]
12. Optimised fine and coarse parallelism for sequence homology search. Meng X; Chaudhary V Int J Bioinform Res Appl; 2006; 2(4):430-41. PubMed ID: 18048183 [TBL] [Abstract][Full Text] [Related]
13. Towards a HPC-oriented parallel implementation of a learning algorithm for bioinformatics applications. D'Angelo G; Rampone S BMC Bioinformatics; 2014; 15 Suppl 5(Suppl 5):S2. PubMed ID: 25077818 [TBL] [Abstract][Full Text] [Related]
14. Efficient counting of k-mers in DNA sequences using a bloom filter. Melsted P; Pritchard JK BMC Bioinformatics; 2011 Aug; 12():333. PubMed ID: 21831268 [TBL] [Abstract][Full Text] [Related]
15. SuperMIC: Analyzing Large Biological Datasets in Bioinformatics with Maximal Information Coefficient. Wang C; Dai D; Li X; Wang A; Zhou X IEEE/ACM Trans Comput Biol Bioinform; 2017; 14(4):783-795. PubMed ID: 27076457 [TBL] [Abstract][Full Text] [Related]