메뉴 건너뛰기




Volumn 13, Issue 2, 1997, Pages 137-143

Lassap, a large scale sequence compahson package

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; AMINO ACID SEQUENCE; ARTICLE; COMPARATIVE STUDY; COMPUTER PROGRAM; DATA BASE; PRIORITY JOURNAL;

EID: 0030929643     PISSN: 13674803     EISSN: 14602059     Source Type: Journal    
DOI: 10.1093/bioinformatics/13.2.137     Document Type: Article
Times cited : (72)

References (26)
  • 2
    • 0041002787 scopus 로고
    • Efficient text searching of regular expressions
    • Baeza-Yates, R.A. and Gonnet, G.H. (1989) Efficient text searching of regular expressions. Proc. ICALP, 16, 46-62.
    • (1989) Proc. ICALP , vol.16 , pp. 46-62
    • Baeza-Yates, R.A.1    Gonnet, G.H.2
  • 3
    • 0029916911 scopus 로고    scopus 로고
    • The swiss-prot protein sequence data bank and its new supplement trembl
    • Bairoch, A. and Apweiler.R. (1996) The swiss-prot protein sequence data bank and its new supplement trembl. Nucleic Acids Res., 24, 21—25.
    • (1996) Nucleic Acids Res , vol.24 , pp. 21-25
    • Bairoch, A.1    Apweiler, R.2
  • 4
    • 0026808763 scopus 로고
    • Mapping the whole human genome by fingerprinting yeast artificial chromosomes
    • Bellanne-Chantelot, C. et al. (1992) Mapping the whole human genome by fingerprinting yeast artificial chromosomes. Cell, 70, 1059-1068.
    • (1992) Cell , vol.70 , pp. 1059-1068
    • Bellanne-Chantelot, C.1
  • 5
    • 0017547820 scopus 로고
    • A fast string searching algorithm
    • Boyer.R. and Moore, S. (1977) A fast string searching algorithm. Communications of the ACM, 20, 762-772.
    • (1977) Communications of the ACM , vol.20 , pp. 762-772
    • Boyer, R.1    Moore, S.2
  • 6
    • 21844501850 scopus 로고
    • Parallelism in lassap, a large scale sequence comparisons package
    • Proceedings of HPCN95 Conference, Milan. Springer, Berlin
    • Codani, J.J. and Glemet, E. (1995) Parallelism in lassap, a large scale sequence comparisons package. In Lecture Notes in Computer Science. Springer Verlag, Vol. 919, pp. 787-792. Proceedings of HPCN95 Conference, Milan. Springer, Berlin.
    • (1995) In Lecture Notes in Computer Science. Springer Verlag , vol.919 , pp. 787-792
    • Codani, J.J.1    Glemet, E.2
  • 8
    • 0011239708 scopus 로고    scopus 로고
    • Petah-Tikva, Israel
    • Compugen Ltd (1996) BIOCCELERATOR Manual. Petah-Tikva, Israel
    • (1996) BIOCCELERATOR Manual
  • 9
    • 0025909714 scopus 로고
    • A platform for biological sequence comparison on parallel computers
    • Deshpande, A.S., Richards, D.S. and Pearson, W.R. (1991) A platform for biological sequence comparison on parallel computers. Comput. Applic. Biosci., 7, 237-247.
    • (1991) Comput. Applic. Biosci. , vol.7 , pp. 237-247
    • Deshpande, A.S.1    Richards, D.S.2    Pearson, W.R.3
  • 10
    • 0027457706 scopus 로고
    • Srs—an indexing and retrieval tool for flat file data libraries
    • Etzold, T. and Argos, P. (1993) Srs—an indexing and retrieval tool for flat file data libraries. Comput. Applic. Biosci., 9, 49—57.
    • (1993) Comput. Applic. Biosci. , vol.9 , pp. 49-57
    • Etzold, T.1    Argos, P.2
  • 12
    • 0022118360 scopus 로고
    • Acnuc—a portable retrieval system for nucleic acid sequence databases: Logical and physical designs and usage
    • Gouy, M., Gautier, C, Attimonelli, M., Lanave, C. and DiPaola, G. (1985) Acnuc—a portable retrieval system for nucleic acid sequence databases: logical and physical designs and usage. Comput. Applic. Biosci., 1, 167— 172.
    • (1985) Comput. Applic. Biosci. , vol.1 , pp. 167-172
    • Gouy, M.1    Gautier, C.2    Attimonelli, M.3    Lanave, C.4    Dipaola, G.5
  • 14
    • 0017492836 scopus 로고
    • A fast algorithm for computing longest common subsequences
    • Hunt, J. and Szymanski, T.G. (1977) A fast algorithm for computing longest common subsequences. Theor. Comput. Sci., 20, 350-353.
    • (1977) Theor. Comput. Sci. , vol.20 , pp. 350-353
    • Hunt, J.1    Szymanski, T.G.2
  • 15
    • 0028941606 scopus 로고
    • Implementations of blast for parallel computers
    • Julich.A. (1995) Implementations of blast for parallel computers. Comput. Applic. Biosci., 11, 3-6.
    • (1995) Comput. Applic. Biosci. , vol.11 , pp. 3-6
    • Julich, A.1
  • 17
    • 38249042384 scopus 로고
    • Efficient string matching with k mismatches
    • Landau.G.M. and Vishkin, U. (1986) Efficient string matching with k mismatches. Theor. Comput. Sci., 43, 239-249.
    • (1986) Theor. Comput. Sci. , vol.43 , pp. 239-249
    • Landau, G.M.1    Vishkin, U.2
  • 18
    • 0025977511 scopus 로고
    • Parallel computation and FASTA: Confronting the problem of parallel database search for a fast sequence comparison algorithm
    • Miller.P.L., Nadkarni.P.M. and Carriero.N.M. (1991) Parallel computation and FASTA: confronting the problem of parallel database search for a fast sequence comparison algorithm. Comput. Applic. Biosci., 7, 71-78.
    • (1991) Comput. Applic. Biosci. , vol.7 , pp. 71-78
    • Miller, P.L.1    Nadkarni, P.M.2    Carriero, N.M.3
  • 19
    • 0014757386 scopus 로고
    • A general method applicable to the search for similarities in the amino acid sequence of two proteins
    • Needleman, S.B. and Wunsch, C.D. (1970) A general method applicable to the search for similarities in the amino acid sequence of two proteins. J. Mot. Biol., 48, 443-453.
    • (1970) J. Mot. Biol. , vol.48 , pp. 443-453
    • Needleman, S.B.1    Wunsch, C.D.2
  • 20
    • 0023989064 scopus 로고
    • Improve tools for biological sequence comparison
    • Pearson, W.R. and Lipman.D.J. (1988) Improve 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.J.2
  • 21
    • 0019887799 scopus 로고
    • Identification of common molecular subsequences
    • Smith.T.F. and Waterman.M.S. (1981) Identification of common molecular subsequences./ Mol. Biol., 147, 195-197.
    • (1981) Mol. Biol. , vol.147 , pp. 195-197
    • Smith, T.F.1    Waterman, M.S.2
  • 22
    • 0028218683 scopus 로고
    • Modular arrangement of proteins as inferred from analysis of homology
    • Sonnhammer, E.L.L. and Kahn.D. (1994) Modular arrangement of proteins as inferred from analysis of homology. Protein Sci., 3, 482—492.
    • (1994) Protein Sci , vol.3 , pp. 482-492
    • Sonnhammer, E.L.L.1    Kahn, D.2
  • 23
    • 0028129799 scopus 로고
    • A simple tool to search for sequence motifs that are conserved in blast outputs
    • Tatusov.R.L. and Koonin, E.V. (1994) A simple tool to search for sequence motifs that are conserved in blast outputs. Comput. Applic. Biosci., 10, 457-459.
    • (1994) Comput. Applic. Biosci. , vol.10 , pp. 457-459
    • Tatusov, R.L.1    Koonin, E.V.2
  • 24
    • 0030935244 scopus 로고    scopus 로고
    • Using video oriented instructions to speed-up sequence comparison
    • Wozniak, A. (1997) Using video oriented instructions to speed-up sequence comparison. Comput. Applic. Biosci., 13, 145-150.
    • (1997) Comput. Applic. Biosci. , vol.13 , pp. 145-150
    • Wozniak, A.1
  • 25
    • 85071208724 scopus 로고
    • Fast text Searching whith Errors. Technical Report TR 91-11
    • Wu, S. and Manber, U. (1991) Fast text Searching whith Errors. Technical Report TR 91-11, University of Arizona.
    • (1991) University of Arizona
    • Wu, S.1    Manber, U.2


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