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.
150 related articles for article (PubMed ID: 22369457)
61. An improved encoding of genetic variation in a Burrows-Wheeler transform. Büchler T; Ohlebusch E Bioinformatics; 2020 Mar; 36(5):1413-1419. PubMed ID: 31613311 [TBL] [Abstract][Full Text] [Related]
62. Distributed Complementary Binary Quantization for Joint Hash Table Learning. Liu X; Fu Q; Wang D; Bai X; Wu X; Tao D IEEE Trans Neural Netw Learn Syst; 2020 Dec; 31(12):5312-5323. PubMed ID: 32078562 [TBL] [Abstract][Full Text] [Related]
63. Linear-time computation of minimal absent words using suffix array. Barton C; Heliou A; Mouchard L; Pissis SP BMC Bioinformatics; 2014 Dec; 15(1):388. PubMed ID: 25526884 [TBL] [Abstract][Full Text] [Related]
64. Fast inexact mapping using advanced tree exploration on backward search methods. Salavert J; Tomás A; Tárraga J; Medina I; Dopazo J; Blanquer I BMC Bioinformatics; 2015 Jan; 16():18. PubMed ID: 25626517 [TBL] [Abstract][Full Text] [Related]
65. A practical algorithm for finding maximal exact matches in large sequence datasets using sparse suffix arrays. Khan Z; Bloom JS; Kruglyak L; Singh M Bioinformatics; 2009 Jul; 25(13):1609-16. PubMed ID: 19389736 [TBL] [Abstract][Full Text] [Related]
66. Fast detection of maximal exact matches via fixed sampling of query K-mers and Bloom filtering of index K-mers. Liu Y; Zhang LY; Li J Bioinformatics; 2019 Nov; 35(22):4560-4567. PubMed ID: 30994891 [TBL] [Abstract][Full Text] [Related]
67. 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]
68. GMAP and GSNAP for Genomic Sequence Alignment: Enhancements to Speed, Accuracy, and Functionality. Wu TD; Reeder J; Lawrence M; Becker G; Brauer MJ Methods Mol Biol; 2016; 1418():283-334. PubMed ID: 27008021 [TBL] [Abstract][Full Text] [Related]
69. Error Tree: A Tree Structure for Hamming and Edit Distances and Wildcards Matching. Al-Okaily A J Comput Biol; 2015 Dec; 22(12):1118-28. PubMed ID: 26402070 [TBL] [Abstract][Full Text] [Related]
71. Parallel Computation of the Burrows-Wheeler Transform of Short Reads Using Prefix Parallelism. Kimura K; Koike A IEEE/ACM Trans Comput Biol Bioinform; 2019; 16(1):3-13. PubMed ID: 29994538 [TBL] [Abstract][Full Text] [Related]
72. Fast Exact Search in Hamming Space With Multi-Index Hashing. Norouzi M; Punjani A; Fleet DJ IEEE Trans Pattern Anal Mach Intell; 2014 Jun; 36(6):1107-19. PubMed ID: 26353274 [TBL] [Abstract][Full Text] [Related]
73. stringMLST: a fast k-mer based tool for multilocus sequence typing. Gupta A; Jordan IK; Rishishwar L Bioinformatics; 2017 Jan; 33(1):119-121. PubMed ID: 27605103 [TBL] [Abstract][Full Text] [Related]
76. SEED: efficient clustering of next-generation sequences. Bao E; Jiang T; Kaloshian I; Girke T Bioinformatics; 2011 Sep; 27(18):2502-9. PubMed ID: 21810899 [TBL] [Abstract][Full Text] [Related]
77. Fast Supervised Discrete Hashing. Gui J; Liu T; Sun Z; Tao D; Tan T IEEE Trans Pattern Anal Mach Intell; 2018 Feb; 40(2):490-496. PubMed ID: 28287956 [TBL] [Abstract][Full Text] [Related]
78. Next generation sequencing has lower sequence coverage and poorer SNP-detection capability in the regulatory regions. Wang W; Wei Z; Lam TW; Wang J Sci Rep; 2011; 1():55. PubMed ID: 22355574 [TBL] [Abstract][Full Text] [Related]
79. Short Read Mapping: An Algorithmic Tour. Canzar S; Salzberg SL Proc IEEE Inst Electr Electron Eng; 2017 Mar; 105(3):436-458. PubMed ID: 28502990 [TBL] [Abstract][Full Text] [Related]