A Prune-and-Search Algorithm for Finding the Most Similar Sequence
碩士 === 國立中山大學 === 資訊工程學系研究所 === 106 === For finding the most similar sequence in a character-sequence database, it is very time-consuming if the one-by-one sequential search strategy is applied. In the previous studies, there is no theoretical analysis about the probability of the sequential search,...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2018
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/vszz76 |