On the Finding Approximate Palindromes Problem
碩士 === 國立暨南國際大學 === 資訊工程學系 === 96 === A string S is a palindrome if it is of the form of S1S2 or S1aS2 such that the reverse of S1 exactly matches with the S2. An approximate palindrome with error k is a string S1S2 or S1aS2 such that the edit distance between S2 and the reverse of S1 is smaller tha...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2008
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/43573315341290951312 |