메뉴 건너뛰기




Volumn 6187 LNCS, Issue , 2010, Pages 519-536

Prefix tree indexing for similarity search and similarity joins on genomic data

Author keywords

[No Author keywords available]

Indexed keywords

BIOLOGICAL SEQUENCES; C++ LIBRARIES; DATA CLEANSING; DNA SEQUENCING; DUPLICATE DETECTION; EDIT DISTANCE; EFFICIENT IMPLEMENTATION; GENOMIC DATA; INDEXING ALGORITHMS; JOIN METHOD; LIFE-SCIENCES; ORDERS OF MAGNITUDE; PRE-FILTERING; PREFIX TREES; RELATIONAL DATABASE; SIMILARITY JOIN; SIMILARITY MEASURE; SIMILARITY SEARCH; SPEED-UPS; TOOL SUPPORT; UNIX COMMAND; USER DEFINED FUNCTIONS;

EID: 77955048001     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-13818-8_36     Document Type: Conference Paper
Times cited : (14)

References (21)
  • 1
    • 0142187768 scopus 로고    scopus 로고
    • Bft: Bit filtration technique for approximate string join in biological databases
    • Nascimento, M.A., de Moura, E.S., Oliveira, A.L. (eds.) SPIRE 2003 Springer, Heidelberg
    • Aghili, S.A., Agrawal, D., Abbadi, A.E.: Bft: Bit filtration technique for approximate string join in biological databases. In: Nascimento, M.A., de Moura, E.S., Oliveira, A.L. (eds.) SPIRE 2003. LNCS, vol.2857, pp. 326-340. Springer, Heidelberg (2003)
    • (2003) LNCS , vol.2857 , pp. 326-340
    • Aghili, S.A.1    Agrawal, D.2    Abbadi, A.E.3
  • 7
    • 2442449952 scopus 로고    scopus 로고
    • Mining frequent patterns without candidate generation: A Frequent-Pattern tree approach
    • Han, J., Pei, J., Yin, Y., Mao, R.: Mining frequent patterns without candidate generation: A Frequent-Pattern tree approach. Data Mining and Knowledge Discovery 8(1) (2004)
    • (2004) Data Mining and Knowledge Discovery , vol.8 , pp. 1
    • Han, J.1    Pei, J.2    Yin, Y.3    Mao, R.4
  • 8
    • 24644441854 scopus 로고    scopus 로고
    • Using Prefix-Trees for efficiently computing set joins
    • Zhou, L.-z., Ooi, B.-C., Meng, X. (eds.) DASFAA 2005 Springer, Heidelberg
    • Jampani, R., Pudi, V.: Using Prefix-Trees for efficiently computing set joins. In: Zhou, L.-z., Ooi, B.-C., Meng, X. (eds.) DASFAA 2005. LNCS, vol.3453, pp. 761-772. Springer, Heidelberg (2005)
    • (2005) LNCS , vol.3453 , pp. 761-772
    • Jampani, R.1    Pudi, V.2
  • 9
    • 44949154077 scopus 로고    scopus 로고
    • Expressed sequence tags: Clustering and applications
    • Boca Raton Chapman & Hall CRC computer information science
    • Kalyanaraman, A., Alaru, S.: Expressed sequence tags: Clustering and applications. In: Handbook of Computational Molecular Biology. Chapman & Hall CRC computer information science, Boca Raton (2006)
    • (2006) Handbook of Computational Molecular Biology
    • Kalyanaraman, A.1    Alaru, S.2
  • 10
    • 85123004356 scopus 로고    scopus 로고
    • Flexible string matching against large databases in practice
    • Koudas, N., Marathe, A., Srivastava, D.: Flexible string matching against large databases in practice. In: VLDB 2004 (2004)
    • (2004) VLDB 2004
    • Koudas, N.1    Marathe, A.2    Srivastava, D.3
  • 12
    • 38149018071 scopus 로고
    • PATRICIA-practical algorithm to retrieve information coded in alphanumeric
    • Morrison, D.R.: PATRICIA-practical algorithm to retrieve information coded in alphanumeric. Journal of the ACM (JACM) 15(4) (1968)
    • (1968) Journal of the ACM (JACM) , vol.15 , pp. 4
    • Morrison, D.R.1
  • 13
    • 0345566149 scopus 로고    scopus 로고
    • A guided tour to approximate string matching
    • Navarro, G.: A guided tour to approximate string matching. ACM Computing Surveys 33(1) (2001)
    • (2001) ACM Computing Surveys , vol.33 , pp. 1
    • Navarro, G.1
  • 14
    • 77955046052 scopus 로고
    • NCBI. dbEST (1992), http://www.ncbi.nlm.nih.gov/dbest
    • (1992)
  • 16
    • 77955022689 scopus 로고    scopus 로고
    • Tries for approximate string matching
    • Shang, H., Merrett, T.: Tries for approximate string matching. IEEE TKDE 8(4) (1996)
    • (1996) IEEE TKDE , vol.8 , pp. 4
    • Shang, H.1    Merrett, T.2
  • 17
    • 84957634267 scopus 로고    scopus 로고
    • Filtration with q-Samples in approximate string matching
    • Hirschberg, D.S., Meyers, G. (eds.) CPM 1996 Springer, Heidelberg
    • Sutinen, E., Tarhio, J.: Filtration with q-Samples in approximate string matching. In: Hirschberg, D.S., Meyers, G. (eds.) CPM 1996. LNCS, vol.1075. Springer, Heidelberg (1996)
    • (1996) LNCS , vol.1075
    • Sutinen, E.1    Tarhio, J.2
  • 18
    • 84947737449 scopus 로고
    • On using q-Gram locations in approximate string matching
    • Spirakisi P.G. (ed.) ESA 1995 Springer, Heidelberg
    • Sutinen, E., Tarhio, J.: On using q-Gram locations in approximate string matching. In: Spirakis, P.G. (ed.) ESA 1995. LNCS, vol.979, Springer, Heidelberg (1995)
    • (1995) LNCS , vol.979
    • Sutinen, E.1    Tarhio, J.2
  • 20
    • 0036184046 scopus 로고    scopus 로고
    • Indexing and retrieval for genomic databases
    • Williams, H.E., Zobel, J.: Indexing and retrieval for genomic databases. IEEE TKDE 14(1) (2002)
    • (2002) IEEE TKDE , vol.14 , pp. 1
    • Williams, H.E.1    Zobel, J.2
  • 21
    • 70849105253 scopus 로고    scopus 로고
    • Ed-Join: An efficient algorithm for similarity joins with edit distance constraints
    • Xiao, C., Wang, W., Lin, X.: Ed-Join: an efficient algorithm for similarity joins with edit distance constraints. In: VLDB 2008 (2008)
    • (2008) VLDB 2008
    • Xiao, C.1    Wang, W.2    Lin, X.3


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