180 related articles for article (PubMed ID: 19389736)
1. 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]
2. 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]
3. 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]
4. 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]
5. essaMEM: finding maximal exact matches using enhanced sparse suffix arrays.
Vyverman M; De Baets B; Fack V; Dawyndt P
Bioinformatics; 2013 Mar; 29(6):802-4. PubMed ID: 23349213
[TBL] [Abstract][Full Text] [Related]
6. 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]
7. Space efficient computation of rare maximal exact matches between multiple sequences.
Ohlebusch E; Kurtz S
J Comput Biol; 2008 May; 15(4):357-77. PubMed ID: 18361760
[TBL] [Abstract][Full Text] [Related]
8. 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]
9. Efficient estimation of pairwise distances between genomes.
Domazet-Loso M; Haubold B
Bioinformatics; 2009 Dec; 25(24):3221-7. PubMed ID: 19825795
[TBL] [Abstract][Full Text] [Related]
10. Finding Maximal Exact Matches Using the r-Index.
Rossi M; Oliva M; Bonizzoni P; Langmead B; Gagie T; Boucher C
J Comput Biol; 2022 Feb; 29(2):188-194. PubMed ID: 35041518
[TBL] [Abstract][Full Text] [Related]
11. BWA-MEME: BWA-MEM emulated with a machine learning approach.
Jung Y; Han D
Bioinformatics; 2022 Apr; 38(9):2404-2413. PubMed ID: 35253835
[TBL] [Abstract][Full Text] [Related]
12. MONI: A Pangenomic Index for Finding Maximal Exact Matches.
Rossi M; Oliva M; Langmead B; Gagie T; Boucher C
J Comput Biol; 2022 Feb; 29(2):169-187. PubMed ID: 35041495
[TBL] [Abstract][Full Text] [Related]
13. Gclust: A Parallel Clustering Tool for Microbial Genomic Data.
Li R; He X; Dai C; Zhu H; Lang X; Chen W; Li X; Zhao D; Zhang Y; Han X; Niu T; Zhao Y; Cao R; He R; Lu Z; Chi X; Li W; Niu B
Genomics Proteomics Bioinformatics; 2019 Oct; 17(5):496-502. PubMed ID: 31917259
[TBL] [Abstract][Full Text] [Related]
14. 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]
15. 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]
16. Pairwise alignment of nucleotide sequences using maximal exact matches.
Bayat A; Gaëta B; Ignjatovic A; Parameswaran S
BMC Bioinformatics; 2019 May; 20(1):261. PubMed ID: 31113356
[TBL] [Abstract][Full Text] [Related]
17. 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]
18. A Long Fragment Aligner called ALFALFA.
Vyverman M; Baets BD; Fack V; Dawyndt P
BMC Bioinformatics; 2015 May; 16(1):159. PubMed ID: 25971785
[TBL] [Abstract][Full Text] [Related]
19. 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]
20. SplitMEM: a graphical algorithm for pan-genome analysis with suffix skips.
Marcus S; Lee H; Schatz MC
Bioinformatics; 2014 Dec; 30(24):3476-83. PubMed ID: 25398610
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
