Zobrazeno 1 - 10
of 21
pro vyhledávání: '"Kuo-Tsung Tseng"'
Autor:
Kuo-Tsung Tseng, 曾國尊
96
With the improvement of biological techniques, the amount of biosequences data, such as DNA, RNA and protein sequences, are growing explosively. It is almost impossible to handle such huge amount of data purely by manpower. Thus the requireme
With the improvement of biological techniques, the amount of biosequences data, such as DNA, RNA and protein sequences, are growing explosively. It is almost impossible to handle such huge amount of data purely by manpower. Thus the requireme
Externí odkaz:
http://ndltd.ncl.edu.tw/handle/bh3d82
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:
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:
Proceedings of the 5th International Conference on Engineering and MIS.
Given two sequences with lengths m and n, the edit distance is the minimum cost required to transform one into the other. The classical operations involved in the traditional edit distance problem include insertion, deletion and replacement. In 2004,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::228159937817f998223b23f0730d9e47
https://doi.org/10.1145/3330431.3330437
https://doi.org/10.1145/3330431.3330437
Publikováno v:
Communications in Computer and Information Science ISBN: 9789811391897
ICS
ICS
In the time series classification (TSC) problem, the calculation of the distance of two time series is the kernel issue. One of the famous methods for the distance calculation is the dynamic time warping (DTW) with \(O(n^2)\) time complexity, based o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6706c184414dd652a0de8380ea75d239
https://doi.org/10.1007/978-981-13-9190-3_48
https://doi.org/10.1007/978-981-13-9190-3_48
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
Publikováno v:
IEICE Transactions on Information and Systems. :789-795
The optimal alignment of two given biosequences is mathematically optimal, but it may not be a biologically optimal one. To investigate more possible alignments with biological meaning, one can relax the scoring functions to get near-optimal alignmen
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::09bb847e9289b0dcbaaaaed5b6984afc
https://doi.org/10.1093/ietisy/e91-d.3.789
https://doi.org/10.1093/ietisy/e91-d.3.789
Publikováno v:
Information Processing Letters. 105:188-193
The longest common subsequence and sequence alignment problems have been studied extensively and they can be regarded as the relationship measurement between sequences. However, most of them treat sequences evenly or consider only two sequences. Rece
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::392f75254777f8d9533b41bddc5c7a29
https://doi.org/10.1016/j.ipl.2007.08.028
https://doi.org/10.1016/j.ipl.2007.08.028
Publikováno v:
Information Processing Letters. 102:99-103
The longest common subsequence (LCS) problem can be used to measure the relationship between sequences. In general, the inputs of the LCS problem are two sequences. For finding the relationship between one sequence and a set of sequences, we cannot a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5178c9975e17df8aae6792d691de6d38
https://doi.org/10.1016/j.ipl.2006.11.006
https://doi.org/10.1016/j.ipl.2006.11.006
Publikováno v:
Communications in Computer and Information Science ISBN: 9783662465486
IC3K
IC3K
In this paper, we apply support vector machine (SVM) and behavior knowledge space (BKS) to the disulfide connectivity prediction problem. The problem aims to establish the disulfide connectivity pattern of the target protein. It is an important probl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::84c26b8c67518b9612a8003a62959bde
https://doi.org/10.1007/978-3-662-46549-3_5
https://doi.org/10.1007/978-3-662-46549-3_5