HUSCAP logo Hokkaido Univ. logo

Hokkaido University Collection of Scholarly and Academic Papers >
Graduate School of Information Science and Technology / Faculty of Information Science and Technology >
Peer-reviewed Journal Articles, etc >

Pattern Matching with Taxonomic Information

Files in This Item:
AIRS2004.pdf127.82 kBPDFView/Open
Please use this identifier to cite or link to this item:

Title: Pattern Matching with Taxonomic Information
Authors: Kida, Takuya1 Browse this author →KAKEN DB
Arimura, Hiroki Browse this author
Authors(alt): 喜田, 拓也1
Keywords: string matching
Issue Date: Oct-2004
Publisher: Asia Information Retrieval Symposium
Journal Title: Asia Information Retrieval Symposium (AIRS2004)
Start Page: 265
End Page: 268
Abstract: In 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.
Type: article (author version)
Appears in Collections:情報科学院・情報科学研究院 (Graduate School of Information Science and Technology / Faculty of Information Science and Technology) > 雑誌発表論文等 (Peer-reviewed Journal Articles, etc)

Submitter: 喜田 拓也

Export metadata:

OAI-PMH ( junii2 , jpcoar_1.0 )

MathJax is now OFF:


 - Hokkaido University