125 related articles for article (PubMed ID: 30060142)
1. 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]
2. copMEM2: robust and scalable maximum exact match finding.
Grabowski S; Bieniecki W
Bioinformatics; 2023 May; 39(5):. PubMed ID: 37171886
[TBL] [Abstract][Full Text] [Related]
3. 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]
4. 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]
5. Accurate multiple alignment of distantly related genome sequences using filtered spaced word matches as anchor points.
Leimeister CA; Dencker T; Morgenstern B
Bioinformatics; 2019 Jan; 35(2):211-218. PubMed ID: 29992260
[TBL] [Abstract][Full Text] [Related]
6. Allowing mutations in maximal matches boosts genome compression performance.
Liu Y; Wong L; Li J
Bioinformatics; 2020 Sep; 36(18):4675-4681. PubMed ID: 33118018
[TBL] [Abstract][Full Text] [Related]
7. 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]
8. 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]
9. 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]
10. 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]
11. Kmer-db: instant evolutionary distance estimation.
Deorowicz S; Gudys A; Dlugosz M; Kokot M; Danek A
Bioinformatics; 2019 Jan; 35(1):133-136. PubMed ID: 29986074
[TBL] [Abstract][Full Text] [Related]
12. emMAW: computing minimal absent words in external memory.
Héliou A; Pissis SP; Puglisi SJ
Bioinformatics; 2017 Sep; 33(17):2746-2749. PubMed ID: 28407038
[TBL] [Abstract][Full Text] [Related]
13. JustOrthologs: a fast, accurate and user-friendly ortholog identification algorithm.
Miller JB; Pickett BD; Ridge PG
Bioinformatics; 2019 Feb; 35(4):546-552. PubMed ID: 30084941
[TBL] [Abstract][Full Text] [Related]
14. SOPanG: online text searching over a pan-genome.
Cislak A; Grabowski S; Holub J
Bioinformatics; 2018 Dec; 34(24):4290-4292. PubMed ID: 29939210
[TBL] [Abstract][Full Text] [Related]
15. 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]
16. slaMEM: efficient retrieval of maximal exact matches using a sampled LCP array.
Fernandes F; Freitas AT
Bioinformatics; 2014 Feb; 30(4):464-71. PubMed ID: 24336412
[TBL] [Abstract][Full Text] [Related]
17. cath-resolve-hits: a new tool that resolves domain matches suspiciously quickly.
Lewis TE; Sillitoe I; Lees JG
Bioinformatics; 2019 May; 35(10):1766-1767. PubMed ID: 30295745
[TBL] [Abstract][Full Text] [Related]
18. 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]
19. 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]
20. HyAsP, a greedy tool for plasmids identification.
Müller R; Chauve C
Bioinformatics; 2019 Nov; 35(21):4436-4439. PubMed ID: 31116364
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
