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. 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]
3. Fast and compact matching statistics analytics. Cunial F; Denas O; Belazzougui D Bioinformatics; 2022 Mar; 38(7):1838-1845. PubMed ID: 35134833 [TBL] [Abstract][Full Text] [Related]
4. andi: fast and accurate estimation of evolutionary distances between closely related genomes. Haubold B; Klötzl F; Pfaffelhuber P Bioinformatics; 2015 Apr; 31(8):1169-75. PubMed ID: 25504847 [TBL] [Abstract][Full Text] [Related]
5. Efficient computation of absent words in genomic sequences. Herold J; Kurtz S; Giegerich R BMC Bioinformatics; 2008 Mar; 9():167. PubMed ID: 18366790 [TBL] [Abstract][Full Text] [Related]
6. E-MEM: efficient computation of maximal exact matches for very large genomes. Khiste N; Ilie L Bioinformatics; 2015 Feb; 31(4):509-14. PubMed ID: 25399029 [TBL] [Abstract][Full Text] [Related]
7. ADACT: a tool for analysing (dis)similarity among nucleotide and protein sequences using minimal and relative absent words. Akon M; Akon M; Kabir M; Rahman MS; Rahman MS Bioinformatics; 2021 Jun; 37(10):1468-1470. PubMed ID: 33016997 [TBL] [Abstract][Full Text] [Related]
8. A space and time-efficient index for the compacted colored de Bruijn graph. Almodaresi F; Sarkar H; Srivastava A; Patro R Bioinformatics; 2018 Jul; 34(13):i169-i177. PubMed ID: 29949982 [TBL] [Abstract][Full Text] [Related]
9. SAGE2: parallel human genome assembly. Molnar M; Haghshenas E; Ilie L Bioinformatics; 2018 Feb; 34(4):678-680. PubMed ID: 29045591 [TBL] [Abstract][Full Text] [Related]
10. copMEM: finding maximal exact matches via sampling both genomes. Grabowski S; Bieniecki W Bioinformatics; 2019 Feb; 35(4):677-678. PubMed ID: 30060142 [TBL] [Abstract][Full Text] [Related]
11. A framework for space-efficient variable-order Markov models. Cunial F; Alanko J; Belazzougui D Bioinformatics; 2019 Nov; 35(22):4607-4616. PubMed ID: 31004473 [TBL] [Abstract][Full Text] [Related]
12. Absent words and the (dis)similarity analysis of DNA sequences: an experimental study. Rahman MS; Alatabbi A; Athar T; Crochemore M; Rahman MS BMC Res Notes; 2016 Mar; 9():186. PubMed ID: 27004958 [TBL] [Abstract][Full Text] [Related]
13. Sapling: accelerating suffix array queries with learned data models. Kirsche M; Das A; Schatz MC Bioinformatics; 2021 May; 37(6):744-749. PubMed ID: 33107913 [TBL] [Abstract][Full Text] [Related]
14. MetaCache: context-aware classification of metagenomic reads using minhashing. Müller A; Hundt C; Hildebrandt A; Hankeln T; Schmidt B Bioinformatics; 2017 Dec; 33(23):3740-3748. PubMed ID: 28961782 [TBL] [Abstract][Full Text] [Related]
16. FMtree: a fast locating algorithm of FM-indexes for genomic data. Cheng H; Wu M; Xu Y Bioinformatics; 2018 Feb; 34(3):416-424. PubMed ID: 28968761 [TBL] [Abstract][Full Text] [Related]
17. A fast and memory-efficient implementation of the transfer bootstrap. Lutteropp S; Kozlov AM; Stamatakis A Bioinformatics; 2020 Apr; 36(7):2280-2281. PubMed ID: 31755898 [TBL] [Abstract][Full Text] [Related]
18. A spectral algorithm for fast de novo layout of uncorrected long nanopore reads. Recanati A; Brüls T; d'Aspremont A Bioinformatics; 2017 Oct; 33(20):3188-3194. PubMed ID: 28605450 [TBL] [Abstract][Full Text] [Related]
19. BinDash, software for fast genome distance estimation on a typical personal laptop. Zhao X Bioinformatics; 2019 Feb; 35(4):671-673. PubMed ID: 30052763 [TBL] [Abstract][Full Text] [Related]
20. High-speed and high-ratio referential genome compression. Liu Y; Peng H; Wong L; Li J Bioinformatics; 2017 Nov; 33(21):3364-3372. PubMed ID: 28651329 [TBL] [Abstract][Full Text] [Related] [Next] [New Search]