Chang-Biau Yang

Orcid: 0000-0001-6643-5523

According to our database1, Chang-Biau Yang authored at least 61 papers between 1986 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.



In proceedings 
PhD thesis 




Linear-space S-table algorithms for the longest common subsequence problem.
Theor. Comput. Sci., 2023

An Improved Algorithm with Azimuth Clustering for Detecting Turning Regions on GPS Trajectories.
Proceedings of the Technologies and Applications of Artificial Intelligence, 2023

An Algorithm for Finding the Longest Common Almost Wave Subsequence with the Trend.
Proceedings of the 14th IIAI International Congress on Advanced Applied Informatics, 2023

An efficient algorithm for the longest common palindromic subsequence problem.
Theor. Comput. Sci., 2022

A diagonal-based algorithm for the longest common increasing subsequence problem.
Theor. Comput. Sci., 2020

The Generalized Definitions of the Two-Dimensional Largest Common Substructure Problems.
Algorithmica, 2020

Efficient merged longest common subsequence algorithms for similar sequences.
Theor. Comput. Sci., 2018

Trading Decision of Taiwan Stocks with the Help of United States Stock Market.
Proceedings of the Knowledge-Based and Intelligent Information & Engineering Systems: Proceedings of the 22nd International Conference KES-2018, 2018

A Diagonal-Based Algorithm for the Constrained Longest Common Subsequence Problem.
Proceedings of the New Trends in Computer Technologies and Applications, 2018

A Minimum-First Algorithm for Dynamic Time Warping on Time Series.
Proceedings of the New Trends in Computer Technologies and Applications, 2018

Multiperiod portfolio investment using stochastic programming with conditional value at risk.
Comput. Oper. Res., 2017

Coordinate Refinement on All Atoms of the Protein Backbone with Support Vector Regression.
Proceedings of the Advances in Data Mining. Applications and Theoretical Aspects, 2016

Flexible Dynamic Time Warping for Time Series Classification.
Proceedings of the International Conference on Computational Science, 2015

Efficient polynomial-time algorithms for the constrained LCS problem with strings exclusion.
J. Comb. Optim., 2014

An Adaptive Heuristic Algorithm with the Probabilistic Safety Vector for Fault-Tolerant Routing on the (n, k)-Star Graph.
Int. J. Found. Comput. Sci., 2014

Finding the gapped longest common subsequence by incremental suffix maximum queries.
Inf. Comput., 2014

The trading on the mutual funds by gene expression programming with Sortino ratio.
Appl. Soft Comput., 2014

Taiwan Stock Investment with Gene Expression Programming.
Proceedings of the 18th International Conference in Knowledge Based and Intelligent Information and Engineering Systems, 2014

Efficient algorithms for the longest common subsequence problem with sequential substring constraints.
J. Complex., 2013

The Disulfide Connectivity Prediction with Support Vector Machine and Behavior Knowledge Space.
Proceedings of the KDIR/KMIS 2013 - Proceedings of the International Conference on Knowledge Discovery and Information Retrieval and the International Conference on Knowledge Management and Information Sharing, Vilamoura, Algarve, Portugal, 19, 2013

The Application of Support Vector Machine and Behavior Knowledge Space in the Disulfide Connectivity Prediction Problem.
Proceedings of the Knowledge Discovery, Knowledge Engineering and Knowledge Management, 2013

Fast algorithms for computing the constrained LCS of run-length encoded strings.
Theor. Comput. Sci., 2012

A new efficient indexing algorithm for one-dimensional real scaled patterns.
J. Comput. Syst. Sci., 2012

Prediction of Protein Essentiality by the Support Vector Machine with Statistical Tests.
Proceedings of the 11th International Conference on Machine Learning and Applications, 2012

The indexing for one-dimensional proportionally-scaled strings.
Inf. Process. Lett., 2011

Genetic algorithms for the investment of the mutual fund with global trend indicator.
Expert Syst. Appl., 2011

Reconstruction of Protein Backbone with the alpha-Carbon Coordinates.
J. Inf. Sci. Eng., 2010

Efficient indexing algorithms for one-dimensional discretely-scaled strings.
Inf. Process. Lett., 2010

An Algorithm and Applications to Sequence Alignment with Weighted Constraints.
Int. J. Found. Comput. Sci., 2010

Efficient algorithms for the block edit problems.
Inf. Comput., 2010

A Tool Preference Selection Method for RNA Secondary Structure Prediction with SVM.
Proceedings of the International Conference on Bioinformatics & Computational Biology, 2010

Disulfide bonding state prediction with SVM based on protein types.
Proceedings of the Fifth International Conference on Bio-Inspired Computing: Theories and Applications, 2010

Tempo and beat tracking for audio signals with music genre classification.
Int. J. Intell. Inf. Database Syst., 2009

A Fault-Tolerant Routing Algorithm with Safety Vectors on the (n, k)-Star Graph.
Proceedings of the 10th International Symposium on Pervasive Systems, 2009

Efficient algorithms for finding interleaving relationship between sequences.
Inf. Process. Lett., 2008

A fast and simple algorithm for computing the longest common subsequence of run-length encoded strings.
Inf. Process. Lett., 2008

Near-Optimal Block Alignments.
IEICE Trans. Inf. Syst., 2008

Efficient Sparse Dynamic Programming for the Merged LCS Problem.
Proceedings of the International Conference on Bioinformatics & Computational Biology, 2008

Dynamic programming algorithms for the mosaic longest common subsequence problem.
Inf. Process. Lett., 2007

Solving satisfiability problems using a novel microarray-based DNA computer.
Biosyst., 2007

Tree edge decomposition with an application to minimum ultrametric tree approximation.
J. Comb. Optim., 2006

Generalization of Sorting in Single Hop Wireless Networks.
IEICE Trans. Inf. Syst., 2006

1-Fair Alternator Designs for the de Bruijn Network.
Proceedings of the Seventh International Conference on Parallel and Distributed Computing, 2006

Routing Algorithms on the Bus-Based Hypercube Network.
IEEE Trans. Parallel Distributed Syst., 2005

A Fast Initialization Algorithm for Single-Hop Wireless Networks.
IEICE Trans. Commun., 2005

The Better Alignment Among Output Alignments.
Proceedings of The 2005 International Conference on Mathematics and Engineering Techniques in Medicine and Biological Sciences, 2005

Broadcasting on Uni-directional Hypercubes and Its Applications.
J. Inf. Sci. Eng., 2003

A Design for Node Coloring and 1-Fair Alternator on de Bruijn Networks.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2003

Fault-Tolerant Routing on the Star Graph with Safety Vectors.
Proceedings of the International Symposium on Parallel Architectures, 2002

Multicast Algorithms for Hypercube Multiprocessors.
J. Parallel Distributed Comput., 2001

Shortest path routing and fault-tolerant routing on de Bruijn networks.
Networks, 2000

A Fast Sorting Algorithm and Its Generalization on Broadcast Communications.
Proceedings of the Computing and Combinatorics, 6th Annual International Conference, 2000

Computational Geometry on the Broadcast Communication Model.
J. Inf. Sci. Eng., 1999

A Parallel Algorithm for Circulant Tridiagonal Linear Systems.
Inf. Process. Lett., 1998

Wormhole Routing on the Star Graph Interconnection Network.
Proceedings of Computing: The Fourth Australasian Theory Symposium (CATS'98), 1998

A Fast Maximum Finding Algorithm on Broadcast Communication.
Inf. Process. Lett., 1996

Design of An Integrated Parallel Processing System with Systolic VLSI Chips.
J. Inf. Sci. Eng., 1991

Reducing Conflict Resolution Time for Solving Graph Problems in Broadcast Communications.
Inf. Process. Lett., 1991

Conflict-Free Sorting Algorithms Under Single-Channel and Multi-Channel Broadcast Communication Models.
Proceedings of the Advances in Computing and Information, 1991

Parallel Graph Algorithms Based Upon Broadcast Communications.
IEEE Trans. Computers, 1990

The mapping of 2-D array processors to 1-D array processors.
Parallel Comput., 1986