<?xml version="1.0"?>
<dblpperson name="Kuo-Si Huang" pid="68/5260" n="18">
<person key="homepages/68/5260" mdate="2009-06-10">
<author pid="68/5260">Kuo-Si Huang</author>
</person>
<r><article key="journals/tcs/LeeYH25" mdate="2025-06-11">
<author pid="392/2273">Chien-Ting Lee</author>
<author orcid="0000-0001-6643-5523" pid="01/5268">Chang-Biau Yang</author>
<author pid="68/5260">Kuo-Si Huang</author>
<title>The merged longest common increasing subsequence problem.</title>
<pages>115269</pages>
<year>2025</year>
<volume>1044</volume>
<journal>Theor. Comput. Sci.</journal>
<ee>https://doi.org/10.1016/j.tcs.2025.115269</ee>
<url>db/journals/tcs/tcs1044.html#LeeYH25</url>
<stream>streams/journals/tcs</stream>
</article>
</r>
<r><inproceedings key="conf/aciids/LeeYH24" mdate="2024-12-06">
<author pid="392/2273">Chien-Ting Lee</author>
<author pid="01/5268">Chang-Biau Yang</author>
<author pid="68/5260">Kuo-Si Huang</author>
<title>The Merged Longest Common Increasing Subsequence Problem.</title>
<pages>202-212</pages>
<year>2024</year>
<booktitle>ACIIDS (Companion 1)</booktitle>
<ee>https://doi.org/10.1007/978-981-97-5937-8_17</ee>
<crossref>conf/aciids/2024c1</crossref>
<url>db/conf/aciids/aciids2024c1.html#LeeYH24</url>
</inproceedings>
</r>
<r><article key="journals/tcs/LinHY23" mdate="2023-06-19">
<author pid="349/5647">Bi-Shiang Lin</author>
<author pid="68/5260">Kuo-Si Huang</author>
<author pid="01/5268">Chang-Biau Yang</author>
<title>Linear-space S-table algorithms for the longest common subsequence problem.</title>
<pages>113944</pages>
<year>2023</year>
<volume>964</volume>
<journal>Theor. Comput. Sci.</journal>
<ee>https://doi.org/10.1016/j.tcs.2023.113944</ee>
<url>db/journals/tcs/tcs964.html#LinHY23</url>
</article>
</r>
<r><inproceedings key="conf/iiaiaai/LuHY23" mdate="2024-01-18">
<author pid="02/8100">Tsung-Lin Lu</author>
<author pid="68/5260">Kuo-Si Huang</author>
<author pid="01/5268">Chang-Biau Yang</author>
<title>An Algorithm for Finding the Longest Common Almost Wave Subsequence with the Trend.</title>
<pages>424-429</pages>
<year>2023</year>
<booktitle>IIAI-AAI</booktitle>
<ee>https://doi.org/10.1109/IIAI-AAI59060.2023.00088</ee>
<crossref>conf/iiaiaai/2023</crossref>
<url>db/conf/iiaiaai/iiaiaai2023.html#LuHY23</url>
</inproceedings>
</r>
<r><inproceedings key="conf/taai/HuangLYLPW23" mdate="2024-04-03">
<author pid="68/5260">Kuo-Si Huang</author>
<author pid="285/0293">Yu-Chen Lin</author>
<author pid="01/5268">Chang-Biau Yang</author>
<author pid="172/6607">Ho-Chun Lin</author>
<author pid="51/5026">Yung-Hsing Peng</author>
<author pid="00/4925">Szu-Hsuan Wang</author>
<title>An Improved Algorithm with Azimuth Clustering for Detecting Turning Regions on GPS Trajectories.</title>
<pages>151-161</pages>
<year>2023</year>
<booktitle>TAAI (1)</booktitle>
<ee>https://doi.org/10.1007/978-981-97-1711-8_11</ee>
<crossref>conf/taai/2023-1</crossref>
<url>db/conf/taai/taai2023-1.html#HuangLYLPW23</url>
</inproceedings>
</r>
<r><article key="journals/tcs/LiangYH22" mdate="2022-06-27">
<author pid="309/7671">Ting-Wei Liang</author>
<author pid="01/5268">Chang-Biau Yang</author>
<author pid="68/5260">Kuo-Si Huang</author>
<title>An efficient algorithm for the longest common palindromic subsequence problem.</title>
<pages>475-485</pages>
<year>2022</year>
<volume>922</volume>
<journal>Theor. Comput. Sci.</journal>
<ee>https://doi.org/10.1016/j.tcs.2022.04.046</ee>
<url>db/journals/tcs/tcs922.html#LiangYH22</url>
</article>
</r>
<r><article key="journals/tcs/LoTYH20" mdate="2020-03-18">
<author pid="211/7347">Shou-Fu Lo</author>
<author pid="52/4198">Kuo-Tsung Tseng</author>
<author pid="01/5268">Chang-Biau Yang</author>
<author pid="68/5260">Kuo-Si Huang</author>
<title>A diagonal-based algorithm for the longest common increasing subsequence problem.</title>
<pages>69-78</pages>
<year>2020</year>
<volume>815</volume>
<journal>Theor. Comput. Sci.</journal>
<ee>https://doi.org/10.1016/j.tcs.2020.02.024</ee>
<url>db/journals/tcs/tcs815.html#LoTYH20</url>
</article>
</r>
<r><inproceedings key="conf/intcompsymp/HungYH18" mdate="2019-07-18">
<author pid="245/1017">Siang-Huai Hung</author>
<author pid="01/5268">Chang-Biau Yang</author>
<author pid="68/5260">Kuo-Si Huang</author>
<title>A Diagonal-Based Algorithm for the Constrained Longest Common Subsequence Problem.</title>
<pages>425-432</pages>
<year>2018</year>
<booktitle>ICS</booktitle>
<ee>https://doi.org/10.1007/978-981-13-9190-3_45</ee>
<crossref>conf/intcompsymp/2018</crossref>
<url>db/conf/intcompsymp/ics2018.html#HungYH18</url>
</inproceedings>
</r>
<r><inproceedings key="conf/iccS/HsuHYG15" mdate="2017-05-21">
<author pid="164/9751">Che-Jui Hsu</author>
<author pid="68/5260">Kuo-Si Huang</author>
<author pid="01/5268">Chang-Biau Yang</author>
<author pid="164/9874">Yi-Pu Guo</author>
<title>Flexible Dynamic Time Warping for Time Series Classification.</title>
<pages>2838-2842</pages>
<year>2015</year>
<booktitle>ICCS</booktitle>
<ee>https://doi.org/10.1016/j.procs.2015.05.444</ee>
<crossref>conf/iccS/2015</crossref>
<url>db/conf/iccS/iccS2015.html#HsuHYG15</url>
</inproceedings>
</r>
<r><article key="journals/ijfcs/ChiuHYT14" mdate="2017-05-27">
<author pid="06/7868">Chiao-Wei Chiu</author>
<author pid="68/5260">Kuo-Si Huang</author>
<author pid="01/5268">Chang-Biau Yang</author>
<author pid="75/845">Chiou-Ting Tseng</author>
<title>An Adaptive Heuristic Algorithm with the Probabilistic Safety Vector for Fault-Tolerant Routing on the (n, k)-Star Graph.</title>
<pages>723-744</pages>
<year>2014</year>
<volume>25</volume>
<journal>Int. J. Found. Comput. Sci.</journal>
<number>6</number>
<ee>https://doi.org/10.1142/S0129054114500300</ee>
<url>db/journals/ijfcs/ijfcs25.html#ChiuHYT14</url>
</article>
</r>
<r><article key="journals/ijfcs/PengYTH10" mdate="2017-05-27">
<author pid="51/5026">Yung-Hsing Peng</author>
<author pid="01/5268">Chang-Biau Yang</author>
<author pid="52/4198">Kuo-Tsung Tseng</author>
<author pid="68/5260">Kuo-Si Huang</author>
<title>An Algorithm and Applications to Sequence Alignment with Weighted Constraints.</title>
<pages>51-59</pages>
<year>2010</year>
<volume>21</volume>
<journal>Int. J. Found. Comput. Sci.</journal>
<number>1</number>
<ee>https://doi.org/10.1142/S012905411000712X</ee>
<url>db/journals/ijfcs/ijfcs21.html#PengYTH10</url>
</article>
</r>
<r><article key="journals/ipl/PengYHA10" mdate="2017-05-26">
<author pid="51/5026">Yung-Hsing Peng</author>
<author pid="01/5268">Chang-Biau Yang</author>
<author pid="68/5260">Kuo-Si Huang</author>
<author pid="95/3960">Hsing-Yen Ann</author>
<title>Efficient indexing algorithms for one-dimensional discretely-scaled strings.</title>
<pages>730-734</pages>
<year>2010</year>
<volume>110</volume>
<journal>Inf. Process. Lett.</journal>
<number>16</number>
<ee>https://doi.org/10.1016/j.ipl.2010.05.012</ee>
<url>db/journals/ipl/ipl110.html#PengYHA10</url>
</article>
</r>
<r><inproceedings key="conf/bic-ta/LinYHH10" mdate="2017-05-17">
<author pid="43/10059">Chih-Ying Lin</author>
<author pid="01/5268">Chang-Biau Yang</author>
<author pid="50/1426">Chiou-Yi Hor</author>
<author pid="68/5260">Kuo-Si Huang</author>
<title>Disulfide bonding state prediction with SVM based on protein types.</title>
<pages>1436-1442</pages>
<year>2010</year>
<booktitle>BIC-TA</booktitle>
<ee>https://doi.org/10.1109/BICTA.2010.5645282</ee>
<crossref>conf/bic-ta/2010</crossref>
<url>db/conf/bic-ta/bic-ta2010.html#LinYHH10</url>
</inproceedings>
</r>
<r><inproceedings key="conf/ispan/ChiuYHT09" mdate="2023-03-24">
<author pid="06/7868">Chiao-Wei Chiu</author>
<author pid="01/5268">Chang-Biau Yang</author>
<author pid="68/5260">Kuo-Si Huang</author>
<author pid="75/845">Chiou-Ting Tseng</author>
<title>A Fault-Tolerant Routing Algorithm with Safety Vectors on the (n, k)-Star Graph.</title>
<pages>34-39</pages>
<year>2009</year>
<booktitle>ISPAN</booktitle>
<ee>https://doi.org/10.1109/I-SPAN.2009.141</ee>
<ee>https://doi.ieeecomputersociety.org/10.1109/I-SPAN.2009.141</ee>
<crossref>conf/ispan/2009</crossref>
<url>db/conf/ispan/ispan2009.html#ChiuYHT09</url>
</inproceedings>
</r>
<r><article key="journals/ieicet/TsengYHP08" mdate="2020-04-11">
<author pid="52/4198">Kuo-Tsung Tseng</author>
<author pid="01/5268">Chang-Biau Yang</author>
<author pid="68/5260">Kuo-Si Huang</author>
<author pid="51/5026">Yung-Hsing Peng</author>
<title>Near-Optimal Block Alignments.</title>
<pages>789-795</pages>
<year>2008</year>
<volume>91-D</volume>
<journal>IEICE Trans. Inf. Syst.</journal>
<number>3</number>
<ee>https://doi.org/10.1093/ietisy/e91-d.3.789</ee>
<url>db/journals/ieicet/ieicet91d.html#TsengYHP08</url>
</article>
</r>
<r><article key="journals/ipl/HuangYTAP08" mdate="2017-05-26">
<author pid="68/5260">Kuo-Si Huang</author>
<author pid="01/5268">Chang-Biau Yang</author>
<author pid="52/4198">Kuo-Tsung Tseng</author>
<author pid="95/3960">Hsing-Yen Ann</author>
<author pid="51/5026">Yung-Hsing Peng</author>
<title>Efficient algorithms for finding interleaving relationship between sequences.</title>
<pages>188-193</pages>
<year>2008</year>
<volume>105</volume>
<journal>Inf. Process. Lett.</journal>
<number>5</number>
<ee>https://doi.org/10.1016/j.ipl.2007.08.028</ee>
<url>db/journals/ipl/ipl105.html#HuangYTAP08</url>
</article>
</r>
<r><article key="journals/ipl/HuangYTPA07" mdate="2017-05-26">
<author pid="68/5260">Kuo-Si Huang</author>
<author pid="01/5268">Chang-Biau Yang</author>
<author pid="52/4198">Kuo-Tsung Tseng</author>
<author pid="51/5026">Yung-Hsing Peng</author>
<author pid="95/3960">Hsing-Yen Ann</author>
<title>Dynamic programming algorithms for the mosaic longest common subsequence problem.</title>
<pages>99-103</pages>
<year>2007</year>
<volume>102</volume>
<journal>Inf. Process. Lett.</journal>
<number>2-3</number>
<ee>https://doi.org/10.1016/j.ipl.2006.11.006</ee>
<url>db/journals/ipl/ipl102.html#HuangYTPA07</url>
</article>
</r>
<r><inproceedings key="conf/metmbs/HuangTY05" mdate="2006-02-15">
<author pid="68/5260">Kuo-Si Huang</author>
<author pid="52/4198">Kuo-Tsung Tseng</author>
<author pid="01/5268">Chang-Biau Yang</author>
<title>The Better Alignment Among Output Alignments.</title>
<pages>31-40</pages>
<year>2005</year>
<crossref>conf/metmbs/2005</crossref>
<booktitle>METMBS</booktitle>
<url>db/conf/metmbs/metmbs2005.html#HuangTY05</url>
</inproceedings>
</r>
<coauthors n="19" nc="1">
<co c="0"><na f="a/Ann:Hsing=Yen" pid="95/3960">Hsing-Yen Ann</na></co>
<co c="0"><na f="c/Chiu:Chiao=Wei" pid="06/7868">Chiao-Wei Chiu</na></co>
<co c="0"><na f="g/Guo:Yi=Pu" pid="164/9874">Yi-Pu Guo</na></co>
<co c="0"><na f="h/Hor:Chiou=Yi" pid="50/1426">Chiou-Yi Hor</na></co>
<co c="0"><na f="h/Hsu:Che=Jui" pid="164/9751">Che-Jui Hsu</na></co>
<co c="0"><na f="h/Hung:Siang=Huai" pid="245/1017">Siang-Huai Hung</na></co>
<co c="0"><na f="l/Lee:Chien=Ting" pid="392/2273">Chien-Ting Lee</na></co>
<co c="0"><na f="l/Liang:Ting=Wei" pid="309/7671">Ting-Wei Liang</na></co>
<co c="0"><na f="l/Lin:Bi=Shiang" pid="349/5647">Bi-Shiang Lin</na></co>
<co c="0"><na f="l/Lin:Chih=Ying" pid="43/10059">Chih-Ying Lin</na></co>
<co c="0"><na f="l/Lin:Ho=Chun" pid="172/6607">Ho-Chun Lin</na></co>
<co c="0" n="2"><na f="l/Lin:Yuchen" pid="285/0293">Yuchen Lin</na><na>Yu-Chen Lin</na></co>
<co c="0"><na f="l/Lo:Shou=Fu" pid="211/7347">Shou-Fu Lo</na></co>
<co c="0"><na f="l/Lu:Tsung=Lin" pid="02/8100">Tsung-Lin Lu</na></co>
<co c="0"><na f="p/Peng:Yung=Hsing" pid="51/5026">Yung-Hsing Peng</na></co>
<co c="0"><na f="t/Tseng:Chiou=Ting" pid="75/845">Chiou-Ting Tseng</na></co>
<co c="0"><na f="t/Tseng:Kuo=Tsung" pid="52/4198">Kuo-Tsung Tseng</na></co>
<co c="0"><na f="w/Wang:Szu=Hsuan" pid="00/4925">Szu-Hsuan Wang</na></co>
<co c="0"><na f="y/Yang:Chang=Biau" pid="01/5268">Chang-Biau Yang</na></co>
</coauthors>
</dblpperson>

