메뉴 건너뛰기




Volumn , Issue , 2003, Pages 149-157

Filtration of string proximity search via transformation

Author keywords

[No Author keywords available]

Indexed keywords

DISCRETE FOURIER TRANSFORMS; DISCRETE WAVELET TRANSFORMS; ECONOMIC AND SOCIAL EFFECTS; HEURISTIC ALGORITHMS;

EID: 4544363220     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/BIBE.2003.1188941     Document Type: Conference Paper
Times cited : (10)

References (21)
  • 2
    • 0002139526 scopus 로고
    • The myriad virtues of subword trees
    • NATO ISI Series, Springer-Verlag
    • A. Apostolico. The myriad virtues of subword trees. Combinatorial Algorithms on Words, NATO ISI Series, Springer- Verlag, pages 85-96, 1985.
    • (1985) Combinatorial Algorithms on Words , pp. 85-96
    • Apostolico, A.1
  • 5
    • 84937413030 scopus 로고    scopus 로고
    • A metric index for approximate string matching
    • E. Chavez and G. Navarro. A metric index for approximate string matching. In LATIN, pages 181-195, 2002.
    • (2002) LATIN , pp. 181-195
    • Chavez, E.1    Navarro, G.2
  • 6
    • 0000228203 scopus 로고
    • A model of evolutionary change in proteins
    • National Biomedical Research Foundation, Washington, DC
    • M. O. Dayhoff, R. M. Schwartz, and B. C. Orcutt. A model of evolutionary change in proteins. Atlas of Protein Sequence Structure. National Biomedical Research Foundation, Washington, DC, 5:345-352, 1978.
    • (1978) Atlas of Protein Sequence Structure , vol.5 , pp. 345-352
    • Dayhoff, M.O.1    Schwartz, R.M.2    Orcutt, B.C.3
  • 8
    • 0026458378 scopus 로고
    • Amino acid substitution matrices from protein blocks
    • 10915-10519
    • S. Henikoff and J. Henikoff. Amino acid substitution matrices from protein blocks. Proc. Natl. Acad. Sci., 89:10915-10519, 1992.
    • (1992) Proc. Natl. Acad. Sci. , vol.89
    • Henikoff, S.1    Henikoff, J.2
  • 9
    • 0009735557 scopus 로고
    • Two algorithms for approximate string matching in static texts
    • P. Jokinen and E. Ukkonen. Two algorithms for approximate string matching in static texts. Proc. MFCS'91, 16:240-248, 1991.
    • (1991) Proc. MFCS'91 , vol.16 , pp. 240-248
    • Jokinen, P.1    Ukkonen, E.2
  • 10
    • 84944324113 scopus 로고    scopus 로고
    • Efficient index structures for string databases
    • T. Kahveci and A. Singh. Efficient index structures for string databases. VLDB, pages 351-360, 2001.
    • (2001) VLDB , pp. 351-360
    • Kahveci, T.1    Singh, A.2
  • 11
    • 0036202921 scopus 로고    scopus 로고
    • Patternhunter: Faster and more sensitive homology search
    • March
    • B. Ma, J. Tromp, and M. Li. Patternhunter: faster and more sensitive homology search. Bioinformatics, 18(3):440-445, March 2002.
    • (2002) Bioinformatics , vol.18 , Issue.3 , pp. 440-445
    • Ma, B.1    Tromp, J.2    Li, M.3
  • 12
    • 2442603117 scopus 로고    scopus 로고
    • A hybrid indexing method for approximate string matching
    • G. Navarro and R. Baeza-Yates. A hybrid indexing method for approximate string matching. J. of Discrete Algorithms, 1(1):205-239, 2000.
    • (2000) J. of Discrete Algorithms , vol.1 , Issue.1 , pp. 205-239
    • Navarro, G.1    Baeza-Yates, R.2
  • 14
    • 84942676877 scopus 로고    scopus 로고
    • NCBI. National center for biotechnology information(ncbi) website. http://www.ncbi.nih.gov/.
    • NCBI1
  • 15
    • 0014757386 scopus 로고
    • General method applicable to the search for similarities in the amino acid sequence of two proteins
    • S. B. Needleman and C. Wunsch. General method applicable to the search for similarities in the amino acid sequence of two proteins. J. of Mol. Biol., 48:443-453, 1970.
    • (1970) J. of Mol. Biol. , vol.48 , pp. 443-453
    • Needleman, S.B.1    Wunsch, C.2
  • 17
    • 0028309899 scopus 로고
    • Using the fasta program to search protein and DNA sequence databases
    • W. R. Pearson. Using the fasta program to search protein and dna sequence databases. Methods Mol Biol, 25:365-389, 1994.
    • (1994) Methods Mol Biol , vol.25 , pp. 365-389
    • Pearson, W.R.1
  • 18
    • 0019887799 scopus 로고
    • Identification of common molecular subsequences
    • R. Smith and M. S. Waterman. Identification of common molecular subsequences. J. Mol. Biol., 147:195-197, 1981.
    • (1981) J. Mol. Biol. , vol.147 , pp. 195-197
    • Smith, R.1    Waterman, M.S.2
  • 19
    • 0027968068 scopus 로고
    • Clustal w: Improving the sensitivity of progressive multiple sequence alignment through sequence weighting, position specific gap penalties and weight matrix choice
    • J. D. Thompson, D. G. Higgins, and T. J. Gibson. Clustal w: improving the sensitivity of progressive multiple sequence alignment through sequence weighting, position specific gap penalties and weight matrix choice. Nucleic Acids Res., 22:4673-4680, 1994.
    • (1994) Nucleic Acids Res. , vol.22 , pp. 4673-4680
    • Thompson, J.D.1    Higgins, D.G.2    Gibson, T.J.3
  • 20
    • 33746245557 scopus 로고    scopus 로고
    • May, Department of Cell Biology, Baylor College of Medicine, Houston, Texas
    • D. Wheeler. Weight matrices for sequence similarity scoring. http://www.techfak.unibielefeld.de/bcd/Curric/PrwAli/nodeD.html, May 1996. Department of Cell Biology, Baylor College of Medicine, Houston, Texas.
    • (1996) Weight Matrices for Sequence Similarity Scoring
    • Wheeler, D.1
  • 21
    • 84882410240 scopus 로고    scopus 로고
    • A comparison of DFT and DWT based similarity search in time-series databases
    • Y. Wu, D. Agrawal, and A. E. Abbadi. A comparison of dft and dwt based similarity search in time-series databases. CIKM, pages 488-495, 2000.
    • (2000) CIKM , pp. 488-495
    • Wu, Y.1    Agrawal, D.2    Abbadi, A.E.3


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