메뉴 건너뛰기




Volumn , Issue , 2004, Pages 301-309

A method for evaluating the quality of string dissimilarity measures and clustering algorithms for EST clustering

Author keywords

Benchmarks; EST clustering; Simulated data; String similarity and dissimilarity measures; Transcriptome

Indexed keywords

CLUSTERING ALGORITHMS; EXPRESSED SEQUENCE TAGS (EST); TRANSCRIPTION;

EID: 4544295407     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/BIBE.2004.1317357     Document Type: Conference Paper
Times cited : (3)

References (22)
  • 2
    • 0029355897 scopus 로고
    • ESTablishing a human transcript map
    • M. Boguski and G. Schuler. ESTablishing a human transcript map. Nature Genetics, 10(11):369-371, 1995.
    • (1995) Nature Genetics , vol.10 , Issue.11 , pp. 369-371
    • Boguski, M.1    Schuler, G.2
  • 3
    • 0032703998 scopus 로고    scopus 로고
    • D2_cluster: A validated method for clustering EST and full-length cDNA sequences
    • J. Burke, D. Davison, and W. Hide. D2_cluster: A validated method for clustering EST and full-length cDNA sequences. Genome Research, 9(11):1135-1142, 1999.
    • (1999) Genome Research , vol.9 , Issue.11 , pp. 1135-1142
    • Burke, J.1    Davison, D.2    Hide, W.3
  • 5
    • 0027942048 scopus 로고
    • GenFrag 2.1: New features for more robust fragment assembly benchmarks
    • M. Engle and C. Burks. GenFrag 2.1: new features for more robust fragment assembly benchmarks. Computer Applications in the Biosciences, 10(5):567-568, 1994.
    • (1994) Computer Applications in the Biosciences , vol.10 , Issue.5 , pp. 567-568
    • Engle, M.1    Burks, C.2
  • 7
    • 4544343744 scopus 로고    scopus 로고
    • ESTSim: A tool for creating benchmarks for EST clustering algorithms
    • School of Computer Science, University of the Wirwatersrand
    • S. Hazelhurst and A. Bergheim. ESTSim: A tool for creating benchmarks for EST clustering algorithms. Technical Report TR-Wits-CS-2003-1, School of Computer Science, University of the Wirwatersrand, 2003. ftp://ftp.os.wits.ac.za/pub/research/ reports/TR-Wits-CS-2003-1.pdf.
    • (2003) Technical Report , vol.TR-WITS-CS-2003-1
    • Hazelhurst, S.1    Bergheim, A.2
  • 11
    • 0037790561 scopus 로고    scopus 로고
    • Efficient clustering of large EST data sets on parallel computers
    • A. Kalyanaraman, S. Aluru, S. Kothari, and V. Brendel. Efficient clustering of large EST data sets on parallel computers. Nucleic Acids Research, 31(11):2963-2974, 2003.
    • (2003) Nucleic Acids Research , vol.31 , Issue.11 , pp. 2963-2974
    • Kalyanaraman, A.1    Aluru, S.2    Kothari, S.3    Brendel, V.4
  • 13
    • 0038494602 scopus 로고    scopus 로고
    • Fast sequence clustering using a suffix array algorithm
    • K. Malde, E. Coward, and I. Jonassen. Fast sequence clustering using a suffix array algorithm. Bioinformatics, 19(10):1221-1226, 2003.
    • (2003) Bioinformatics , vol.19 , Issue.10 , pp. 1221-1226
    • Malde, K.1    Coward, E.2    Jonassen, I.3
  • 15
    • 0345566149 scopus 로고    scopus 로고
    • A guided tour to approximate string matching
    • G. Navarro. A Guided Tour to Approximate String Matching. ACM Computing Surveys, 33(1):31-88, 2001.
    • (2001) ACM Computing Surveys , vol.33 , Issue.1 , pp. 31-88
    • Navarro, G.1
  • 18
    • 85170194974 scopus 로고
    • 2: A measure of sequence dissimilarity
    • G. Bell and T. Marr, editors. Addison-Wesley
    • 2: A measure of sequence dissimilarity. In G. Bell and T. Marr, editors, Computers and DNA, pages 109-125. Addison-Wesley, 1990.
    • (1990) Computers and DNA , pp. 109-125
    • Torney, D.1    Burks, C.2    Davison, D.3    Sirotkin, K.M.4
  • 19
    • 0027113212 scopus 로고
    • Approximate string-matching with q-grams and maximal matches
    • E. Ukkonen. Approximate string-matching with q-grams and maximal matches. Theoretical Computer Science, 92:191-211, 1992.
    • (1992) Theoretical Computer Science , vol.92 , pp. 191-211
    • Ukkonen, E.1
  • 20
    • 0037342499 scopus 로고    scopus 로고
    • Alignment-free sequence comparison - A review
    • S. Vinga and J. Almeida. Alignment-free sequence comparison - a review. Bioinformatics, 19(3):513-524, 2003.
    • (2003) Bioinformatics , vol.19 , Issue.3 , pp. 513-524
    • Vinga, S.1    Almeida, J.2
  • 21
    • 84862416819 scopus 로고    scopus 로고
    • A method for evaluating the quality of string dissimilarity measures and clustering algorithms for EST clustering
    • School of Computer Science, University of the Witwatersrand, Mar.
    • J. Zimmerman, Z. Lipták, and S. Hazelhurst. A Method for Evaluating the Quality of String Dissimilarity Measures and Clustering Algorithms for EST Clustering. Technical Report TR-Wits-CS-2004-0, School of Computer Science, University of the Witwatersrand, Mar. 2004. ftp://ftp.cs.wits.ac.za/pub/research/reports/TR-Wits-CS-2004-0.pdf.
    • (2004) Technical Report , vol.TR-WITS-CS-2004-0
    • Zimmerman, J.1    Lipták, Z.2    Hazelhurst, S.3


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