2024-03-28T12:20:42Zhttps://eprints.lib.hokudai.ac.jp/dspace-oai/requestoai:eprints.lib.hokudai.ac.jp:2115/8272022-11-17T02:08:08Zhdl_2115_20053hdl_2115_145Pattern Matching with Taxonomic Information1000070343316Kida, Takuya喜田, 拓也Arimura, Hirokiopen accessstring matchingtaxonomybit-parallelismAlgorithms007.13In this paper, we study the pattern matching problem with taxonomic information (PMTX, for short), where taxonomy is a partially ordered set of letters describing an IS-A hierarchy. We present an efficient algorithm for PMTX that runs in O(mn/w) time with O(m+mh/w) preprocess and O(mσ/w) extra space, where h, m, t, σ, and w are the size of the taxonomic information H, the length of the pattern P ∈ Σ∗, the length of the text T ∈ Σ∗, the cardinality of the sorted alphabet Σ, and the computer word length, respectively. If the pattern length m is less than w, it runs in O(n) time, O(m + h) preprocess, and O(σ) space, and works very fast in practice. We also discuss various improvements of the algorithms for real world applications.Asia Information Retrieval Symposium2004-10engjournal articleAMhttp://hdl.handle.net/2115/827Asia Information Retrieval Symposium (AIRS2004)265268https://eprints.lib.hokudai.ac.jp/dspace/bitstream/2115/827/1/AIRS2004.pdfapplication/pdf127.82 KB2004-10