Zobrazeno 1 - 10
of 26
pro vyhledávání: '"Yung-Hsing Peng"'
Autor:
Yung-Hsing Peng, 彭永興
98
Related problems of string indexing and sequence analysis have been widely studied for a long time. Recently, researchers turn to consider extended versions of these problems, which provides more realistic applications. In this dissertation,
Related problems of string indexing and sequence analysis have been widely studied for a long time. Recently, researchers turn to consider extended versions of these problems, which provides more realistic applications. In this dissertation,
Externí odkaz:
http://ndltd.ncl.edu.tw/handle/30047201352798096126
Autor:
Yung-Hsing Peng, 彭永興
92
In recent years, RNA structural comparison becomes a crucial problem in bioinformatic research. Generally, it is a popular approach for representing the RNA secondary structures with arc-annotation sets. Several methods can be used to compare
In recent years, RNA structural comparison becomes a crucial problem in bioinformatic research. Generally, it is a popular approach for representing the RNA secondary structures with arc-annotation sets. Several methods can be used to compare
Externí odkaz:
http://ndltd.ncl.edu.tw/handle/41669306120011833307
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:
Journal of Advances in Information Technology. :227-232
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b11f8043a4e20e1d2eb6e8d00b81145c
https://doi.org/10.12720/jait.6.4.227-232
https://doi.org/10.12720/jait.6.4.227-232
Autor:
Chang-Biau Yang, Yung-Hsing Peng
Publikováno v:
Information and Computation. 237:95-100
The longest common subsequence (LCS) problem with gap constraints (or the gapped LCS), which has applications to genetics and molecular biology, is an interesting and useful variant to the LCS problem. In previous work, this problem is solved in O(nm
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e92620c2180129117edbc14e64271962
https://doi.org/10.1016/j.ic.2014.06.001
https://doi.org/10.1016/j.ic.2014.06.001
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:
Expert Systems with Applications. 38:1697-1701
Our investment strategy for the world mutual funds can be divided into three main parts. First, the global trend indicator (GTI) is defined for evaluating the price change trend of the funds in the future. Then, based on GTI, we derive the monitoring
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f2f2b4851cfe59036bbaac01b5df67c5
https://doi.org/10.1016/j.eswa.2010.07.094
https://doi.org/10.1016/j.eswa.2010.07.094
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. 110:730-734
The discretely-scaled string indexing problem asks one to preprocess a given text string T, so that for a queried pattern P, the matched positions in T that P appears with some discrete scale can be reported efficiently. For solving this problem, Wan
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::668675347681903533988227e0084b90
https://doi.org/10.1016/j.ipl.2010.05.012
https://doi.org/10.1016/j.ipl.2010.05.012
Publikováno v:
International Journal of Foundations of Computer Science. 21:51-59
Given two sequences S1, S2, and a constrained sequence C, a longest common subsequence of S1, S2 with restriction to C is called a constrained longest common subsequence of S1 and S2 with C. At the same time, an optimal alignment of S1, S2 with restr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f3c22ec7d0e578470d9d434c7505d95a
https://doi.org/10.1142/s012905411000712x
https://doi.org/10.1142/s012905411000712x