메뉴 건너뛰기




Volumn 12, Issue , 2011, Pages

Ultra-fast sequence clustering from similarity networks with SiLiX

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING QUALITY; COMPARATIVE GENOMICS; GRAPH THEORETICAL APPROACH; HOMOLOGOUS SEQUENCES; PARALLEL VERSION; SEQUENCE CLUSTERING; SIMILARITY NETWORK; SINGLE LINKAGE CLUSTERING;

EID: 79955013072     PISSN: None     EISSN: 14712105     Source Type: Journal    
DOI: 10.1186/1471-2105-12-116     Document Type: Article
Times cited : (224)

References (32)
  • 1
    • 24644474560 scopus 로고    scopus 로고
    • The predictive power of the CluSTr database
    • 10.1093/bioinformatics/bti542, 15961444
    • Petryszak R, Kretschmann E, Wieser D, Apweiler R. The predictive power of the CluSTr database. Bioinformatics 2005, 21:3604-3609. 10.1093/bioinformatics/bti542, 15961444.
    • (2005) Bioinformatics , vol.21 , pp. 3604-3609
    • Petryszak, R.1    Kretschmann, E.2    Wieser, D.3    Apweiler, R.4
  • 3
    • 33746582319 scopus 로고    scopus 로고
    • A phylogenomic gene cluster resource: the Phylogenetically Inferred Groups (PhIGs) database
    • Dehal PS, Boore JL. A phylogenomic gene cluster resource: the Phylogenetically Inferred Groups (PhIGs) database. BMC Bioinformatics 2006, 7.
    • (2006) BMC Bioinformatics , vol.7
    • Dehal, P.S.1    Boore, J.L.2
  • 6
    • 33846063673 scopus 로고    scopus 로고
    • GeneTrees: a phylogenomics resource for prokaryotes
    • Tian Y, Dickerman AW. GeneTrees: a phylogenomics resource for prokaryotes. Nucleic Acids Res 2007, 35:328-331.
    • (2007) Nucleic Acids Res , vol.35 , pp. 328-331
    • Tian, Y.1    Dickerman, A.W.2
  • 8
    • 59949096873 scopus 로고    scopus 로고
    • EnsemblCompara GeneTrees: Complete, duplication-aware phylogenetic trees in vertebrates
    • 2652215, 19029536
    • Vilella AJ, Severin J, Ureta-Vidal A, Heng L, Durbin R, Birney E. EnsemblCompara GeneTrees: Complete, duplication-aware phylogenetic trees in vertebrates. Genome Res 2009, 19:327-335. 2652215, 19029536.
    • (2009) Genome Res , vol.19 , pp. 327-335
    • Vilella, A.J.1    Severin, J.2    Ureta-Vidal, A.3    Heng, L.4    Durbin, R.5    Birney, E.6
  • 10
    • 84864278347 scopus 로고    scopus 로고
    • Using sequence similarity networks for visualization of relationships across diverse protein superfamilies
    • 10.1371/journal.pone.0004345, 2631154, 19190775
    • Atkinson HJ, Morris JH, Ferrin TE, Babbitt PC. Using sequence similarity networks for visualization of relationships across diverse protein superfamilies. PLoS ONE 2009, 4:e4345. 10.1371/journal.pone.0004345, 2631154, 19190775.
    • (2009) PLoS ONE , vol.4
    • Atkinson, H.J.1    Morris, J.H.2    Ferrin, T.E.3    Babbitt, P.C.4
  • 12
    • 0023978556 scopus 로고
    • Divide- and- conquer-based optimal parallel algorithms for some graph problems on EREW PRAM model
    • Das SK, Narsingh D. Divide- and- conquer-based optimal parallel algorithms for some graph problems on EREW PRAM model. IEEE transactions on circuits and systems 1988, 35(3):312-322.
    • (1988) IEEE transactions on circuits and systems , vol.35 , Issue.3 , pp. 312-322
    • Das, S.K.1    Narsingh, D.2
  • 15
    • 0030801002 scopus 로고    scopus 로고
    • Gapped BLAST and PSI-BLAST: a new generation of protein database search programs
    • 10.1093/nar/25.17.3389, 146917, 9254694
    • Altschul SF, Madden TL, Schaffer AA, Zhang J, Zhang Z, Miller W, Lipman DJ. Gapped BLAST and PSI-BLAST: a new generation of protein database search programs. Nucleic Acids Res 1997, 25:3389-3402. 10.1093/nar/25.17.3389, 146917, 9254694.
    • (1997) Nucleic Acids Res , vol.25 , pp. 3389-3402
    • Altschul, S.F.1    Madden, T.L.2    Schaffer, A.A.3    Zhang, J.4    Zhang, Z.5    Miller, W.6    Lipman, D.J.7
  • 16
    • 38249009791 scopus 로고
    • Randomized online graph coloring
    • Vishwanathan S. Randomized online graph coloring. Journal of algorithms 1992, 13:657-669.
    • (1992) Journal of algorithms , vol.13 , pp. 657-669
    • Vishwanathan, S.1
  • 17
    • 0001790593 scopus 로고
    • Depth-first search and linear graph algorithms
    • Tarjan R. Depth-first search and linear graph algorithms. SIAM Journal on Computing 1972, 1(2):146-160.
    • (1972) SIAM Journal on Computing , vol.1 , Issue.2 , pp. 146-160
    • Tarjan, R.1
  • 19
    • 0016495233 scopus 로고
    • Efficiency of a Good But Not Linear Set Union Algorithm
    • Tarjan RE. Efficiency of a Good But Not Linear Set Union Algorithm. Journal of the ACM 1975, 22(2):215-225.
    • (1975) Journal of the ACM , vol.22 , Issue.2 , pp. 215-225
    • Tarjan, R.E.1
  • 22
    • 0025460592 scopus 로고
    • An efficient and fast parallel-connected component algorithm
    • Han Y, Wagner RA. An efficient and fast parallel-connected component algorithm. Journal of the ACM 1990, 37(3):626-642.
    • (1990) Journal of the ACM , vol.37 , Issue.3 , pp. 626-642
    • Han, Y.1    Wagner, R.A.2
  • 25
    • 46249133773 scopus 로고    scopus 로고
    • Efficient algorithms for accurate hierarchical clustering of huge datasets: tackling the entire protein space
    • 10.1093/bioinformatics/btn174, 2718652, 18586742
    • Loewenstein Y, Portugaly E, Fromer M, Linial M. Efficient algorithms for accurate hierarchical clustering of huge datasets: tackling the entire protein space. Bioinformatics 2008, 24:i41-49. 10.1093/bioinformatics/btn174, 2718652, 18586742.
    • (2008) Bioinformatics , vol.24
    • Loewenstein, Y.1    Portugaly, E.2    Fromer, M.3    Linial, M.4
  • 26
    • 0036529479 scopus 로고    scopus 로고
    • An efficient algorithm for large-scale detection of protein families
    • 10.1093/nar/30.7.1575, 101833, 11917018
    • Enright AJ, Van Dongen S, Ouzounis CA. An efficient algorithm for large-scale detection of protein families. Nucleic Acids Res 2002, 30:1575-1584. 10.1093/nar/30.7.1575, 101833, 11917018.
    • (2002) Nucleic Acids Res , vol.30 , pp. 1575-1584
    • Enright, A.J.1    Van Dongen, S.2    Ouzounis, C.A.3
  • 27
    • 66349138035 scopus 로고    scopus 로고
    • Family classification without domain chaining
    • Joseph JM, Durand D. Family classification without domain chaining. Bioinformatics 2009, 25:45-53.
    • (2009) Bioinformatics , vol.25 , pp. 45-53
    • Joseph, J.M.1    Durand, D.2
  • 29
    • 0033561361 scopus 로고    scopus 로고
    • Animal mitochondrial genomes
    • 10.1093/nar/27.8.1767, 148383, 10101183
    • Boore JL. Animal mitochondrial genomes. Nucleic Acids Res 1999, 27:1767-1780. 10.1093/nar/27.8.1767, 148383, 10101183.
    • (1999) Nucleic Acids Res , vol.27 , pp. 1767-1780
    • Boore, J.L.1
  • 30
    • 33846557231 scopus 로고    scopus 로고
    • Comparative genomics of large mitochondria in placozoans
    • 10.1371/journal.pgen.0030013, 1781491, 17222063
    • Signorovitch AY, Buss LW, Dellaporta SL. Comparative genomics of large mitochondria in placozoans. PLoS Genet 2007, 3:e13. 10.1371/journal.pgen.0030013, 1781491, 17222063.
    • (2007) PLoS Genet , vol.3
    • Signorovitch, A.Y.1    Buss, L.W.2    Dellaporta, S.L.3
  • 31
    • 58149178579 scopus 로고    scopus 로고
    • NCBI Reference Sequences: current status, policy and new initiatives
    • 10.1093/nar/gkn721, 2686572, 18927115
    • Pruitt KD, Tatusova T, Klimke W, Maglott DR. NCBI Reference Sequences: current status, policy and new initiatives. Nucleic Acids Res 2009, 37:D32-36. 10.1093/nar/gkn721, 2686572, 18927115.
    • (2009) Nucleic Acids Res , vol.37
    • Pruitt, K.D.1    Tatusova, T.2    Klimke, W.3    Maglott, D.R.4
  • 32
    • 37249051926 scopus 로고    scopus 로고
    • Large scale clustering of protein sequences with FORCE -A layout based heuristic for weighted cluster editing
    • 10.1186/1471-2105-8-396, 2147039, 17941985
    • Wittkop T, Baumbach J, Lobo FP, Rahmann S. Large scale clustering of protein sequences with FORCE -A layout based heuristic for weighted cluster editing. BMC Bioinformatics 2007, 8:396. 10.1186/1471-2105-8-396, 2147039, 17941985.
    • (2007) BMC Bioinformatics , vol.8 , pp. 396
    • Wittkop, T.1    Baumbach, J.2    Lobo, F.P.3    Rahmann, S.4


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