Approximated Palindromes Searching for the RNA Sequences by Dynamic Programming Approach
碩士 === 國立虎尾科技大學 === 資訊工程研究所 === 103 === Palindromes are strings of symbols that read the same in the forward and backward directions, which have some biological consequences, especially in sequence analysis. Palindromes appear frequently and are widespread in human cancers, and identify them could...
Main Authors: | Sheng-Jia Weng, 翁晟嘉 |
---|---|
Other Authors: | 黃建宏 |
Format: | Others |
Language: | zh-TW |
Published: |
2015
|
Online Access: | http://ndltd.ncl.edu.tw/handle/8wg2jj |
Similar Items
-
On the Finding Approximate Palindromes Problem
by: Li-Chi Chen, et al.
Published: (2008) -
Finding all Palindrome Subsequences and Longest Common Palindrome Subsequences
by: Kuo-Rong Chuang, et al.
Published: (2007) -
Palindromic Quadratization and Structure-Preserving Algorithm for Palindromic Matrix Polynomials
by: Su, Wei-Shuo, et al.
Published: (2013) -
Highly Iterated Palindromic Sequences (HIPs) and Their Relationship to DNA Methyltransferases
by: Jeff Elhai
Published: (2015-03-01) -
Palindromic but not G-rich sequences are targets of class switch recombination
by: Tashiro, Junko
Published: (2011)