103 related articles for article (PubMed ID: 8374083)
41. A new fast algorithm for solving the minimum spanning tree problem based on DNA molecules computation.
Wang Z; Huang D; Meng H; Tang C
Biosystems; 2013 Oct; 114(1):1-7. PubMed ID: 23871964
[TBL] [Abstract][Full Text] [Related]
42. An Integer Programming Formulation of the Minimum Common String Partition Problem.
Ferdous SM; Rahman MS
PLoS One; 2015; 10(7):e0130266. PubMed ID: 26134848
[TBL] [Abstract][Full Text] [Related]
43. A fast heuristic algorithm for a probe mapping problem.
Mumey B
Proc Int Conf Intell Syst Mol Biol; 1997; 5():191-7. PubMed ID: 9322035
[TBL] [Abstract][Full Text] [Related]
44. Reduced-Size Integer Linear Programming Models for String Selection Problems: Application to the Farthest String Problem.
Zörnig P
J Comput Biol; 2015 Aug; 22(8):729-42. PubMed ID: 25525691
[TBL] [Abstract][Full Text] [Related]
45. Minimum message length encoding and the comparison of macromolecules.
Allison L; Yee CN
Bull Math Biol; 1990; 52(3):431-53. PubMed ID: 2379021
[TBL] [Abstract][Full Text] [Related]
46. HyDA-Vista: towards optimal guided selection of k-mer size for sequence assembly.
Shariat B; Movahedi NS; Chitsaz H; Boucher C
BMC Genomics; 2014; 15 Suppl 10(Suppl 10):S9. PubMed ID: 25558875
[TBL] [Abstract][Full Text] [Related]
47. An Opposition-Based Learning CRO Algorithm for Solving the Shortest Common Supersequence Problem.
Luo F; Chen C; Fuentes J; Li Y; Ding W
Entropy (Basel); 2022 May; 24(5):. PubMed ID: 35626526
[TBL] [Abstract][Full Text] [Related]
48. 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]
49. 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]
50. Efficient string similarity join in multi-core and distributed systems.
Yan C; Zhao X; Zhang Q; Huang Y
PLoS One; 2017; 12(3):e0172526. PubMed ID: 28278177
[TBL] [Abstract][Full Text] [Related]
51. Network orientation via shortest paths.
Silverbush D; Sharan R
Bioinformatics; 2014 May; 30(10):1449-55. PubMed ID: 24470573
[TBL] [Abstract][Full Text] [Related]
52. Deposition and extension approach to find longest common subsequence for thousands of long sequences.
Ning K
Comput Biol Chem; 2010 Jun; 34(3):149-57. PubMed ID: 20570215
[TBL] [Abstract][Full Text] [Related]
53. Optimal algorithms for the interval location problem with range constraints on length and average.
Hsieh YH; Yu CC; Wang BF
IEEE/ACM Trans Comput Biol Bioinform; 2008; 5(2):281-90. PubMed ID: 18451437
[TBL] [Abstract][Full Text] [Related]
54. Fast exact string pattern-matching algorithms adapted to the characteristics of the medical language.
Lovis C; Baud RH
J Am Med Inform Assoc; 2000; 7(4):378-91. PubMed ID: 10887166
[TBL] [Abstract][Full Text] [Related]
55. FSG: Fast String Graph Construction for De Novo Assembly.
Bonizzoni P; Vedova GD; Pirola Y; Previtali M; Rizzi R
J Comput Biol; 2017 Oct; 24(10):953-968. PubMed ID: 28715269
[TBL] [Abstract][Full Text] [Related]
56. 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]
57. 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]
58. String graph construction using incremental hashing.
Ben-Bassat I; Chor B
Bioinformatics; 2014 Dec; 30(24):3515-23. PubMed ID: 25183486
[TBL] [Abstract][Full Text] [Related]
59. Computational complexity of ecological and evolutionary spatial dynamics.
Ibsen-Jensen R; Chatterjee K; Nowak MA
Proc Natl Acad Sci U S A; 2015 Dec; 112(51):15636-41. PubMed ID: 26644569
[TBL] [Abstract][Full Text] [Related]
60. Fitness Probability Distribution of Bit-Flip Mutation.
Chicano F; Sutton AM; Whitley LD; Alba E
Evol Comput; 2015; 23(2):217-48. PubMed ID: 24885680
[TBL] [Abstract][Full Text] [Related]
[Previous] [Next] [New Search]
