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. SS-Wrapper: a package of wrapper applications for similarity searches on Linux clusters. Wang C; Lefkowitz EJ BMC Bioinformatics; 2004 Oct; 5():171. PubMed ID: 15511296 [TBL] [Abstract][Full Text] [Related]
3. The effects of sampling on the efficiency and accuracy of k-mer indexes: Theoretical and empirical comparisons using the human genome. Almutairy M; Torng E PLoS One; 2017; 12(7):e0179046. PubMed ID: 28686614 [TBL] [Abstract][Full Text] [Related]
4. Parasail: SIMD C library for global, semi-global, and local pairwise sequence alignments. Daily J BMC Bioinformatics; 2016 Feb; 17():81. PubMed ID: 26864881 [TBL] [Abstract][Full Text] [Related]
5. Optimizing Spaced k-mer Neighbors for Efficient Filtration in Protein Similarity Search. Li W; Ma B; Zhang K IEEE/ACM Trans Comput Biol Bioinform; 2014; 11(2):398-406. PubMed ID: 26355786 [TBL] [Abstract][Full Text] [Related]
6. PTPan--overcoming memory limitations in oligonucleotide string matching for primer/probe design. Eissler T; Hodges CP; Meier H Bioinformatics; 2011 Oct; 27(20):2797-805. PubMed ID: 21856736 [TBL] [Abstract][Full Text] [Related]
7. A new method to compute K-mer frequencies and its application to annotate large repetitive plant genomes. Kurtz S; Narechania A; Stein JC; Ware D BMC Genomics; 2008 Oct; 9():517. PubMed ID: 18976482 [TBL] [Abstract][Full Text] [Related]
8. Disk compression of k-mer sets. Rahman A; Chikhi R; Medvedev P Algorithms Mol Biol; 2021 Jun; 16(1):10. PubMed ID: 34154632 [TBL] [Abstract][Full Text] [Related]
9. Application of kernel functions for accurate similarity search in large chemical databases. Wang X; Huan J; Smalter A; Lushington GH BMC Bioinformatics; 2010 Apr; 11 Suppl 3(Suppl 3):S8. PubMed ID: 20438655 [TBL] [Abstract][Full Text] [Related]
10. Rapid similarity search of proteins using alignments of domain arrangements. Terrapon N; Weiner J; Grath S; Moore AD; Bornberg-Bauer E Bioinformatics; 2014 Jan; 30(2):274-81. PubMed ID: 23828785 [TBL] [Abstract][Full Text] [Related]
11. SSAHA: a fast search method for large DNA databases. Ning Z; Cox AJ; Mullikin JC Genome Res; 2001 Oct; 11(10):1725-9. PubMed ID: 11591649 [TBL] [Abstract][Full Text] [Related]
12. 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]
13. 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]
15. MILANO--custom annotation of microarray results using automatic literature searches. Rubinstein R; Simon I BMC Bioinformatics; 2005 Jan; 6():12. PubMed ID: 15661078 [TBL] [Abstract][Full Text] [Related]
16. A case study for large-scale human microbiome analysis using JCVI's metagenomics reports (METAREP). Goll J; Thiagarajan M; Abubucker S; Huttenhower C; Yooseph S; Methé BA PLoS One; 2012; 7(6):e29044. PubMed ID: 22719821 [TBL] [Abstract][Full Text] [Related]
17. Comparing fixed sampling with minimizer sampling when using k-mer indexes to find maximal exact matches. Almutairy M; Torng E PLoS One; 2018; 13(2):e0189960. PubMed ID: 29389989 [TBL] [Abstract][Full Text] [Related]
18. Improving Bloom Filter Performance on Sequence Data Using k-mer Bloom Filters. Pellow D; Filippova D; Kingsford C J Comput Biol; 2017 Jun; 24(6):547-557. PubMed ID: 27828710 [TBL] [Abstract][Full Text] [Related]
19. Recent Hits Acquired by BLAST (ReHAB): a tool to identify new hits in sequence similarity searches. Whitney J; Esteban DJ; Upton C BMC Bioinformatics; 2005 Feb; 6():23. PubMed ID: 15701178 [TBL] [Abstract][Full Text] [Related]