Finding all Maximal Palindromes in a Weighted Sequence with the Constraint of the Probability of Appearance
碩士 === 國立臺灣大學 === 資訊工程學研究所 === 96 === A weighted sequence X is a sequence of positions, and each position stands for a character. Each character associated with a position is assigned a weight. The weight models the probability of appearance of the character associated with that position in a molecu...
Main Authors: | Yu-Tsun Wang, 王煜樟 |
---|---|
Other Authors: | 趙坤茂 |
Format: | Others |
Language: | en_US |
Published: |
2008
|
Online Access: | http://ndltd.ncl.edu.tw/handle/02474560706272355878 |
Similar Items
-
Finding all Palindrome Subsequences and Longest Common Palindrome Subsequences
by: Kuo-Rong Chuang, et al.
Published: (2007) -
On the Finding Approximate Palindromes Problem
by: Li-Chi Chen, et al.
Published: (2008) -
Avoided words, overabundant words, maximal palindromes and applicatons
by: Gao, Jia
Published: (2018) -
An Efficient Algorithm for Finding Special Palindromes
by: Yin-Chu Chen, et al.
Published: (2019) -
Maximizing the goal-reaching probability before drawdown with borrowing constraint
by: Yu Yuan, et al.
Published: (2021-06-01)