147 related articles for article (PubMed ID: 30958704)
21. Improved Exact Enumerative Algorithms for the Planted (l, d)-Motif Search Problem.
Tanaka S
IEEE/ACM Trans Comput Biol Bioinform; 2014; 11(2):361-74. PubMed ID: 26355783
[TBL] [Abstract][Full Text] [Related]
22. Multithread Multistring Burrows-Wheeler Transform and Longest Common Prefix Array.
Bonizzoni P; Della Vedova G; Pirola Y; Previtali M; Rizzi R
J Comput Biol; 2019 Sep; 26(9):948-961. PubMed ID: 31140836
[No Abstract] [Full Text] [Related]
23. 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]
24. Apache Spark Implementations for String Patterns in DNA Sequences.
Kanavos A; Livieris I; Mylonas P; Sioutas S; Vonitsanos G
Adv Exp Med Biol; 2020; 1194():439-453. PubMed ID: 32468560
[TBL] [Abstract][Full Text] [Related]
25. 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]
26. libFLASM: a software library for fixed-length approximate string matching.
Ayad LA; Pissis SP; Retha A
BMC Bioinformatics; 2016 Nov; 17(1):454. PubMed ID: 27832739
[TBL] [Abstract][Full Text] [Related]
27. Finite width model sequence comparison.
Chia N; Bundschuh R
Phys Rev E Stat Nonlin Soft Matter Phys; 2004 Aug; 70(2 Pt 1):021906. PubMed ID: 15447514
[TBL] [Abstract][Full Text] [Related]
28. New Construction of Family of MLCS Algorithms.
Shi H; Wang J
J Healthc Eng; 2021; 2021():6636710. PubMed ID: 33542799
[TBL] [Abstract][Full Text] [Related]
29. 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]
30. A greedy alignment-free distance estimator for phylogenetic inference.
Thankachan SV; Chockalingam SP; Liu Y; Krishnan A; Aluru S
BMC Bioinformatics; 2017 Jun; 18(Suppl 8):238. PubMed ID: 28617225
[TBL] [Abstract][Full Text] [Related]
31. A Space-Bounded Anytime Algorithm for the Multiple Longest Common Subsequence Problem.
Yang J; Xu Y; Shang Y; Chen G
IEEE Trans Knowl Data Eng; 2014 Nov; 26(11):2599-2609. PubMed ID: 25400485
[TBL] [Abstract][Full Text] [Related]
32. Regular language constrained sequence alignment revisited.
Kucherov G; Pinhas T; Ziv-Ukelson M
J Comput Biol; 2011 May; 18(5):771-81. PubMed ID: 21554020
[TBL] [Abstract][Full Text] [Related]
33. An efficient rank based approach for closest string and closest substring.
Dinu LP; Ionescu R
PLoS One; 2012; 7(6):e37576. PubMed ID: 22675483
[TBL] [Abstract][Full Text] [Related]
34. A hyper-heuristic for the Longest Common Subsequence problem.
Tabataba FS; Mousavi SR
Comput Biol Chem; 2012 Feb; 36():42-54. PubMed ID: 22286085
[TBL] [Abstract][Full Text] [Related]
35. Efficient taxa identification using a pangenome index.
Ahmed O; Rossi M; Boucher C; Langmead B
Genome Res; 2023 Jul; 33(7):1069-1077. PubMed ID: 37258301
[TBL] [Abstract][Full Text] [Related]
36. Reconstructing strings from substrings.
Skiena SS; Sundaram G
J Comput Biol; 1995; 2(2):333-53. PubMed ID: 7497132
[TBL] [Abstract][Full Text] [Related]
37. A Novel Efficient Graph Model for the Multiple Longest Common Subsequences (MLCS) Problem.
Peng Z; Wang Y
Front Genet; 2017; 8():104. PubMed ID: 28848600
[TBL] [Abstract][Full Text] [Related]
38. Merging of multi-string BWTs with applications.
Holt J; McMillan L
Bioinformatics; 2014 Dec; 30(24):3524-31. PubMed ID: 25172922
[TBL] [Abstract][Full Text] [Related]
39. An Efficient Algorithm for the Rooted Triplet Distance Between Galled Trees.
Jansson J; Rajaby R; Sung WK
J Comput Biol; 2019 Sep; 26(9):893-907. PubMed ID: 30990336
[No Abstract] [Full Text] [Related]
40. Cache-oblivious dynamic programming for bioinformatics.
Chowdhury RA; Le HS; Ramachandran V
IEEE/ACM Trans Comput Biol Bioinform; 2010; 7(3):495-510. PubMed ID: 20671320
[TBL] [Abstract][Full Text] [Related]
[Previous] [Next] [New Search]
