Zobrazeno 1 - 10
of 29
pro vyhledávání: '"Chiou-Yi Hor"'
Autor:
Yi-Zeng Hsieh, Shih-Syun Lin, En-Yu Chang, Kwong-Kau Tiong, Shih-Wei Tan, Chiou-Yi Hor, Shyi-Chy Cheng, Yu-Shiuan Tsai, Chao-Rong Chen
Publikováno v:
Energies, Vol 14, Iss 14, p 4125 (2021)
The focus of this study is under the auspices of China Steel Corporation, Taiwan, in carrying out the national energy policy of 2025 Non-Nuclear Home. Under this policy, an estimated 600 offshore wind turbines will be installed by 2025. In order to c
Externí odkaz:
https://doaj.org/article/9c0edeffac4647229bf54e3b47be2bd5
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:
Shih-Wei Tan, Shyi-Chy Cheng, Chao-Rong Chen, En-Yu Chang, Yi-Zeng Hsieh, Kwong-Kau Tiong, Shih-Syun Lin, Yu-Shiuan Tsai, Chiou-Yi Hor
Publikováno v:
Energies
Volume 14
Issue 14
Energies, Vol 14, Iss 4125, p 4125 (2021)
Volume 14
Issue 14
Energies, Vol 14, Iss 4125, p 4125 (2021)
The focus of this study is under the auspices of China Steel Corporation, Taiwan, in carrying out the national energy policy of 2025 Non-Nuclear Home. Under this policy, an estimated 600 offshore wind turbines will be installed by 2025. In order to c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f8df7a05b9c12e6e0cbc5a96610cecdf
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:
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
Publikováno v:
Information Processing Letters. 111:318-322
Related problems of scaled matching and indexing, which aim to determine all positions in a text T that a pattern P occurs in its scaled form, are considered important because of their applications to computer vision. However, previous results only f
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::33912f11fc591b24b6a49e083c1614ac
https://doi.org/10.1016/j.ipl.2010.12.001
https://doi.org/10.1016/j.ipl.2010.12.001
Publikováno v:
Information Processing Letters. 108:360-364
Let X and Y be two strings of lengths n and m, respectively, and k and l, respectively, be the numbers of runs in their corresponding run-length encoded forms. We propose a simple algorithm for computing the longest common subsequence of two given st
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::475a418ca37c7c132cf143f39d711a25
https://doi.org/10.1016/j.ipl.2008.07.005
https://doi.org/10.1016/j.ipl.2008.07.005
Publikováno v:
Advances in Data Mining. Applications and Theoretical Aspects ISBN: 9783319415604
ICDM
ICDM
For the past decades, many efforts have been made in the fields of protein structure prediction. Among these, the protein backbone reconstruction problem (PBRP) has attracted much attention. The goal of PBRP is to reconstruct the 3D coordinates of al
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b054f66b752643b3a369009b9ca573ce
https://doi.org/10.1007/978-3-319-41561-1_16
https://doi.org/10.1007/978-3-319-41561-1_16
