Browse > Article

An Effective Algorithm for Checking Subsumption Relation on String Data Containing Wildcard Characters  

Kim, Do-Han (서울시립대학교 기계정보공학과)
Park, Hee-Jin (한양대학교 정보통신대학)
Paek, Eun-Ok (서울시립대학교 기계정보공학과)
Publication Information
Journal of KIISE:Computer Systems and Theory / v.32, no.9, 2005 , pp. 475-482 More about this Journal
Abstract
String data containing wildcard characters may represent certain patterns in texts. A subsumption relation between two patterns can be defined by a subset relation between sets of strings that match those patterns. Thus, the subsumption relation check is important to determine whether each pattern represents a set of strings without any overlap with another pattern. In this paper, we propose an effective algorithm that can determine subsumption relation between strings with wildcard characters. First, we consider a simple extension of the suffix tree algorithm so that it nay include wildcard characters and then we propose another method that checks the subsumption relation by dividing a suffix tree structure at each location of string data.
Keywords
subsumption relation; suffix tree; trie; wildcard character;
Citations & Related Records
연도 인용수 순위
  • Reference
1 S. Kurtz, Reducing the space requirement of suffix trees, Software Practice and Experience, 29, 1149-1171, 1999   DOI   ScienceOn
2 E. Ukkonen, 'On-line construction of suffix trees,' Algorithmica 14, pp. 353-364, 1993   DOI
3 Dan Gusfield, Algorithms on Strings, Trees and Sequences, Cambridge University Press, 1997
4 C. Sigrist, L. Cerutti, N. Hulo, A. Gattiker, L. Falquet, M. Pagni, A. Bairoch, and P. Bucher, PROSITE: A documented database using patterns and profiles as motif descriptors, Brief Bioinformatics, Vol. 3 no. 3, 265-274, 2002   DOI   ScienceOn
5 Inge Jonassen, Efficient discovery of conserved patterns using a pattern graph, CABIOS, 13, 509-522, 1997
6 Andrea Califano, SPLASH: structural pattern localization analysis by sequential histograms, Bioinformatics, Vol. 16 no. 4, 341-357, 2000   DOI   ScienceOn
7 G. M. Kuper and J. Simeon, Subsumption for XML types, Proc. Of International Conference on Database Theory, London, 2001
8 M. Farach, Optimal suffix tree construction with large alphabets, FOCS, 137-143, 1997   DOI
9 M. Farach-Colton, P. Ferragina and S. Muthukrishnan, On the sorting-complexity of suffix tree construction, JACM 47, 987-1011, 2000   DOI   ScienceOn
10 I. Horrocks and P. F. Patel-Schneider, Optimising description logic subsumption, Journal of Logic and Computation, 9(3), 267-293, 1999   DOI
11 C. Chang and R. Lee, Symbolic logic and mechanical theorem proving, Academic Press, 1973
12 M.T. Chen and J. Seiferas, Efficient and elegant subword tree construction, In A. Apostolico and Z. Galil, editors, Combinatorial Algorithms on Words, NATO ASI Series F: Computer and System Sciences, 97-107, 1985
13 E. M. McCreight, 'A space-economical suffix tree construction algorithms,' J. ACM 23, pp. 262-272, 1976   DOI   ScienceOn
14 P. Weiner, Linear pattern matching algorithms, Proc. 14th IEEE Symp. Switching and Automata Theory, 1-11, 1973