메뉴 건너뛰기




Volumn , Issue , 2004, Pages 395-402

An IDC-based algorithm for efficient homology filtration with guaranteed seriate coverage

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATABASE SYSTEMS; DISEASES; DNA; ERROR ANALYSIS; PROTEINS; RNA;

EID: 4544337910     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (5)

References (28)
  • 1
    • 2442592432 scopus 로고    scopus 로고
    • Using transformation techniques towards efficient filtration of string proximity search of biological sequences
    • Department of Computer Science, University of California, Santa Barbara
    • A. Aghili, D. Agrawal, and A. E. Abbadi. Using Transformation Techniques Towards Efficient Filtration of String Proximity Search of Biological Sequences. Technical report 2003-19, Department of Computer Science, University of California, Santa Barbara, 2003.
    • (2003) Technical Report , vol.2003 , Issue.19
    • Aghili, A.1    Agrawal, D.2    Abbadi, A.E.3
  • 5
    • 0141717105 scopus 로고    scopus 로고
    • Better filtering with gapped q-grams
    • to appear special issue on Computing Patterns in Strings
    • S. Burkhardt and J. Karkkainen. Better Filtering with Gapped q-Grams. to appear in Fundamenta Informaticae, special issue on Computing Patterns in Strings, 2003.
    • (2003) Fundamenta Informaticae
    • Burkhardt, S.1    Karkkainen, J.2
  • 8
    • 85170182233 scopus 로고
    • What we have learned and will learn from sequence databases
    • G. Bell and T. Marr, editors, Addison-Wesley
    • R. F. Doolittle. What We Have Learned and Will Learn from Sequence Databases. In G. Bell and T. Marr, editors, Computers and DNA, pages 21-31. Addison-Wesley, 1990.
    • (1990) Computers and DNA , pp. 21-31
    • Doolittle, R.F.1
  • 9
    • 0034708444 scopus 로고    scopus 로고
    • Comparative genomics of the eukaryotes
    • G. M. Rubin et al. Comparative Genomics of the Eukaryotes. Science, 287:2204-2215, 2000.
    • (2000) Science , vol.287 , pp. 2204-2215
    • Rubin, G.M.1
  • 10
    • 0036306157 scopus 로고    scopus 로고
    • SST: An algorithm for finding near-exact sequence matches in time proportional to the logarithm of the database size
    • E. Giladi, M. G. Walker, J. Z. Wang, and W. Volkmuth. SST: an Algorithm for Finding Near-Exact Sequence Matches in Time Proportional to the Logarithm of the Database Size. Bioinformatics, 18(6):873-877, 2002.
    • (2002) Bioinformatics , vol.18 , Issue.6 , pp. 873-877
    • Giladi, E.1    Walker, M.G.2    Wang, J.Z.3    Volkmuth, W.4
  • 11
    • 0032789448 scopus 로고
    • Multiple sequence alignment: Algorithms and applications
    • O. Gotoh. Multiple Sequence Alignment: Algorithms and Applications. Adv. Biophys., 36:159-206, 1994.
    • (1994) Adv. Biophys. , vol.36 , pp. 159-206
    • Gotoh, O.1
  • 14
    • 0036226603 scopus 로고    scopus 로고
    • BLAT: The BLAST-like alignment tool
    • April
    • W. J. Kent. BLAT: The BLAST-Like Alignment Tool. Genome Research, Volume 12, Issue 4, pages 656-664. April 2002.
    • (2002) Genome Research , vol.12 , Issue.4 , pp. 656-664
    • Kent, W.J.1
  • 15
    • 0031876711 scopus 로고    scopus 로고
    • A set-theoretic approach to database searching and clustering
    • A. Krause and M. Vingron. A Set-Theoretic Approach to Database Searching and Clustering. Bioinformatics, 14:430-438, 1998.
    • (1998) Bioinformatics , vol.14 , pp. 430-438
    • Krause, A.1    Vingron, M.2
  • 17
    • 0000513623 scopus 로고
    • Computational molecular biology
    • A. Kent and J. G. Williams, editors, Marcel Dekker, New York
    • A. M. Lesk. Computational Molecular Biology. In A. Kent and J. G. Williams, editors, Encyclopedia of Computer Science and Technology, volume 31, pages 101-165. Marcel Dekker, New York, 1994.
    • (1994) Encyclopedia of Computer Science and Technology , vol.31 , pp. 101-165
    • Lesk, A.M.1
  • 18
    • 0036202921 scopus 로고    scopus 로고
    • PatternHunter: Faster and more sensitive homology search
    • B. Ma, J. Tromp, and M. Li. PatternHunter: Faster and More Sensitive Homology Search. Bioinformatics, 18:440-445, 2002.
    • (2002) Bioinformatics , vol.18 , pp. 440-445
    • Ma, B.1    Tromp, J.2    Li, M.3
  • 19
    • 4544363221 scopus 로고    scopus 로고
    • National Center for Biotechnology Information (NCBI)
    • T. Madden. Personal Communication. National Center for Biotechnology Information (NCBI). 2003.
    • (2003) Personal Communication
    • Madden, T.1
  • 20
    • 0027681165 scopus 로고
    • Suffix arrays: A new method for on-line string searches
    • U. Manber and E. W. Myers. Suffix Arrays: a New Method for On-Line String Searches. SIAM Journal on Computing, 22(5):935-948, 1993.
    • (1993) SIAM Journal on Computing , vol.22 , Issue.5 , pp. 935-948
    • Manber, U.1    Myers, E.W.2
  • 21
    • 0034764307 scopus 로고    scopus 로고
    • SSAHA: A fast search method for large DNA databases
    • October
    • Z. Ning and J. C. Mullikin. SSAHA: A Fast Search Method for Large DNA Databases. Genome Research, Volume 11, Issue 10, pages 1725-1729. October 2001.
    • (2001) Genome Research , vol.11 , Issue.10 , pp. 1725-1729
    • Ning, Z.1    Mullikin, J.C.2
  • 23
    • 0023989064 scopus 로고
    • Improved tools for biological sequence comparison
    • W. R. Pearson and D. J. Lipman. Improved Tools for Biological Sequence Comparison. Proc. Natl. Academy Science, 85:2444-2448, 1988.
    • (1988) Proc. Natl. Academy Science , vol.85 , pp. 2444-2448
    • Pearson, W.R.1    Lipman, D.J.2
  • 25
    • 0019887799 scopus 로고
    • Identification of common molecular subsequences
    • T. F. Smith and M. S. Waterman. Identification of Common Molecular Subsequences. J. Molecular Biology, 147:195-197, 1981.
    • (1981) J. Molecular Biology , vol.147 , pp. 195-197
    • Smith, T.F.1    Waterman, M.S.2
  • 28


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