Computing highly specific and mismatch tolerant oligomers efficiently

Proceedings of the 2003 IEEE Bioinformatics Conference, CSB 2003

Volumn , Issue , 2003, Pages 316-325

  Yamada, T ^a   Morishita, S ^a  

^a UNIVERSITY OF TOKYO   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BIOINFORMATICS; DYNAMIC PROGRAMMING; GENE ENCODING; GENES; NUCLEIC ACIDS; POLYMERASE CHAIN REACTION;

DYNAMIC PROGRAMMING ALGORITHM; EST DATABASE; EXPRESSED SEQUENCE TAGS; HUMAN GENOMES; ORDERS OF MAGNITUDE; PCR PRIMERS; TARGET SEQUENCES;

OLIGOMERS;

EID: 84960379733     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CSB.2003.1227332     Document Type: Conference Paper

References (16)

1. K. Abrahamson. Generalized string matching. SIAM Journal on Computing, 16(6):1039-1051, 1987.
2. A. Amir, M. Lewenstein, and E. Porat. Faster algorithms for string matching with k mismatches. In Symposium on Discrete Algorithms, pages 794-803, 2000.
3. M. A. Bender and M. Farach-Colton. The LCA problem revisited. In Latin American Theoretical Informatics, pages 88-94, 2000.
4. P. Brown and D. Botstein. Exploring the new world of the genome with dna microarrays. Nature Genetics, 21:33-37, 2000.
5. I. H. G. S. Consortium. Initial sequencing and analysis of the human genome. Nature, 409(6822):860-921, 2001.
6. M. G. S. Consortium. Initial sequencing and comparative analysis of the mouse genome. Nature, 420(6915):520-62, 2002.
7. G. Dan. In Algorithms on strings, trees, and sequences. Cambridge University Press.
8. J. Feigenbaum, S. Kannan, M. Strauss, and M. Viswanathan. An approximate l1-difference algorithm for massive data streams. In Proc. of the 40th IEEE Annual Symposium on Foundations of Computer Science (FOCS1999), 1999.
9. L. Kaderali and A. Schliep. Selecting signature oligonucleotides to identify organisms using dna arrays. Bioinformatics, 18(10):1340-1349, 2002.
10. T. Kasai, G. Lee, H. Arimura, S. Arikawa, and K. Park. Linear-time longest-common-prefix computation in suffix arrays and its applications. In Proc. of the 12th Annual Symposium on Combinatorial Pattern Matching (CPM2001), 2001.
11. F. Li and G. Stormo. Selection of optimal dna oligos for gene expression arrays. Bioinformatics, 17(11):1067-1076, 2001.
12. U. Manber and G. Myers. Suffix arrays: a new method for on-line string searches. SIAM Journal on Computing, 22(5):935-948, 1993.
13. S. Muthukrishnan and S. C. Sahinalp. Approximate nearest neighbors and sequence comparison with block operations. In Proceedings of the thirty-second annual ACM symposium on Theory of computing, pages 416-424. ACM Press, 2000.
14. S. Muthukrishnan and S. C. Sahinalp. Simple and practical sequence nearest neighbors under block edit operations. In Proc. of the 13th Annual Symposium on Combinatorial Pattern Matching (CPM2002), 2002.
15. J.-M. Rouillard, C. J. Herbert, and M. Zuker. Oligoarray: genome-scale oligonucleotide design for microarrays. Bioinformatics, 18(3):486-487, 2002.
16. R. Sven. Rapid large-scale oligonucleotide selection for microarrays. In Proc. of the First IEEE Computer Society Bioinformatics Conference (CSB'02), 2002.