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.
90 related articles for article (PubMed ID: 11571072)
41. Dealing with errors in interactive sequencing by hybridization. Phan VT; Skiena SS Bioinformatics; 2001 Oct; 17(10):862-70. PubMed ID: 11673230 [TBL] [Abstract][Full Text] [Related]
42. Poisson process approximation for sequence repeats, and sequencing by hybridization. Arratia R; Martin D; Reinert G; Waterman MS J Comput Biol; 1996; 3(3):425-63. PubMed ID: 8891959 [TBL] [Abstract][Full Text] [Related]
43. Can we recover a sequence, just knowing all its subsequences of given length? Guénoche A Comput Appl Biosci; 1992 Dec; 8(6):569-74. PubMed ID: 1468013 [TBL] [Abstract][Full Text] [Related]
44. DNA sequence recognition by hybridization to short oligomers. Milosavljević A J Comput Biol; 1995; 2(2):355-70. PubMed ID: 7497133 [TBL] [Abstract][Full Text] [Related]
45. A string pattern regression algorithm and its application to pattern discovery in long introns. Bannai H; Inenaga S; Shinohara A; Takeda M; Miyano S Genome Inform; 2002; 13():3-11. PubMed ID: 14571369 [TBL] [Abstract][Full Text] [Related]
46. Clone clustering by hybridization. Milosavljević A; Strezoska Z; Zeremski M; Grujić D; Paunesku T; Crkvenjakov R Genomics; 1995 May; 27(1):83-9. PubMed ID: 7665186 [TBL] [Abstract][Full Text] [Related]
47. Sequencing by hybridization of long targets. Qin Y; Schneider TM; Brenner MP PLoS One; 2012; 7(5):e35819. PubMed ID: 22574124 [TBL] [Abstract][Full Text] [Related]
48. An algorithm for the DNA sequence generation from k-tuple word contents of the minimal number of random fragments. Drmanac R; Labat I; Crkvenjakov R J Biomol Struct Dyn; 1991 Apr; 8(5):1085-102. PubMed ID: 1878166 [TBL] [Abstract][Full Text] [Related]
50. EDAR: an efficient error detection and removal algorithm for next generation sequencing data. Zhao X; Palmer LE; Bolanos R; Mircean C; Fasulo D; Wittenberg GM J Comput Biol; 2010 Nov; 17(11):1549-60. PubMed ID: 20973743 [TBL] [Abstract][Full Text] [Related]
51. [Measurement of distances between DNA segments for increasing the effectiveness of sequencing using hybridization on an oligonucleotide matrix]. Lysov IuP; Mironov AA; Gnuchev FN; Chernyĭ AA; Mirzabekov AD Mol Biol (Mosk); 1994; 28(3):652-7. PubMed ID: 8052256 [TBL] [Abstract][Full Text] [Related]
52. Efficient Computation of Longest Common Subsequences with Multiple Substring Inclusive Constraints. Wang X; Wang L; Zhu D J Comput Biol; 2019 Sep; 26(9):938-947. PubMed ID: 30958704 [No Abstract] [Full Text] [Related]
53. An integer programming approach to DNA sequence assembly. Chang Y; Sahinidis NV Comput Biol Chem; 2011 Aug; 35(4):251-8. PubMed ID: 21864794 [TBL] [Abstract][Full Text] [Related]
54. Short superstrings and the structure of overlapping strings. Armen C; Stein C J Comput Biol; 1995; 2(2):307-32. PubMed ID: 7497131 [TBL] [Abstract][Full Text] [Related]
55. A thermodynamic approach to designing structure-free combinatorial DNA word sets. Shortreed MR; Chang SB; Hong D; Phillips M; Campion B; Tulpan DC; Andronescu M; Condon A; Hoos HH; Smith LM Nucleic Acids Res; 2005; 33(15):4965-77. PubMed ID: 16284197 [TBL] [Abstract][Full Text] [Related]
56. 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]