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.
3. A fast exact sequential algorithm for the partial digest problem. Abbas MM; Bahig HM BMC Bioinformatics; 2016 Dec; 17(Suppl 19):510. PubMed ID: 28155644 [TBL] [Abstract][Full Text] [Related]
4. Complexity and approximability of double digest. Cieliebak M; Eidenbenz S; Woeginger GJ J Bioinform Comput Biol; 2005 Apr; 3(2):207-23. PubMed ID: 15852501 [TBL] [Abstract][Full Text] [Related]
5. Genetic algorithm solution for partial digest problem. Ahrabian H; Ganjtabesh M; Nowzari-Dalini A; Razaghi-Moghadam-Kashani Z Int J Bioinform Res Appl; 2013; 9(6):584-94. PubMed ID: 24084239 [TBL] [Abstract][Full Text] [Related]
6. DDmap: a MATLAB package for the double digest problem using multiple genetic operators. Wang L; Suo J; Pan Y; Li L BMC Bioinformatics; 2019 Jun; 20(1):348. PubMed ID: 31215408 [TBL] [Abstract][Full Text] [Related]
7. PP-DDP: a privacy-preserving outsourcing framework for solving the double digest problem. Suo J; Gu L; Yan X; Yang S; Hu X; Wang L BMC Bioinformatics; 2023 Jan; 24(1):34. PubMed ID: 36721089 [TBL] [Abstract][Full Text] [Related]
8. 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]
9. Equivalence classes for the double-digest problem with coincident cut sites. Martin DR J Comput Biol; 1994; 1(3):241-53. PubMed ID: 8790469 [TBL] [Abstract][Full Text] [Related]
10. Determining restriction digest efficiency using the SNaPshot single-base extension method and CE. Ballantyne KN; van Oorschot RA; Kayser M; Mitchell RJ Electrophoresis; 2007 May; 28(10):1514-7. PubMed ID: 17447234 [TBL] [Abstract][Full Text] [Related]
12. A multilevel probabilistic beam search algorithm for the shortest common supersequence problem. Gallardo JE PLoS One; 2012; 7(12):e52427. PubMed ID: 23300667 [TBL] [Abstract][Full Text] [Related]
13. 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]
14. An Efficient Design for a Multi-objective Evolutionary Algorithm to Generate DNA Libraries Suitable for Computation. Chaves-González JM; Martínez-Gil J Interdiscip Sci; 2019 Sep; 11(3):542-558. PubMed ID: 30168035 [TBL] [Abstract][Full Text] [Related]
15. A DNA solution of SAT problem by a modified sticker model. Yang CN; Yang CB Biosystems; 2005 Jul; 81(1):1-9. PubMed ID: 15917122 [TBL] [Abstract][Full Text] [Related]
16. Discovering Motifs in Biological Sequences Using the Micron Automata Processor. Roy I; Aluru S IEEE/ACM Trans Comput Biol Bioinform; 2016; 13(1):99-111. PubMed ID: 26886735 [TBL] [Abstract][Full Text] [Related]
17. Selecting additional tag SNPs for tolerating missing data in genotyping. Huang YT; Zhang K; Chen T; Chao KM BMC Bioinformatics; 2005 Nov; 6():263. PubMed ID: 16259642 [TBL] [Abstract][Full Text] [Related]
18. An improved heuristic algorithm for finding motif signals in DNA sequences. Huang CW; Lee WS; Hsieh SY IEEE/ACM Trans Comput Biol Bioinform; 2011; 8(4):959-75. PubMed ID: 20855921 [TBL] [Abstract][Full Text] [Related]
19. Sequence assembly validation by multiple restriction digest fragment coverage analysis. Rouchka EC; States DJ Proc Int Conf Intell Syst Mol Biol; 1998; 6():140-7. PubMed ID: 9783219 [TBL] [Abstract][Full Text] [Related]
20. 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] [Next] [New Search]