151 related articles for article (PubMed ID: 31985439)
1. An Ultra-Fast and Parallelizable Algorithm for Finding k-Mismatch Shortest Unique Substrings.
Allen DR; Thankachan SV; Xu B
IEEE/ACM Trans Comput Biol Bioinform; 2021; 18(1):138-148. PubMed ID: 31985439
[TBL] [Abstract][Full Text] [Related]
2. Parallel Methods for Finding k-Mismatch Shortest Unique Substrings Using GPU.
Schultz DW; Xu B
IEEE/ACM Trans Comput Biol Bioinform; 2021; 18(1):386-395. PubMed ID: 31425048
[TBL] [Abstract][Full Text] [Related]
3. Fast exact algorithms for the closest string and substring problems with application to the planted (L, d)-motif model.
Chen ZZ; Wang L
IEEE/ACM Trans Comput Biol Bioinform; 2011; 8(5):1400-10. PubMed ID: 21282867
[TBL] [Abstract][Full Text] [Related]
4. A Provably Efficient Algorithm for the k-Mismatch Average Common Substring Problem.
Thankachan SV; Apostolico A; Aluru S
J Comput Biol; 2016 Jun; 23(6):472-82. PubMed ID: 27058840
[TBL] [Abstract][Full Text] [Related]
5. On the complexity of positional sequencing by hybridization.
Ben-Dor A; Pe'er I; Shamir R; Sharan R
J Comput Biol; 2001; 8(4):361-71. PubMed ID: 11571072
[TBL] [Abstract][Full Text] [Related]
6. An O(N2) algorithm for discovering optimal Boolean pattern pairs.
Bannai H; Hyyrö H; Shinohara A; Takeda M; Nakai K; Miyano S
IEEE/ACM Trans Comput Biol Bioinform; 2004; 1(4):159-70. PubMed ID: 17051698
[TBL] [Abstract][Full Text] [Related]
7. Genome comparison without alignment using shortest unique substrings.
Haubold B; Pierstorff N; Möller F; Wiehe T
BMC Bioinformatics; 2005 May; 6():123. PubMed ID: 15910684
[TBL] [Abstract][Full Text] [Related]
8. Finding optimal threshold for correction error reads in DNA assembling.
Chin FY; Leung HC; Li WL; Yiu SM
BMC Bioinformatics; 2009 Jan; 10 Suppl 1(Suppl 1):S15. PubMed ID: 19208114
[TBL] [Abstract][Full Text] [Related]
9. 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]
10. Encoded expansion: an efficient algorithm to discover identical string motifs.
Azmi AM; Al-Ssulami A
PLoS One; 2014; 9(5):e95148. PubMed ID: 24871320
[TBL] [Abstract][Full Text] [Related]
11. Efficient sequential and parallel algorithms for finding edit distance based motifs.
Pal S; Xiao P; Rajasekaran S
BMC Genomics; 2016 Aug; 17 Suppl 4(Suppl 4):465. PubMed ID: 27557423
[TBL] [Abstract][Full Text] [Related]
12. Towards a HPC-oriented parallel implementation of a learning algorithm for bioinformatics applications.
D'Angelo G; Rampone S
BMC Bioinformatics; 2014; 15 Suppl 5(Suppl 5):S2. PubMed ID: 25077818
[TBL] [Abstract][Full Text] [Related]
13. KMC 2: fast and resource-frugal k-mer counting.
Deorowicz S; Kokot M; Grabowski S; Debudaj-Grabysz A
Bioinformatics; 2015 May; 31(10):1569-76. PubMed ID: 25609798
[TBL] [Abstract][Full Text] [Related]
14. 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]
15. Efficient Computation of Longest Common Subsequences with Multiple Substring Inclusive Constraints.
Wang X; Wang L; Zhu D
J Comput Biol; 2019 Sep; 26(9):938-947. PubMed ID: 30958704
[No Abstract] [Full Text] [Related]
16. Querying highly similar sequences.
Barton C; Giraud M; Iliopoulos CS; Lecroq T; Mouchard L; Pissis SP
Int J Comput Biol Drug Des; 2013; 6(1-2):119-30. PubMed ID: 23428478
[TBL] [Abstract][Full Text] [Related]
17. An algorithm for approximate tandem repeats.
Landau GM; Schmidt JP; Sokol D
J Comput Biol; 2001; 8(1):1-18. PubMed ID: 11339903
[TBL] [Abstract][Full Text] [Related]
18. An OpenMP-based tool for finding longest common subsequence in bioinformatics.
Shikder R; Thulasiraman P; Irani P; Hu P
BMC Res Notes; 2019 Apr; 12(1):220. PubMed ID: 30971295
[TBL] [Abstract][Full Text] [Related]
19. Efficient parallel and out of core algorithms for constructing large bi-directed de Bruijn graphs.
Kundeti VK; Rajasekaran S; Dinh H; Vaughn M; Thapar V
BMC Bioinformatics; 2010 Nov; 11():560. PubMed ID: 21078174
[TBL] [Abstract][Full Text] [Related]
20. 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]
[Next] [New Search]
