Approximate String Matching Problem under Non-Overlapping Inversion Distance
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
48 | en_US |
dc.citation.spage |
40 | en_US |
dc.citation.volume |
274 | en_US |
dc.citation.woscount |
0 | en_US |
dc.contributor.author |
Huang, Shih-Yuan | en_US |
dc.contributor.author |
Yang, Chung-Han | en_US |
dc.contributor.author |
Ta, Toan Thang | en_US |
dc.contributor.author |
Lu, Chin Lung | en_US |
dc.contributor.department |
生物資訊及系統生物研究所 | zh_TW |
dc.contributor.department |
Institude of Bioinformatics and Systems Biology | en_US |
dc.date.accessioned |
2019-04-02T06:04:33Z | |
dc.date.available |
2019-04-02T06:04:33Z | |
dc.date.issued |
2015-01-01 | en_US |
dc.description.abstract |
In this paper, we introduce and study the approximate string matching problem under non-overlapping inversion distance. Given a text t, a pattern p and a non-negative integer k, the goal of the problem is to find all locations in the text t that match the pattern p with at most k non-overlapping inversions. As a result, we use the dynamic programming approach to design an algorithm that solves this problem in O(nm(2)) time and O(m(2)) space, where n is the length of the text and m is the length of the pattern. | en_US |
dc.identifier.doi |
10.3233/978-1-61499-484-8-40 | en_US |
dc.identifier.issn |
0922-6389 | en_US |
dc.identifier.journal |
INTELLIGENT SYSTEMS AND APPLICATIONS (ICS 2014) | en_US |
dc.identifier.uri |
http://dx.doi.org/10.3233/978-1-61499-484-8-40 | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/150893 | |
dc.identifier.wosnumber |
WOS:000454394100005 | en_US |
dc.language.iso |
en_US | en_US |
dc.subject |
approximate string matching | en_US |
dc.subject |
non-overlapping inversions | en_US |
dc.subject |
dynamic programming | en_US |
dc.title |
Approximate String Matching Problem under Non-Overlapping Inversion Distance | en_US |
dc.type |
Proceedings Paper | en_US |
檔案
本條目沒有附加檔案。
所屬典藏: 會議論文
引用此條目
Huang, S.-Y., Yang, C.-H., Ta, T. T., & Lu, C. L. (2015). Approximate String Matching Problem under Non-Overlapping Inversion Distance. INTELLIGENT SYSTEMS AND APPLICATIONS (ICS 2014), 274, 40–48. https://doi.org/10.3233/978-1-61499-484-8-40
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/150893