Zobrazeno 1 - 10
of 20
pro vyhledávání: '"Chiou-Ting Tseng"'
Publikováno v:
Evolutionary Bioinformatics, Vol 2013, Iss 9, Pp 387-416 (2013)
Externí odkaz:
https://doaj.org/article/332fe09ef3fe4a62a5e4d6a269560280
A Tool Preference Choice Method for RNA Secondary Structure Prediction by SVM with Statistical Tests
Publikováno v:
Evolutionary Bioinformatics, Vol 2013, Iss 9, Pp 163-184 (2013)
Externí odkaz:
https://doaj.org/article/e22ef1bbf29546ce909649febe968df7
Autor:
Chiou-Ting Tseng, 曾球庭
101
Given two strings A = a1a2a3...am and B = b1b2b3...bn, the longest common subsequence (LCS) problem is that of finding the longest common part of A and B by deleting zero or more characters from A and B. Given a string S = a1a2a3...am, compo
Given two strings A = a1a2a3...am and B = b1b2b3...bn, the longest common subsequence (LCS) problem is that of finding the longest common part of A and B by deleting zero or more characters from A and B. Given a string S = a1a2a3...am, compo
Externí odkaz:
http://ndltd.ncl.edu.tw/handle/21836302143691115299
Autor:
Chiou-Ting Tseng, 曾球庭
94
Given a string S = {a1, a2, a3, ..., an}, the longest increasing subsequence (LIS) problem is to find a subsequence of the given string such that the subsequence is increasing and its length is maximal. In a previous result, to find the longe
Given a string S = {a1, a2, a3, ..., an}, the longest increasing subsequence (LIS) problem is to find a subsequence of the given string such that the subsequence is increasing and its length is maximal. In a previous result, to find the longe
Externí odkaz:
http://ndltd.ncl.edu.tw/handle/03785018700384990529
Publikováno v:
International Journal of Foundations of Computer Science. 25:723-743
The (n, k)-star graph is a generalization of the n-star graph. It has better scalability than the n-star graph and holds some good properties compared with the hypercube. This paper focuses on the design of the fault-tolerant routing algorithm for th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1618616919fff94327badf0cf33b7eb7
https://doi.org/10.1142/s0129054114500300
https://doi.org/10.1142/s0129054114500300
A Tool Preference Choice Method for RNA Secondary Structure Prediction by SVM with Statistical Tests
Publikováno v:
Evolutionary Bioinformatics, Vol 2013, Iss 9, Pp 163-184 (2013)
Evolutionary Bioinformatics
Evolutionary Bioinformatics, Vol 9 (2013)
Evolutionary Bioinformatics
Evolutionary Bioinformatics, Vol 9 (2013)
The Prediction of RNA secondary structures has drawn much attention from both biologists and computer scientists. Many useful tools have been developed for this purpose. These tools have their individual strengths and weaknesses. As a result, based o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::07896a6e561f4cce3cd27ad33a926eef
http://la-press.com/a-tool-preference-choice-method-for-rna-secondary-structure-prediction-article-a3637
http://la-press.com/a-tool-preference-choice-method-for-rna-secondary-structure-prediction-article-a3637
Publikováno v:
BIBE
In this paper, we generalize the inclusion constrained longest common subsequence (CLCS) problem to the hybrid CLCS problem which is the combination of the sequence inclusion CLCS and the string inclusion CLCS, called the sequential sub string constr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f4290a3386c763c54a93a5332c3970b0
Publikováno v:
Journal of Combinatorial Optimization. 28:800-813
In this paper, we revisit a recent variant of the longest common subsequence (LCS) problem, the string-excluding constrained LCS (STR-EC-LCS) problem, which was first addressed by Chen and Chao (J Comb Optim 21(3):383---392, 2011). Given two sequence
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::92fd806b9bfc12afd8510a4ff4135612
https://doi.org/10.1007/s10878-012-9588-2
https://doi.org/10.1007/s10878-012-9588-2
Publikováno v:
Theoretical Computer Science. 432:1-9
The constrained LCS (CLCS) problem, a recent variant of the longest common subsequence (LCS) problem, has gained much attention. Given two sequences X and Y of lengths n and m, respectively, and the constrained sequence P of length r, previous resear
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::38ab85e4df1c626799c9a791d9218262
Publikováno v:
Journal of Computer and System Sciences. 78:273-278
Given a pattern string P and a text string T, the one-dimensional real-scale pattern matching problem is to ask for all matched positions in T at which P occurs for some real scales ⩾1. The real-scale indexing problem, which is derived from the rea
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0ad9d899a28de56f9bf7f4ed458eaf38
https://doi.org/10.1016/j.jcss.2011.05.001
https://doi.org/10.1016/j.jcss.2011.05.001