메뉴 건너뛰기




Volumn 34, Issue 1, 2006, Pages 201-205

Application of a superword array in genome assembly

Author keywords

[No Author keywords available]

Indexed keywords

DNA;

EID: 31544479520     PISSN: 03051048     EISSN: 13624962     Source Type: Journal    
DOI: 10.1093/nar/gkj419     Document Type: Article
Times cited : (23)

References (26)
  • 2
    • 0035224746 scopus 로고    scopus 로고
    • Design of a compartmentalized shotgun assembler for the human genome
    • Huson,D.H. et al. (2001) Design of a compartmentalized shotgun assembler for the human genome. Bioinformatics, 17, S132-S139.
    • (2001) Bioinformatics , vol.17
    • Huson, D.H.1
  • 3
    • 0037162885 scopus 로고    scopus 로고
    • Whole-genome shotgun assembly and analysis of the genome of Fugu rubripes
    • Aparicio,S., Chapman,J., Stupka,E., Putnam,N., Chia,J.M. et al. (2002) Whole-genome shotgun assembly and analysis of the genome of Fugu rubripes. Science, 297, 1301-1310.
    • (2002) Science , vol.297 , pp. 1301-1310
    • Aparicio, S.1    Chapman, J.2    Stupka, E.3    Putnam, N.4    Chia, J.M.5
  • 7
    • 0037263854 scopus 로고    scopus 로고
    • The Phusion assembler
    • Mullikin,J.C. and Ning,Z. (2003) The Phusion assembler. Genome Res., 13, 81-90.
    • (2003) Genome Res. , vol.13 , pp. 81-90
    • Mullikin, J.C.1    Ning, Z.2
  • 9
    • 0020053212 scopus 로고
    • Efficient algorithms for folding and comparing nucleic acid sequences
    • Dumas,J.P. and Ninio,J. (1982) Efficient algorithms for folding and comparing nucleic acid sequences. Nucleic Acids Res., 10, 197-206.
    • (1982) Nucleic Acids Res. , vol.10 , pp. 197-206
    • Dumas, J.P.1    Ninio, J.2
  • 10
    • 0023989064 scopus 로고
    • Improved tools for biological sequence comparison
    • Pearson,W.R. and Lipman,D. (1988) Improved tools for biological sequence comparison. Proc. Natl Acad. Sci. USA, 85, 2444-2448.
    • (1988) Proc. Natl Acad. Sci. USA , vol.85 , pp. 2444-2448
    • Pearson, W.R.1    Lipman, D.2
  • 11
    • 0026049278 scopus 로고
    • An efficient algorithm for identifying matches with errors in multiple long molecular sequences
    • Leung,M.Y., Blaisdell,B.E., Burge,C. and Karlin,S. (1991) An efficient algorithm for identifying matches with errors in multiple long molecular sequences. J. Mol. Biol., 221, 1367-1378.
    • (1991) J. Mol. Biol. , vol.221 , pp. 1367-1378
    • Leung, M.Y.1    Blaisdell, B.E.2    Burge, C.3    Karlin, S.4
  • 12
    • 0027681165 scopus 로고
    • Suffix arrays: A new method for on-line string searches
    • Manber,U. and Myers,E.W. (1993) Suffix arrays: A new method for on-line string searches. SIAM J. Comput., 22, 935-948.
    • (1993) SIAM J. Comput. , vol.22 , pp. 935-948
    • Manber, U.1    Myers, E.W.2
  • 13
    • 0036202921 scopus 로고    scopus 로고
    • PatternHunter: Faster and more sensitive homology search
    • Ma,B., Tromp,J. and Li,M. (2002) PatternHunter: Faster and more sensitive homology search. Bioinformatics, 18, 440-445.
    • (2002) Bioinformatics , vol.18 , pp. 440-445
    • Ma, B.1    Tromp, J.2    Li, M.3
  • 15
    • 21044442250 scopus 로고    scopus 로고
    • Engineering a lightweight suffix array construction algorithm
    • Manzini,G. and Ferragina,P. (2004) Engineering a lightweight suffix array construction algorithm. Algorithmica, 40, 33-50.
    • (2004) Algorithmica , vol.40 , pp. 33-50
    • Manzini, G.1    Ferragina, P.2
  • 16
    • 0013087152 scopus 로고    scopus 로고
    • Bio-sequence comparison and applications
    • Jiang,T., Xu,Y. and Zhang,M. (eds), MIT Press, Cambridge
    • Huang,X. (2002) Bio-sequence comparison and applications. In Jiang,T., Xu,Y. and Zhang,M. (eds), Current Topics in Computational Molecular Biology. MIT Press, Cambridge, pp. 45-69.
    • (2002) Current Topics in Computational Molecular Biology , pp. 45-69
    • Huang, X.1
  • 19
    • 3242889975 scopus 로고    scopus 로고
    • Replacing suffix trees with enhanced suffix arrays
    • Abouelhoda,M.I., Kurtz,S. and Ohlebusch,E. (2004) Replacing suffix trees with enhanced suffix arrays. J. Disc. Alg., 2, 53-86.
    • (2004) J. Disc. Alg. , vol.2 , pp. 53-86
    • Abouelhoda, M.I.1    Kurtz, S.2    Ohlebusch, E.3
  • 21
    • 0034764307 scopus 로고    scopus 로고
    • SSAHA: A fast search method for large DNA databases
    • Ning,Z., Cox,A.J. and Mullikin,J.C. (2001) SSAHA: A fast search method for large DNA databases. Genome Res., 11, 1725-1729.
    • (2001) Genome Res. , vol.11 , pp. 1725-1729
    • Ning, Z.1    Cox, A.J.2    Mullikin, J.C.3
  • 22
    • 0036226603 scopus 로고    scopus 로고
    • BLAT: The BLAST-like alignment tool
    • Kent,W.J. (2002) BLAT: The BLAST-like alignment tool. Genome Res., 12, 656-664.
    • (2002) Genome Res. , vol.12 , pp. 656-664
    • Kent, W.J.1
  • 25
    • 0037270315 scopus 로고    scopus 로고
    • AVID: A global alignment program
    • Bray,N., Dubchak,I. and Pachter,L. (2003) AVID: A global alignment program. Genome Res., 13, 97-102.
    • (2003) Genome Res. , vol.13 , pp. 97-102
    • Bray, N.1    Dubchak, I.2    Pachter, L.3
  • 26
    • 0037790561 scopus 로고    scopus 로고
    • Efficient clustering of large EST datasets on parallel computers
    • Kalyanaraman,A., Aluru,A., Kothari,S. and Brendel,V. (2003) Efficient clustering of large EST datasets on parallel computers. Nucleic Acids Res., 31, 2963-2974.
    • (2003) Nucleic Acids Res. , vol.31 , pp. 2963-2974
    • Kalyanaraman, A.1    Aluru, A.2    Kothari, S.3    Brendel, V.4


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