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.
2. Fast large scale oligonucleotide selection using the longest common factor approach. Rahmann S J Bioinform Comput Biol; 2003 Jul; 1(2):343-61. PubMed ID: 15290776 [TBL] [Abstract][Full Text] [Related]
3. Supersequences of masks for oligo-chips. Guénoche A J Bioinform Comput Biol; 2004 Sep; 2(3):459-69. PubMed ID: 15359421 [TBL] [Abstract][Full Text] [Related]
4. Selection of long oligonucleotides for gene expression microarrays using weighted rank-sum strategy. Hu G; Llinás M; Li J; Preiser PR; Bozdech Z BMC Bioinformatics; 2007 Sep; 8():350. PubMed ID: 17880708 [TBL] [Abstract][Full Text] [Related]
6. Selecting signature oligonucleotides to identify organisms using DNA arrays. Kaderali L; Schliep A Bioinformatics; 2002 Oct; 18(10):1340-9. PubMed ID: 12376378 [TBL] [Abstract][Full Text] [Related]
7. Oligo Design: a computer program for development of probes for oligonucleotide microarrays. Herold KE; Rasooly A Biotechniques; 2003 Dec; 35(6):1216-21. PubMed ID: 14682056 [TBL] [Abstract][Full Text] [Related]
8. The shortest common supersequence problem in a microarray production setting. Rahmann S Bioinformatics; 2003 Oct; 19 Suppl 2():ii156-61. PubMed ID: 14534185 [TBL] [Abstract][Full Text] [Related]
10. Fast and sensitive probe selection for DNA chips using jumps in matching statistics. Rahmann S Proc IEEE Comput Soc Bioinform Conf; 2003; 2():57-64. PubMed ID: 16452779 [TBL] [Abstract][Full Text] [Related]
11. Selection of oligonucleotide probes for protein coding sequences. Wang X; Seed B Bioinformatics; 2003 May; 19(7):796-802. PubMed ID: 12724288 [TBL] [Abstract][Full Text] [Related]
12. Efficient selection of unique and popular oligos for large EST databases. Zheng J; Close TJ; Jiang T; Lonardi S Bioinformatics; 2004 Sep; 20(13):2101-12. PubMed ID: 15059835 [TBL] [Abstract][Full Text] [Related]
13. Thermodynamic properties of DNA sequences: characteristic values for the human genome. Koehler RT; Peyret N Bioinformatics; 2005 Aug; 21(16):3333-9. PubMed ID: 15947020 [TBL] [Abstract][Full Text] [Related]
14. The distribution and deposition algorithm for multiple oligo nucleotide arrays. Ning K; Leong HW Genome Inform; 2006; 17(2):89-99. PubMed ID: 17503382 [TBL] [Abstract][Full Text] [Related]
15. Decoding non-unique oligonucleotide hybridization experiments of targets related by a phylogenetic tree. Schliep A; Rahmann S Bioinformatics; 2006 Jul; 22(14):e424-30. PubMed ID: 16873503 [TBL] [Abstract][Full Text] [Related]
16. Fast and accurate probe selection algorithm for large genomes. Sung WK; Lee WH Proc IEEE Comput Soc Bioinform Conf; 2003; 2():65-74. PubMed ID: 16452780 [TBL] [Abstract][Full Text] [Related]
18. Optimal robust non-unique probe selection using Integer Linear Programming. Klau GW; Rahmann S; Schliep A; Vingron M; Reinert K Bioinformatics; 2004 Aug; 20 Suppl 1():i186-93. PubMed ID: 15262798 [TBL] [Abstract][Full Text] [Related]
19. OligoSpawn: a software tool for the design of overgo probes from large unigene datasets. Zheng J; Svensson JT; Madishetty K; Close TJ; Jiang T; Lonardi S BMC Bioinformatics; 2006 Jan; 7():7. PubMed ID: 16401345 [TBL] [Abstract][Full Text] [Related]
20. EC_oligos: automated and whole-genome primer design for exons within one or between two genomes. Liu S; Tinker NA; Molnar SJ; Mather DE Bioinformatics; 2004 Dec; 20(18):3668-9. PubMed ID: 15271776 [TBL] [Abstract][Full Text] [Related] [Next] [New Search]