Efficient Algorithms for the Common Multiset Interval Problem
碩士 === 國立中山大學 === 資訊工程學系研究所 === 103 === For two sequences A = a1a2a3 … am and B = b1b2b3 … cn, a multiset interval ∆(A, i, j) = [ax | i ≤ x ≤ j], and a common multisets interval (CMI) is ∆(A, iA, jA) = ∆(B, iB, jB) for some $iA, jA, iB, jB. 1 ≤ iA ≤ jA ≤ m and 1 ≤ iB ≤ jB ≤ n, which is a multiset t...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2015
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/82950992267180310060 |