96 related articles for article (PubMed ID: 11571072)
1. On the complexity of positional sequencing by hybridization.
Ben-Dor A; Pe'er I; Shamir R; Sharan R
J Comput Biol; 2001; 8(4):361-71. PubMed ID: 11571072
[TBL] [Abstract][Full Text] [Related]
2. Positional sequencing by hybridization.
Hannenhalli S; Feldman W; Lewis HF; Skiena SS; Pevzner PA
Comput Appl Biosci; 1996 Feb; 12(1):19-24. PubMed ID: 8670615
[TBL] [Abstract][Full Text] [Related]
3. Optimal sequencing by hybridization in rounds.
Frieze AM; Halldórsson BV
J Comput Biol; 2002; 9(2):355-69. PubMed ID: 12015886
[TBL] [Abstract][Full Text] [Related]
4. Sequencing by hybridization in the presence of hybridization errors.
Doi K; Imai H
Genome Inform Ser Workshop Genome Inform; 2000; 11():53-62. PubMed ID: 11700587
[TBL] [Abstract][Full Text] [Related]
5. Reconstructing strings from substrings.
Skiena SS; Sundaram G
J Comput Biol; 1995; 2(2):333-53. PubMed ID: 7497132
[TBL] [Abstract][Full Text] [Related]
6. Sequencing-by-hybridization at the information-theory bound: an optimal algorithm.
Preparata FP; Upfal E
J Comput Biol; 2000; 7(3-4):621-30. PubMed ID: 11108482
[TBL] [Abstract][Full Text] [Related]
7. An Ultra-Fast and Parallelizable Algorithm for Finding k-Mismatch Shortest Unique Substrings.
Allen DR; Thankachan SV; Xu B
IEEE/ACM Trans Comput Biol Bioinform; 2021; 18(1):138-148. PubMed ID: 31985439
[TBL] [Abstract][Full Text] [Related]
8. Multistage sequencing by hybridization.
Kruglyak S
J Comput Biol; 1998; 5(1):165-71. PubMed ID: 9541879
[TBL] [Abstract][Full Text] [Related]
9. Optimal reconstruction of a sequence from its probes.
Frieze AM; Preparata FP; Upfal E
J Comput Biol; 1999; 6(3-4):361-8. PubMed ID: 10582572
[TBL] [Abstract][Full Text] [Related]
10. 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]
11. Sequential and parallel algorithms for DNA sequencing.
Blazewicz J; Kaczmarek J; Kasprzak M; Markiewicz WT; Weglarz J
Comput Appl Biosci; 1997 Apr; 13(2):151-8. PubMed ID: 9146962
[TBL] [Abstract][Full Text] [Related]
12. Handling long targets and errors in sequencing by hybridization.
Halperin E; Halperin S; Hartman T; Shamir R
J Comput Biol; 2003; 10(3-4):483-97. PubMed ID: 12935339
[TBL] [Abstract][Full Text] [Related]
13. Accurate reconstruction for DNA sequencing by hybridization based on a constructive heuristic.
Chen Y; Hu J
IEEE/ACM Trans Comput Biol Bioinform; 2011; 8(4):1134-40. PubMed ID: 20855925
[TBL] [Abstract][Full Text] [Related]
14. An Algorithm for Sequencing by Hybridization Based on an Alternating DNA Chip.
Radom M; Formanowicz P
Interdiscip Sci; 2018 Sep; 10(3):605-615. PubMed ID: 28247172
[TBL] [Abstract][Full Text] [Related]
15. Reconstruction of DNA sequencing by hybridization.
Zhang JH; Wu LY; Zhang XS
Bioinformatics; 2003 Jan; 19(1):14-21. PubMed ID: 12499288
[TBL] [Abstract][Full Text] [Related]
16. Dealing with repetitions in sequencing by hybridization.
Blazewicz J; Glover F; Kasprzak M; Markiewicz WT; Oğuz C; Rebholz-Schuhmann D; Swiercz A
Comput Biol Chem; 2006 Oct; 30(5):313-20. PubMed ID: 16945587
[TBL] [Abstract][Full Text] [Related]
17. Rearrangements of DNA sequences and SBH.
Pevzner PA
Comput Chem; 1994 Sep; 18(3):221-3. PubMed ID: 7952892
[TBL] [Abstract][Full Text] [Related]
18. The probability of unique solutions of sequencing by hybridization.
Dyer M; Frieze A; Suen S
J Comput Biol; 1994; 1(2):105-10. PubMed ID: 8790457
[TBL] [Abstract][Full Text] [Related]
19. 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]
20. Querying highly similar sequences.
Barton C; Giraud M; Iliopoulos CS; Lecroq T; Mouchard L; Pissis SP
Int J Comput Biol Drug Des; 2013; 6(1-2):119-30. PubMed ID: 23428478
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
