default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKuo-Si Huang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c8]Chien-Ting Lee, Chang-Biau Yang, Kuo-Si Huang:
The Merged Longest Common Increasing Subsequence Problem. ACIIDS (Companion 1) 2024: 202-212- 2023
- [j9]Bi-Shiang Lin, Kuo-Si Huang, Chang-Biau Yang:
Linear-space S-table algorithms for the longest common subsequence problem. Theor. Comput. Sci. 964: 113944 (2023) - [c7]Tsung-Lin Lu, Kuo-Si Huang, Chang-Biau Yang:
An Algorithm for Finding the Longest Common Almost Wave Subsequence with the Trend. IIAI-AAI 2023: 424-429 - [c6]Kuo-Si Huang, Yu-Chen Lin, Chang-Biau Yang, Ho-Chun Lin, Yung-Hsing Peng, Szu-Hsuan Wang:
An Improved Algorithm with Azimuth Clustering for Detecting Turning Regions on GPS Trajectories. TAAI (1) 2023: 151-161 - 2022
- [j8]Ting-Wei Liang, Chang-Biau Yang, Kuo-Si Huang:
An efficient algorithm for the longest common palindromic subsequence problem. Theor. Comput. Sci. 922: 475-485 (2022) - 2020
- [j7]Shou-Fu Lo, Kuo-Tsung Tseng, Chang-Biau Yang, Kuo-Si Huang:
A diagonal-based algorithm for the longest common increasing subsequence problem. Theor. Comput. Sci. 815: 69-78 (2020)
2010 – 2019
- 2018
- [c5]Siang-Huai Hung, Chang-Biau Yang, Kuo-Si Huang:
A Diagonal-Based Algorithm for the Constrained Longest Common Subsequence Problem. ICS 2018: 425-432 - 2015
- [c4]Che-Jui Hsu, Kuo-Si Huang, Chang-Biau Yang, Yi-Pu Guo:
Flexible Dynamic Time Warping for Time Series Classification. ICCS 2015: 2838-2842 - 2014
- [j6]Chiao-Wei Chiu, Kuo-Si Huang, Chang-Biau Yang, Chiou-Ting Tseng:
An Adaptive Heuristic Algorithm with the Probabilistic Safety Vector for Fault-Tolerant Routing on the (n, k)-Star Graph. Int. J. Found. Comput. Sci. 25(6): 723-744 (2014) - 2010
- [j5]Yung-Hsing Peng, Chang-Biau Yang, Kuo-Tsung Tseng, Kuo-Si Huang:
An Algorithm and Applications to Sequence Alignment with Weighted Constraints. Int. J. Found. Comput. Sci. 21(1): 51-59 (2010) - [j4]Yung-Hsing Peng, Chang-Biau Yang, Kuo-Si Huang, Hsing-Yen Ann:
Efficient indexing algorithms for one-dimensional discretely-scaled strings. Inf. Process. Lett. 110(16): 730-734 (2010) - [c3]Chih-Ying Lin, Chang-Biau Yang, Chiou-Yi Hor, Kuo-Si Huang:
Disulfide bonding state prediction with SVM based on protein types. BIC-TA 2010: 1436-1442
2000 – 2009
- 2009
- [c2]Chiao-Wei Chiu, Chang-Biau Yang, Kuo-Si Huang, Chiou-Ting Tseng:
A Fault-Tolerant Routing Algorithm with Safety Vectors on the (n, k)-Star Graph. ISPAN 2009: 34-39 - 2008
- [j3]Kuo-Tsung Tseng, Chang-Biau Yang, Kuo-Si Huang, Yung-Hsing Peng:
Near-Optimal Block Alignments. IEICE Trans. Inf. Syst. 91-D(3): 789-795 (2008) - [j2]Kuo-Si Huang, Chang-Biau Yang, Kuo-Tsung Tseng, Hsing-Yen Ann, Yung-Hsing Peng:
Efficient algorithms for finding interleaving relationship between sequences. Inf. Process. Lett. 105(5): 188-193 (2008) - 2007
- [j1]Kuo-Si Huang, Chang-Biau Yang, Kuo-Tsung Tseng, Yung-Hsing Peng, Hsing-Yen Ann:
Dynamic programming algorithms for the mosaic longest common subsequence problem. Inf. Process. Lett. 102(2-3): 99-103 (2007) - 2005
- [c1]Kuo-Si Huang, Kuo-Tsung Tseng, Chang-Biau Yang:
The Better Alignment Among Output Alignments. METMBS 2005: 31-40
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 12:59 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
