메뉴 건너뛰기




Volumn 2676, Issue , 2003, Pages 384-401

Efficient selection of unique and popular oligos for large EST databases

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GENES; HEURISTIC ALGORITHMS; LIBRARIES; OLIGONUCLEOTIDES; PATTERN MATCHING;

EID: 35248814319     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44888-8_28     Document Type: Article
Times cited : (1)

References (27)
  • 2
    • 0027249595 scopus 로고
    • dbEST-database for "expressed sequence tags"
    • Boguski, M., Lowe, T., Tolstoshev, C.: dbEST-database for "expressed sequence tags". Nat. Genet. 4 (1993) 332-3
    • (1993) Nat. Genet. , vol.4 , pp. 332-333
    • Boguski, M.1    Lowe, T.2    Tolstoshev, C.3
  • 4
    • 0009788252 scopus 로고    scopus 로고
    • Genetically and physically anchored EST resources for barley genomics
    • Close, T., Wing, R., Kleinhofs, A., Wise, R.: Genetically and physically anchored EST resources for barley genomics. Barley Genetics Newsletter 31 (2001) 29-30
    • (2001) Barley Genetics Newsletter , vol.31 , pp. 29-30
    • Close, T.1    Wing, R.2    Kleinhofs, A.3    Wise, R.4
  • 5
    • 0036944499 scopus 로고    scopus 로고
    • Est analysis in barley defines a unigene set comprising 4,000 genes
    • Michalek, W., Weschke, W., Pleissner, K., Graner, A.: Est analysis in barley defines a unigene set comprising 4,000 genes. Theor Appl Genet 104 (2002) 97-103
    • (2002) Theor Appl Genet , vol.104 , pp. 97-103
    • Michalek, W.1    Weschke, W.2    Pleissner, K.3    Graner, A.4
  • 6
    • 0032849859 scopus 로고    scopus 로고
    • CAP3: A DNA sequence assembly program
    • Huang, X., Madan, A.: CAP3: A DNA sequence assembly program. Genome Research 9 (1999) 868-877
    • (1999) Genome Research , vol.9 , pp. 868-877
    • Huang, X.1    Madan, A.2
  • 10
    • 0002759539 scopus 로고
    • Unsupervised learning of multiple motifs in biopolymers using expectation maximization
    • Bailey, T.L., Elkan, C.: Unsupervised learning of multiple motifs in biopolymers using expectation maximization. Machine Learning 21 (1995) 51-80
    • (1995) Machine Learning , vol.21 , pp. 51-80
    • Bailey, T.L.1    Elkan, C.2
  • 11
    • 0029159799 scopus 로고
    • Finding flexible patterns in unaligned protein sequences
    • Jonassen, I., Collins, J.F., Higgins, D.G.: Finding flexible patterns in unaligned protein sequences. Protein Science 4 (1995) 1587-1595
    • (1995) Protein Science , vol.4 , pp. 1587-1595
    • Jonassen, I.1    Collins, J.F.2    Higgins, D.G.3
  • 12
    • 0030670589 scopus 로고    scopus 로고
    • Efficient discovery of conserved patterns using a pattern graph
    • Jonassen, I., Efficient discovery of conserved patterns using a pattern graph. Comput. Appl. Biosci. 13 (1997) 509-522
    • (1997) Comput. Appl. Biosci. , vol.13 , pp. 509-522
    • Jonassen, I.1
  • 13
    • 0031684427 scopus 로고    scopus 로고
    • Combinatorial pattern discovery in biological sequences: The TEIRESIAS algorithm
    • Rigoutsos, I., Floratos, A.: Combinatorial pattern discovery in biological sequences: The TEIRESIAS algorithm. Bioinformatics 14 (1998) 55-67
    • (1998) Bioinformatics , vol.14 , pp. 55-67
    • Rigoutsos, I.1    Floratos, A.2
  • 14
    • 0032826179 scopus 로고    scopus 로고
    • Identifying DNA and protein patterns with statistically significant alignments of multiple sequences
    • Hertz, G., Stormo, G.: Identifying DNA and protein patterns with statistically significant alignments of multiple sequences. Bioinformatics 15 (1999) 563-577
    • (1999) Bioinformatics , vol.15 , pp. 563-577
    • Hertz, G.1    Stormo, G.2
  • 15
  • 16
    • 0029144601 scopus 로고
    • Gibbs motif sampling: Detecting bacterial outer membrane protein repeats
    • Neuwald, A., Liu, J., Lawrence, C.: Gibbs motif sampling: Detecting bacterial outer membrane protein repeats. Protein Science 4 (1995) 1618-1632
    • (1995) Protein Science , vol.4 , pp. 1618-1632
    • Neuwald, A.1    Liu, J.2    Lawrence, C.3
  • 20
    • 0036110853 scopus 로고    scopus 로고
    • Finding motifs using random projections
    • Buhler, J., Tompa, M.: Finding motifs using random projections. J. Comput. Bio. 9 (2002) 225-242
    • (2002) J. Comput. Bio. , vol.9 , pp. 225-242
    • Buhler, J.1    Tompa, M.2
  • 21
    • 0036375939 scopus 로고    scopus 로고
    • Monotony of surprise and large-scale quest for unusual words
    • extended abstract. In Myers, G., Hannenhalli, S., Istrail, S., Pevzner, P., Waterman, M., eds.: Washington, DC
    • Apostolico, A., Bock, M.E., Lonardi, S.: Monotony of surprise and large-scale quest for unusual words (extended abstract). In Myers, G., Hannenhalli, S., Istrail, S., Pevzner, P., Waterman, M., eds.: Proc. of Research in Computational Molecular Biology (RECOMB), Washington, DC (2002)
    • (2002) Proc. of Research in Computational Molecular Biology (RECOMB)
    • Apostolico, A.1    Bock, M.E.2    Lonardi, S.3
  • 22
    • 20244362407 scopus 로고    scopus 로고
    • Finding composite regulatory patterns in DNA sequences
    • Proc. of the International Conference on Intelligent Systems for Molecular Biology, AAAI press, Menlo Park, CA
    • Eskin, E., Pevzner, P.A.: Finding composite regulatory patterns in DNA sequences. In: Proc. of the International Conference on Intelligent Systems for Molecular Biology, AAAI press, Menlo Park, CA (2002) Bioinformatics S181-S188
    • (2002) Bioinformatics
    • Eskin, E.1    Pevzner, P.A.2
  • 23
    • 0035190608 scopus 로고    scopus 로고
    • Selection of optimal DNA oligos for gene expression arrays
    • Li, F., Stormo, G.D.: Selection of optimal DNA oligos for gene expression arrays. Bionformatics 17 (2001) 1067-1076
    • (2001) Bionformatics , vol.17 , pp. 1067-1076
    • Li, F.1    Stormo, G.D.2
  • 24
    • 0036208669 scopus 로고    scopus 로고
    • Oligoarray: Genome-scale oligonucleotide design for microarrays
    • Rouillard, J.M., Herbert, C.J., Zuker, M.: Oligoarray: Genome-scale oligonucleotide design for microarrays. Bioinformatics 18 (2002) 486-487
    • (2002) Bioinformatics , vol.18 , pp. 486-487
    • Rouillard, J.M.1    Herbert, C.J.2    Zuker, M.3
  • 27
    • 84948947813 scopus 로고
    • Polynomial-time algorithms for computing characteristic strings
    • Crochemore, M., Gusfield, D., eds.: Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching. Number 807 Asilomar, CA, Springer-Verlag, Berlin
    • Ito, M., Shimizu, K., Nakanishi, M., Hashimoto, A.: Polynomial-time algorithms for computing characteristic strings. In Crochemore, M., Gusfield, D., eds.: Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching. Number 807 in Lecture Notes in Computer Science, Asilomar, CA, Springer-Verlag, Berlin (1994) 274-288
    • (1994) Lecture Notes in Computer Science , pp. 274-288
    • Ito, M.1    Shimizu, K.2    Nakanishi, M.3    Hashimoto, A.4


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.