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.
157 related articles for article (PubMed ID: 33609237)
1. An Algorithm for Gene Fragment Reconstruction. Fang N; Wang K; Tong D Interdiscip Sci; 2021 Mar; 13(1):118-127. PubMed ID: 33609237 [TBL] [Abstract][Full Text] [Related]
2. The accuracy of DNA sequences: estimating sequence quality. Churchill GA; Waterman MS Genomics; 1992 Sep; 14(1):89-98. PubMed ID: 1358801 [TBL] [Abstract][Full Text] [Related]
3. 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]
4. Some mathematical aspects of mapping DNA cosmids. Cornette JL; DeLisi C Cell Biophys; 1988; 12():271-93. PubMed ID: 2453284 [TBL] [Abstract][Full Text] [Related]
5. A new algorithm for DNA sequence assembly. Idury RM; Waterman MS J Comput Biol; 1995; 2(2):291-306. PubMed ID: 7497130 [TBL] [Abstract][Full Text] [Related]
7. 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]
8. A computer simulation analysis of the accuracy of partial genome sequencing and restriction fragment analysis in the reconstruction of phylogenetic relationships. Qiao B; Goldberg TL; Olsen GJ; Weigel RM Infect Genet Evol; 2006 Jul; 6(4):323-30. PubMed ID: 16406823 [TBL] [Abstract][Full Text] [Related]
9. A highly accurate heuristic algorithm for the haplotype assembly problem. Deng F; Cui W; Wang L BMC Genomics; 2013; 14 Suppl 2(Suppl 2):S2. PubMed ID: 23445458 [TBL] [Abstract][Full Text] [Related]
10. An algorithm for finding signals of unknown length in DNA sequences. Pavesi G; Mauri G; Pesole G Bioinformatics; 2001; 17 Suppl 1():S207-14. PubMed ID: 11473011 [TBL] [Abstract][Full Text] [Related]
11. 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]
12. A partial digest approach to restriction site mapping. Skiena SS; Sundaram G Proc Int Conf Intell Syst Mol Biol; 1993; 1():362-70. PubMed ID: 7584358 [TBL] [Abstract][Full Text] [Related]
13. A partial digest approach to restriction site mapping. Skiena SS; Sundaram G Bull Math Biol; 1994 Mar; 56(2):275-94. PubMed ID: 8186755 [TBL] [Abstract][Full Text] [Related]