These tools will no longer be maintained as of December 31, 2024. Archived website can be found here. PubMed4Hh GitHub repository can be found here. Contact NLM Customer Service if you have questions.
150 related articles for article (PubMed ID: 17975277)
1. Simplified partial digest problem: enumerative and dynamic programming algorithms. Blazewicz J; Burke E; Kasprzak M; Kovalev A; Kovalyov M IEEE/ACM Trans Comput Biol Bioinform; 2007; 4(4):668-80. PubMed ID: 17975277 [TBL] [Abstract][Full Text] [Related]
2. An exact algorithm for the zero exemplar breakpoint distance problem. Zhu D; Wang L IEEE/ACM Trans Comput Biol Bioinform; 2013; 10(6):1469-77. PubMed ID: 24407305 [TBL] [Abstract][Full Text] [Related]
3. Fast Algorithms for the Simplified Partial Digest Problem. Wang BF J Comput Biol; 2023 Jan; 30(1):41-51. PubMed ID: 35575710 [TBL] [Abstract][Full Text] [Related]
4. GASAT: a genetic local search algorithm for the satisfiability problem. Lardeux F; Saubion F; Hao JK Evol Comput; 2006; 14(2):223-53. PubMed ID: 16831107 [TBL] [Abstract][Full Text] [Related]
10. On the approximation of optimal structures for RNA-RNA interaction. Mneimneh S IEEE/ACM Trans Comput Biol Bioinform; 2009; 6(4):682-8. PubMed ID: 19875865 [TBL] [Abstract][Full Text] [Related]
11. Exemplar longest common subsequence. Bonizzoni P; Della Vedova G; Dondi R; Fertin G; Rizzi R; Vialette S IEEE/ACM Trans Comput Biol Bioinform; 2007; 4(4):535-43. PubMed ID: 17975265 [TBL] [Abstract][Full Text] [Related]
12. 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]
13. Error thresholds in genetic algorithms. Ochoa G Evol Comput; 2006; 14(2):157-82. PubMed ID: 16831105 [TBL] [Abstract][Full Text] [Related]
14. 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]
15. The double digest problem: finding all solutions. Sur-Kolay S; Banerjee S; Mukhopadhyaya S; Murthy CA Int J Bioinform Res Appl; 2009; 5(5):570-92. PubMed ID: 19778871 [TBL] [Abstract][Full Text] [Related]
16. A dynamic programming algorithm for binning microbial community profiles. Ruan Q; Steele JA; Schwalbach MS; Fuhrman JA; Sun F Bioinformatics; 2006 Jun; 22(12):1508-14. PubMed ID: 16567364 [TBL] [Abstract][Full Text] [Related]
17. 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]
18. Algorithms for Pedigree Comparison. Chen ZZ; Feng Q; Shen C; Wang J; Wang L IEEE/ACM Trans Comput Biol Bioinform; 2018; 15(2):422-431. PubMed ID: 27076461 [TBL] [Abstract][Full Text] [Related]
19. DNA sequencing with positive and negative errors. Błazewicz J; Formanowicz P; Kasprzak M; Markiewicz WT; Weglarz J J Comput Biol; 1999; 6(1):113-23. PubMed ID: 10223668 [TBL] [Abstract][Full Text] [Related]
20. A dynamic programming algorithm to predict synthesis processes of tree-structured compounds with graph grammar. Zhao Y; Tamura T; Hayashida M; Akutsu T Genome Inform; 2010; 24():218-29. PubMed ID: 22081602 [TBL] [Abstract][Full Text] [Related] [Next] [New Search]