Zobrazeno 1 - 10
of 90
pro vyhledávání: '"Chang-Biau Yang"'
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
Publikováno v:
Theoretical Computer Science. 922:475-485
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::34695c687b11ecad5b9ee183a3a511bf
https://doi.org/10.1016/j.tcs.2022.04.046
https://doi.org/10.1016/j.tcs.2022.04.046
Publikováno v:
Theoretical Computer Science. :113944
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e73568e420ab813d2a405df921731cea
https://doi.org/10.1016/j.tcs.2023.113944
https://doi.org/10.1016/j.tcs.2023.113944
Publikováno v:
Theoretical Computer Science. 815:69-78
The longest common increasing subsequences (LCIS) problem is to find out a common increasing subsequence with the maximal length of two given sequences A and B. In this paper, we propose an algorithm for solving the LCIS problem with O ( ( n + L ( m
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7b55b9aa4e11e1d50f4d2b6a75c50dfa
https://doi.org/10.1016/j.tcs.2020.02.024
https://doi.org/10.1016/j.tcs.2020.02.024
Publikováno v:
Algorithmica. 82:2039-2062
The similarity of two one-dimensional sequences is usually measured by the longest common subsequence (LCS) algorithms. However, these algorithms cannot be directly extended to solve the two or higher dimensional data. Thus, for the two-dimensional d
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d73828c78ae698f5e88892935694d2e2
https://doi.org/10.1007/s00453-020-00685-8
https://doi.org/10.1007/s00453-020-00685-8
Publikováno v:
SSRN Electronic Journal.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0f17a684036c1ceadba740645455ba7e
https://doi.org/10.2139/ssrn.4178085
https://doi.org/10.2139/ssrn.4178085
Publikováno v:
Theoretical Computer Science. 708:75-90
Given a pair of merging sequences A, B and a target sequence T, the merged longest common subsequence (MLCS) problem is to find out the longest common subsequence (LCS) between sequences E ( A , B ) and T, where E ( A , B ) is obtained from merging t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b3309f67fdbbc81365249b7aa68fa116
https://doi.org/10.1016/j.tcs.2017.10.027
https://doi.org/10.1016/j.tcs.2017.10.027
Publikováno v:
KES
The paper studies how to improve the trading decision of Taiwan stocks with the information of US stock market. Our method first aligns the trading days between Taiwan and US stock markets. Next, the similarity between the portfolio index (PI, constr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9041a6c1ce651d29591e5d178b23832f
https://doi.org/10.1016/j.procs.2018.07.212
https://doi.org/10.1016/j.procs.2018.07.212
Autor:
Hung-Hsin Chen, Chang-Biau Yang
Publikováno v:
Computers & Operations Research. 81:305-321
Stagewise stochastic (integer) programming with CVaR for multiperiod portfolio investment are proposed.Heuristic moment matching method is utilized to generate scenarios for our models.The targets are the 50 listed companies with the greatest market
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3526c08ed416e51250c0f8fe1bb8463c
https://doi.org/10.1016/j.cor.2016.11.011
https://doi.org/10.1016/j.cor.2016.11.011