메뉴 건너뛰기




Volumn 4, Issue 11, 2011, Pages 772-782

Approximate substring matching over uncertain strings

Author keywords

[No Author keywords available]

Indexed keywords

INDEXING (OF INFORMATION); INFORMATION MANAGEMENT; PROBABILITY DISTRIBUTIONS;

EID: 84862695811     PISSN: None     EISSN: 21508097     Source Type: Journal    
DOI: 10.14778/3402707.3402717     Document Type: Conference Paper
Times cited : (17)

References (17)
  • 1
    • 0003808970 scopus 로고    scopus 로고
    • Genomics: The Science and Technology Behind the Human Genome Project
    • Wiley
    • C. Cantor, C. Smith. Genomics: The Science and Technology Behind the Human Genome Project. Wiley, 1999.
    • (1999)
    • Cantor, C.1    Smith, C.2
  • 2
    • 33749597967 scopus 로고    scopus 로고
    • A primitive operator for similarity joins in data cleaning
    • S. Chaudhuri, V. Ganti, R. Kaushik. A primitive operator for similarity joins in data cleaning. In ICDE, pages 5-16, 2006.
    • (2006) ICDE , pp. 5-16
    • Chaudhuri, S.1    Ganti, V.2    Kaushik, R.3
  • 3
    • 68749101919 scopus 로고    scopus 로고
    • Automatic Real Time Detection of Atrial Fibrillation
    • S. Dash, K. Chon, S. Lu, E. Raeder. Automatic Real Time Detection of Atrial Fibrillation. In Ann Biomed Eng., 37(9), pp. 1701-9, 2009.
    • (2009) Ann Biomed Eng. , vol.37 , Issue.9 , pp. 1701-1709
    • Dash, S.1    Chon, K.2    Lu, S.3    Raeder, E.4
  • 4
    • 0031955518 scopus 로고    scopus 로고
    • Base-calling of automated sequencer traces using phred I accuracy assessment
    • B. Ewing et al.. Base-calling of automated sequencer traces using phred I accuracy assessment. In Genome Res., 8(3):175-85, 1998.
    • (1998) Genome Res. , vol.8 , Issue.3 , pp. 175-185
    • Ewing, B.1
  • 5
    • 84944318804 scopus 로고    scopus 로고
    • Approximate string joins in a database (almost) for free
    • L. Gravano et al. Approximate string joins in a database (almost) for free. In VLDB, pages 491-500, 2001.
    • (2001) VLDB , pp. 491-500
    • Gravano, L.1
  • 6
    • 77954747849 scopus 로고    scopus 로고
    • Probabilistic String Similarity Joins
    • J. Jestes, F. Li, Z. Yan, K. Yi. Probabilistic String Similarity Joins. In SIGMOD, pages 327-338, 2010.
    • (2010) SIGMOD , pp. 327-338
    • Jestes, J.1    Li, F.2    Yan, Z.3    Yi, K.4
  • 7
    • 83755224579 scopus 로고    scopus 로고
    • SigMatch: Fast and Scalable Multi-Pattern Matching
    • R. Kandhan, N. Teletia and J. M. Patel. SigMatch: Fast and Scalable Multi-Pattern Matching. In PVLDB, 3(1), pages 1173-1184, 2010.
    • (2010) PVLDB , vol.3 , Issue.1 , pp. 1173-1184
    • Kandhan, R.1    Teletia, N.2    Patel, J.M.3
  • 8
    • 77952734936 scopus 로고    scopus 로고
    • High-throughput DNA sequencing - concepts and limitations
    • M. Kircher, J. Kelso. High-throughput DNA sequencing - concepts and limitations. In BioEssays, 32, pages 524-536, 2010.
    • (2010) BioEssays , vol.32 , pp. 524-536
    • Kircher, M.1    Kelso, J.2
  • 9
    • 52649086729 scopus 로고    scopus 로고
    • Efficient Merging and Filtering Algorithms for Approximate String Searches
    • C. Li, J. Lu, Y. Lu. Efficient Merging and Filtering Algorithms for Approximate String Searches. In ICDE, pages 257-266, 2008.
    • (2008) ICDE , pp. 257-266
    • Li, C.1    Lu, J.2    Lu, Y.3
  • 10
    • 0345566149 scopus 로고    scopus 로고
    • A Guided Tour to Approximate String Matching
    • G. Navarro. A Guided Tour to Approximate String Matching. In ACM Computing Surveys, Vol. 33, No. 1, pages 31-88, 2001.
    • (2001) ACM Computing Surveys , vol.33 , Issue.1 , pp. 31-88
    • Navarro, G.1
  • 11
    • 0001851762 scopus 로고    scopus 로고
    • Indexing Methods for Approximate String Matching
    • Bulletin
    • G. Navarro et al. Indexing Methods for Approximate String Matching. In IEEE Data Eng. Bulletin, Vol. 24, No. 4, pages 19-27, 2001.
    • (2001) IEEE Data Eng. , vol.24 , Issue.4 , pp. 19-27
    • Navarro, G.1
  • 12
    • 70350635615 scopus 로고    scopus 로고
    • Indexing Variable Length Substrings for Exact and Approximate Matching
    • G. Navarro, L. Salmela. Indexing Variable Length Substrings for Exact and Approximate Matching. In SPIRE, pages 214-221, 2009.
    • (2009) SPIRE , pp. 214-221
    • Navarro, G.1    Salmela, L.2
  • 13
    • 0022426366 scopus 로고
    • Nomenclature Committee of the International Union of Biochemistry (NC-IUB) Nomenclature for incompletely specified bases in nucleic acid sequences
    • Nomenclature Committee of the International Union of Biochemistry (NC-IUB). Nomenclature for incompletely specified bases in nucleic acid sequences. In Biochem J., 229(2), pages 281-6, 1985.
    • (1985) Biochem J. , vol.229 , Issue.2 , pp. 281-286
  • 14
    • 33749587008 scopus 로고    scopus 로고
    • Declarative Querying for Biological Sequences
    • S. Tata, J. M. Patel, J. Friedman, A. Swaroop. Declarative Querying for Biological Sequences. In ICDE, pages 87-98, 2006.
    • (2006) ICDE , pp. 87-98
    • Tata, S.1    Patel, J.M.2    Friedman, J.3    Swaroop, A.4
  • 15
    • 85152508720 scopus 로고    scopus 로고
    • The U. of Michigan DNA Sequencing Core. Interpretation of Sequencing Chromatograms.
    • The U. of Michigan DNA Sequencing Core. Interpretation of Sequencing Chromatograms. http://seqcore.brcf.med.umich.edu/
  • 16
    • 0000386785 scopus 로고
    • Finding approximate patterns in strings
    • E. Ukkonen. Finding approximate patterns in strings. In Journal of Algorithms, 6, pages 132-137, 1985.
    • (1985) Journal of Algorithms , vol.6 , pp. 132-137
    • Ukkonen, E.1
  • 17
    • 85152502215 scopus 로고    scopus 로고
    • http://www.ncbi.nlm.nih.gov/Traces/home/.


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