Zobrazeno 1 - 10
of 14
pro vyhledávání: '"Hsing-Yen Ann"'
Autor:
Hsing-Yen Ann, 安興彥
98
Computing the similarity of two strings or sequences is one of the most important fundamental in computer field, and it has been widely studied for several decades. In the last decade, it gained the researchers'' attentions again because of t
Computing the similarity of two strings or sequences is one of the most important fundamental in computer field, and it has been widely studied for several decades. In the last decade, it gained the researchers'' attentions again because of t
Externí odkaz:
http://ndltd.ncl.edu.tw/handle/80074894125716292892
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:
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:
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:
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:
Journal of Visual Languages & Computing. 13:117-147
In the previous signature-based approaches to retrieve symbolic pictures from a large iconic image database, only pictures of type-2 similarity are considered, where a picture A is of type-2 similarity with picture B when both pictures have the same
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c2f2f75a6b8002b7e72a0d7c3bf5999d
https://doi.org/10.1006/jvlc.2001.0212
https://doi.org/10.1006/jvlc.2001.0212
Publikováno v:
Pattern Recognition. 33:1263-1276
In this paper, we propose an efficient iconic indexing strategy called unique-ID-based matrix (UID matrix) for symbolic pictures, in which each spatial relationship between any two objects is assigned with a unique identifier (ID) and is recorded in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1710a23c4f3e1dfd51330b7b44c0d01d
https://doi.org/10.1016/s0031-3203(99)00115-6
https://doi.org/10.1016/s0031-3203(99)00115-6