150 related articles for article (PubMed ID: 22369457)
21. EMMA: an efficient massive mapping algorithm using improved approximate mapping filtering.
Zhang X; Cao ZW; Lin ZX; Wang QK; Li YX
Acta Biochim Biophys Sin (Shanghai); 2006 Dec; 38(12):857-64. PubMed ID: 17151779
[TBL] [Abstract][Full Text] [Related]
22. Localized suffix array and its application to genome mapping problems for paired-end short reads.
Kimura K; Koike A
Genome Inform; 2009 Oct; 23(1):60-71. PubMed ID: 20180262
[TBL] [Abstract][Full Text] [Related]
23. BatMis: a fast algorithm for k-mismatch mapping.
Tennakoon C; Purbojati RW; Sung WK
Bioinformatics; 2012 Aug; 28(16):2122-8. PubMed ID: 22689389
[TBL] [Abstract][Full Text] [Related]
24. Fast and accurate phylogeny reconstruction using filtered spaced-word matches.
Leimeister CA; Sohrabi-Jahromi S; Morgenstern B
Bioinformatics; 2017 Apr; 33(7):971-979. PubMed ID: 28073754
[TBL] [Abstract][Full Text] [Related]
25. Large-Scale Person Re-Identification Based on Deep Hash Learning.
Ma XQ; Yu CC; Chen XX; Zhou L
Entropy (Basel); 2019 Apr; 21(5):. PubMed ID: 33267163
[TBL] [Abstract][Full Text] [Related]
26. Seeding with minimized subsequence.
Li X; Shi Q; Chen K; Shao M
Bioinformatics; 2023 Jun; 39(39 Suppl 1):i232-i241. PubMed ID: 37387132
[TBL] [Abstract][Full Text] [Related]
27. The WM-q multiple exact string matching algorithm for DNA sequences.
Karcioglu AA; Bulut H
Comput Biol Med; 2021 Sep; 136():104656. PubMed ID: 34333228
[TBL] [Abstract][Full Text] [Related]
28. Computation of rank and select functions on hierarchical binary string and its application to genome mapping problems for short-read DNA sequences.
Kimura K; Suzuki Y; Sugano S; Koike A
J Comput Biol; 2009 Nov; 16(11):1601-13. PubMed ID: 19772398
[TBL] [Abstract][Full Text] [Related]
29. Mapping RNA-seq reads to transcriptomes efficiently based on learning to hash method.
Yu X; Liu X
Comput Biol Med; 2020 Jan; 116():103539. PubMed ID: 31765913
[TBL] [Abstract][Full Text] [Related]
30. An efficient Burrows-Wheeler transform-based aligner for short read mapping.
Guo L; Huo H
Comput Biol Chem; 2024 Jun; 110():108050. PubMed ID: 38447272
[TBL] [Abstract][Full Text] [Related]
31. ProGeRF: proteome and genome repeat finder utilizing a fast parallel hash function.
Lopes Rda S; Moraes WJ; Rodrigues Tde S; Bartholomeu DC
Biomed Res Int; 2015; 2015():394157. PubMed ID: 25811026
[TBL] [Abstract][Full Text] [Related]
32. Algorithms for mapping short degenerate and weighted sequences to a reference genome.
Antoniou P; Iliopoulos CS; Mouchard L; Pissis SP
Int J Comput Biol Drug Des; 2009; 2(4):385-97. PubMed ID: 20090178
[TBL] [Abstract][Full Text] [Related]
33. KmerKeys: a web resource for searching indexed genome assemblies and variants.
Pavlichin DS; Lee H; Greer SU; Grimes SM; Weissman T; Ji HP
Nucleic Acids Res; 2022 Jul; 50(W1):W448-W453. PubMed ID: 35474383
[TBL] [Abstract][Full Text] [Related]
34. The GNUMAP algorithm: unbiased probabilistic mapping of oligonucleotides from next-generation sequencing.
Clement NL; Snell Q; Clement MJ; Hollenhorst PC; Purwar J; Graves BJ; Cairns BR; Johnson WE
Bioinformatics; 2010 Jan; 26(1):38-45. PubMed ID: 19861355
[TBL] [Abstract][Full Text] [Related]
35. 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]
36. rHAT: fast alignment of noisy long reads with regional hashing.
Liu B; Guan D; Teng M; Wang Y
Bioinformatics; 2016 Jun; 32(11):1625-31. PubMed ID: 26568628
[TBL] [Abstract][Full Text] [Related]
37. Objective and comprehensive evaluation of bisulfite short read mapping tools.
Tran H; Porter J; Sun MA; Xie H; Zhang L
Adv Bioinformatics; 2014; 2014():472045. PubMed ID: 24839440
[TBL] [Abstract][Full Text] [Related]
38. CHTKC: a robust and efficient k-mer counting algorithm based on a lock-free chaining hash table.
Wang J; Chen S; Dong L; Wang G
Brief Bioinform; 2021 May; 22(3):. PubMed ID: 32438416
[TBL] [Abstract][Full Text] [Related]
39. PRIMEX: rapid identification of oligonucleotide matches in whole genomes.
Lexa M; Valle G
Bioinformatics; 2003 Dec; 19(18):2486-8. PubMed ID: 14668240
[TBL] [Abstract][Full Text] [Related]
40. A bit-parallel dynamic programming algorithm suitable for DNA sequence alignment.
Kimura K; Koike A; Nakai K
J Bioinform Comput Biol; 2012 Aug; 10(4):1250002. PubMed ID: 22809415
[TBL] [Abstract][Full Text] [Related]
[Previous] [Next] [New Search]
