default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChang-Biau Yang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j40]Cheng-Han Ho, Chang-Biau Yang
:
The longest almost increasing subsequence problem with sliding windows. Theor. Comput. Sci. 1005: 114639 (2024)- [c27]Chien-Ting Lee, Chang-Biau Yang, Kuo-Si Huang:
The Merged Longest Common Increasing Subsequence Problem. ACIIDS (Companion 1) 2024: 202-212 - [c26]Wen-Wen Liao, Chang-Biau Yang:
Almost Order Preserving Matching. IIAI-AAI 2024: 385-390 - 2023
- [j39]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) - [c25]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 - [c24]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
- [j38]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
- [j37]Huang-Ting Chan, Hsuan-Tsung Chiu, Chang-Biau Yang, Yung-Hsing Peng:
The Generalized Definitions of the Two-Dimensional Largest Common Substructure Problems. Algorithmica 82(7): 2039-2062 (2020) - [j36]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
- [j35]Kuo-Tsung Tseng, De-Sheng Chan, Chang-Biau Yang, Shou-Fu Lo:
Efficient merged longest common subsequence algorithms for similar sequences. Theor. Comput. Sci. 708: 75-90 (2018) - [c23]Siang-Huai Hung, Chang-Biau Yang, Kuo-Si Huang:
A Diagonal-Based Algorithm for the Constrained Longest Common Subsequence Problem. ICS 2018: 425-432 - [c22]Bo-Xian Chen, Kuo-Tsung Tseng, Chang-Biau Yang:
A Minimum-First Algorithm for Dynamic Time Warping on Time Series. ICS 2018: 449-456 - [c21]Shih-Chan Huang, Chang-Biau Yang, Hung-Hsin Chen:
Trading Decision of Taiwan Stocks with the Help of United States Stock Market. KES 2018: 87-96 - 2017
- [j34]Hung-Hsin Chen, Chang-Biau Yang:
Multiperiod portfolio investment using stochastic programming with conditional value at risk. Comput. Oper. Res. 81: 305-321 (2017) - 2016
- [c20]Ding-Yao Huang, Chiou-Yi Hor, Chang-Biau Yang:
Coordinate Refinement on All Atoms of the Protein Backbone with Support Vector Regression. ICDM 2016: 212-222 - 2015
- [c19]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
- [j33]Hung-Hsin Chen, Chang-Biau Yang, Yung-Hsing Peng:
The trading on the mutual funds by gene expression programming with Sortino ratio. Appl. Soft Comput. 15: 219-230 (2014) - [j32]Yung-Hsing Peng, Chang-Biau Yang:
Finding the gapped longest common subsequence by incremental suffix maximum queries. Inf. Comput. 237: 95-100 (2014) - [j31]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) - [j30]Hsing-Yen Ann, Chang-Biau Yang, Chiou-Ting Tseng:
Efficient polynomial-time algorithms for the constrained LCS problem with strings exclusion. J. Comb. Optim. 28(4): 800-813 (2014) - [c18]Cheng-Han Lee, Chang-Biau Yang, Hung-Hsin Chen:
Taiwan Stock Investment with Gene Expression Programming. KES 2014: 137-146 - 2013
- [j29]Chiou-Ting Tseng, Chang-Biau Yang, Hsing-Yen Ann:
Efficient algorithms for the longest common subsequence problem with sequential substring constraints. J. Complex. 29(1): 44-52 (2013) - [c17]Hong-Yu Chen, Kuo-Tsung Tseng, Chang-Biau Yang, Chiou-Yi Hor:
The Application of Support Vector Machine and Behavior Knowledge Space in the Disulfide Connectivity Prediction Problem. IC3K 2013: 66-79 - [c16]Hong-Yu Chen, Chang-Biau Yang, Kuo-Tsung Tseng, Chiou-Yi Hor:
The Disulfide Connectivity Prediction with Support Vector Machine and Behavior Knowledge Space. KDIR/KMIS 2013: 112-118 - 2012
- [j28]Yung-Hsing Peng, Chang-Biau Yang, Chiou-Ting Tseng, Chiou-Yi Hor:
A new efficient indexing algorithm for one-dimensional real scaled patterns. J. Comput. Syst. Sci. 78(1): 273-278 (2012) - [j27]Hsing-Yen Ann, Chang-Biau Yang, Chiou-Ting Tseng, Chiou-Yi Hor:
Fast algorithms for computing the constrained LCS of run-length encoded strings. Theor. Comput. Sci. 432: 1-9 (2012) - [c15]Chiou-Yi Hor, Chang-Biau Yang, Zih-Jie Yang, Chiou-Ting Tseng:
Prediction of Protein Essentiality by the Support Vector Machine with Statistical Tests. ICMLA (1) 2012: 96-101 - 2011
- [j26]Tsung-Jung Tsai, Chang-Biau Yang, Yung-Hsing Peng:
Genetic algorithms for the investment of the mutual fund with global trend indicator. Expert Syst. Appl. 38(3): 1697-1701 (2011) - [j25]Yung-Hsing Peng, Chang-Biau Yang, Chiou-Ting Tseng, Chiou-Yi Hor:
The indexing for one-dimensional proportionally-scaled strings. Inf. Process. Lett. 111(7): 318-322 (2011) - [c14]Chiou-Ting Tseng, Chang-Biau Yang, Hsing-Yen Ann:
Efficient Algorithms for the Longest Common Subsequence Problem with Sequential Substring Constraints. BIBE 2011: 175-180 - 2010
- [j24]Hsing-Yen Ann, Chang-Biau Yang, Yung-Hsing Peng, Bern-Cherng Liaw:
Efficient algorithms for the block edit problems. Inf. Comput. 208(3): 221-229 (2010) - [j23]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) - [j22]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) - [j21]Jen-Hui Wang, Chang-Biau Yang, Chiou-Ting Tseng:
Reconstruction of Protein Backbone with the alpha-Carbon Coordinates. J. Inf. Sci. Eng. 26(3): 1107-1119 (2010) - [c13]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 - [c12]Chiou-Yi Hor, Chang-Biau Yang, Chiou-Ting Tseng, Hung-Hsin Chen:
A Tool Preference Selection Method for RNA Secondary Structure Prediction with SVM. BIOCOMP 2010: 785-791
2000 – 2009
- 2009
- [j20]Mao-Yuan Kao, Chang-Biau Yang, Shyue-Horng Shiau:
Tempo and beat tracking for audio signals with music genre classification. Int. J. Intell. Inf. Database Syst. 3(3): 275-290 (2009) - [c11]Hsing-Yen Ann, Chang-Biau Yang, Chiou-Ting Tseng, Chiou-Yi Hor:
Fast Algorithms for Computing the Constrained LCS of Run-Length Encoded Strings. BIOCOMP 2009: 646-649 - [c10]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
- [j19]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) - [j18]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) - [j17]Hsing-Yen Ann, Chang-Biau Yang, Chiou-Ting Tseng, Chiou-Yi Hor:
A fast and simple algorithm for computing the longest common subsequence of run-length encoded strings. Inf. Process. Lett. 108(6): 360-364 (2008) - [c9]Yung-Hsing Peng, Chang-Biau Yang, Chiou-Ting Tseng, Chiou-Yi Hor:
Efficient Sparse Dynamic Programming for the Merged LCS Problem. BIOCOMP 2008: 383-388 - 2007
- [j16]Che-Hsin Lin, Hsiao-Ping Cheng, Chang-Biau Yang, Chia-Ning Yang:
Solving satisfiability problems using a novel microarray-based DNA computer. Biosyst. 90(1): 242-252 (2007) - [j15]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) - 2006
- [j14]Shyue-Horng Shiau, Chang-Biau Yang:
Generalization of Sorting in Single Hop Wireless Networks. IEICE Trans. Inf. Syst. 89-D(4): 1432-1439 (2006) - [j13]Chia-Mao Huang, Bang Ye Wu, Chang-Biau Yang:
Tree edge decomposition with an application to minimum ultrametric tree approximation. J. Comb. Optim. 12(3): 217-230 (2006) - [c8]Hsu-Shen Lin, Chang-Biau Yang, Kuo-Tsung Tseng:
1-Fair Alternator Designs for the de Bruijn Network. PDCAT 2006: 488-491 - 2005
- [j12]Shyue-Horng Shiau, Chang-Biau Yang:
A Fast Initialization Algorithm for Single-Hop Wireless Networks. IEICE Trans. Commun. 88-B(11): 4285-4292 (2005) - [j11]Lee-Juan Fan, Chang-Biau Yang, Shyue-Horng Shiau:
Routing Algorithms on the Bus-Based Hypercube Network. IEEE Trans. Parallel Distributed Syst. 16(4): 335-348 (2005) - [c7]Kuo-Si Huang, Kuo-Tsung Tseng, Chang-Biau Yang:
The Better Alignment Among Output Alignments. METMBS 2005: 31-40 - 2003
- [j10]Huang-Ming Huang, Chang-Biau Yang, Kuo-Tsung Tseng:
Broadcasting on Uni-directional Hypercubes and Its Applications. J. Inf. Sci. Eng. 19(2): 183-203 (2003) - [c6]Jyh-Wen Mao, Chang-Biau Yang:
A Design for Node Coloring and 1-Fair Alternator on de Bruijn Networks. PDPTA 2003: 1872-1878 - 2002
- [c5]Sheng-I Yeh, Chang-Biau Yang, Hon-Chan Chen:
Fault-Tolerant Routing on the Star Graph with Safety Vectors. ISPAN 2002: 301- - 2001
- [j9]Shih-Hsien Sheu, Chang-Biau Yang:
Multicast Algorithms for Hypercube Multiprocessors. J. Parallel Distributed Comput. 61(1): 137-149 (2001) - 2000
- [j8]Jyh-Wen Mao, Chang-Biau Yang:
Shortest path routing and fault-tolerant routing on de Bruijn networks. Networks 35(3): 207-215 (2000) - [c4]Shyue-Horng Shiau, Chang-Biau Yang:
A Fast Sorting Algorithm and Its Generalization on Broadcast Communications. COCOON 2000: 252-261
1990 – 1999
- 1999
- [j7]Chang-Biau Yang:
Computational Geometry on the Broadcast Communication Model. J. Inf. Sci. Eng. 15(3): 383-395 (1999) - 1998
- [j6]Yaw-Wen Chang, Chang-Biau Yang:
A Parallel Algorithm for Circulant Tridiagonal Linear Systems. Inf. Process. Lett. 65(6): 331-337 (1998) - [c3]Chang-Biau Yang, Tung-Hsing Liu:
Wormhole Routing on the Star Graph Interconnection Network. CATS 1998: 51-66 - 1996
- [j5]Shyue-Horng Shiau, Chang-Biau Yang:
A Fast Maximum Finding Algorithm on Broadcast Communication. Inf. Process. Lett. 60(2): 81-89 (1996) - 1995
- [c2]Shyue-Horng Shiau, Chang-Biau Yang:
A Fast Maximum Finding Algorithm on Broadcast Communication. COCOON 1995: 472-481 - 1991
- [j4]Chang-Biau Yang:
Reducing Conflict Resolution Time for Solving Graph Problems in Broadcast Communications. Inf. Process. Lett. 40(6): 295-302 (1991) - [j3]Wen-Tsuen Chen, Jia-Shung Wang, Chia-Cheng Liu, Shi-Jinn Horng, Chang-Biau Yang, Ruey-Zone Huang, Bern-Cherng Liaw:
Design of An Integrated Parallel Processing System with Systolic VLSI Chips. J. Inf. Sci. Eng. 7(2): 217-235 (1991) - [c1]Chang-Biau Yang, Richard C. T. Lee, Wen-Tsuen Chen:
Conflict-Free Sorting Algorithms Under Single-Channel and Multi-Channel Broadcast Communication Models. ICCI 1991: 350-359 - 1990
- [j2]Chang-Biau Yang, Richard C. T. Lee, Wen-Tsuen Chen:
Parallel Graph Algorithms Based Upon Broadcast Communications. IEEE Trans. Computers 39(12): 1468-1472 (1990)
1980 – 1989
- 1986
- [j1]Chang-Biau Yang, Richard C. T. Lee:
The mapping of 2-D array processors to 1-D array processors. Parallel Comput. 3(3): 217-229 (1986)
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 13:06 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:
