메뉴 건너뛰기




Volumn 45, Issue 3, 2006, Pages 337-375

FastLSA: A fast, linear-space, parallel and sequential algorithm for sequence alignment

Author keywords

Bioinformatics; Computational biology; Homology search; Linear space; Parallel and sequential algorithms; Sequence alignment

Indexed keywords

COMPUTATION THEORY; COMPUTER PROGRAMMING; DNA; PROGRAM PROCESSORS; PROTEINS;

EID: 33745046174     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/s00453-006-1217-y     Document Type: Article
Times cited : (17)

References (21)
  • 2
    • 0028240897 scopus 로고
    • A new generation of information retrieval tools for biologists: The example of the ExPASy WWW server
    • R. D. Appel, A. Bairoch, and D. F. Hochstrasser. A new generation of information retrieval tools for biologists: the example of the ExPASy WWW server. Trends in Biochemical Sciences, 19:258-260, 1994. http://ca.expasy.org/ sprot/.
    • (1994) Trends in Biochemical Sciences , vol.19 , pp. 258-260
    • Appel, R.D.1    Bairoch, A.2    Hochstrasser, D.F.3
  • 3
    • 25844438746 scopus 로고
    • Ph.D. thesis, Department of Computer Science, Indiana University
    • P. G. Bradford. Parallel Dynamic Programming. Ph.D. thesis, Department of Computer Science, Indiana University, 1994.
    • (1994) Parallel Dynamic Programming
    • Bradford, P.G.1
  • 7
    • 0036606576 scopus 로고    scopus 로고
    • Fast algorithms for large-scale genome alignment and comparison
    • A. L. Delcher, A. Phillippy, J. Carlton, and S. L. Salzberg. Fast algorithms for large-scale genome alignment and comparison. Nucleic Acids Research, 30(11):2478-2483, 2002.
    • (2002) Nucleic Acids Research , vol.30 , Issue.11 , pp. 2478-2483
    • Delcher, A.L.1    Phillippy, A.2    Carlton, J.3    Salzberg, S.L.4
  • 10
    • 0016518550 scopus 로고
    • A linear space algorithm for computing longest common subsequences
    • D. S. Hirschberg. A linear space algorithm for computing longest common subsequences. Communications of the ACM, 18:341-343, 1975.
    • (1975) Communications of the ACM , vol.18 , pp. 341-343
    • Hirschberg, D.S.1
  • 14
    • 0023984847 scopus 로고
    • Optimal alignments in linear space
    • E. Myers and W. Miller. Optimal alignments in linear space. CABIOS, 4:11-17, 1988.
    • (1988) CABIOS , vol.4 , pp. 11-17
    • Myers, E.1    Miller, W.2
  • 15
    • 0014757386 scopus 로고
    • A general method applicable to the search of similarities in the amino acid sequence of two proteins
    • S. B. Needleman and C. D. Wunsch. A general method applicable to the search of similarities in the amino acid sequence of two proteins. Journal of Molecular Biology, 48:443-453, 1970.
    • (1970) Journal of Molecular Biology , vol.48 , pp. 443-453
    • Needleman, S.B.1    Wunsch, C.D.2
  • 16
    • 33745013294 scopus 로고    scopus 로고
    • Penn State University. Bioinformatics Group. http://bio.cse.psu.edu, 2001.
    • (2001)
  • 17
    • 33745056154 scopus 로고    scopus 로고
    • Penn State University. Bioinformatics Group. TCR sequences. http://bio.cse.psu.edu/pipmaker/examples.html, 2001.
    • (2001) TCR Sequences
  • 18
    • 33745025414 scopus 로고    scopus 로고
    • Bioinformatics Group Penn State University. XRCC1 and Myosin sequences. http://globin.cse.psu.edu/globin/html/pip/examples.html, 2001.
    • (2001) XRCC1 and Myosin Sequences
  • 20
    • 0019887799 scopus 로고
    • Identification of common molecular subsequences
    • T. F. Smith and M. S. Waterman. Identification of common molecular subsequences. Journal of Molecular Biology, 147:195-197, 1981.
    • (1981) Journal of Molecular Biology , vol.147 , pp. 195-197
    • Smith, T.F.1    Waterman, M.S.2
  • 21
    • 33745029692 scopus 로고    scopus 로고
    • Veridian Systems. PBS. http://www.pbspro.com, 2001.
    • (2001)


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