# Chang-Biau Yang

Orcid: 0000-0001-6643-5523
According to our database

Collaborative distances:

^{1}, Chang-Biau Yang authored at least 61 papers between 1986 and 2023.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Dataset Other## Links

#### On csauthors.net:

## Bibliography

2023

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

2022

Theor. Comput. Sci., 2022

2020

Theor. Comput. Sci., 2020

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

Algorithmica, 2020

2018

Theor. Comput. Sci., 2018

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

Proceedings of the New Trends in Computer Technologies and Applications, 2018

2017

Multiperiod portfolio investment using stochastic programming with conditional value at risk.

Comput. Oper. Res., 2017

2016

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

2015

Proceedings of the International Conference on Computational Science, 2015

2014

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

Proceedings of the 18th International Conference in Knowledge Based and Intelligent Information and Engineering Systems, 2014

2013

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

2012

Theor. Comput. Sci., 2012

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

2011

Inf. Process. Lett., 2011

Genetic algorithms for the investment of the mutual fund with global trend indicator.

Expert Syst. Appl., 2011

2010

J. Inf. Sci. Eng., 2010

Inf. Process. Lett., 2010

Int. J. Found. Comput. Sci., 2010

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

Proceedings of the Fifth International Conference on Bio-Inspired Computing: Theories and Applications, 2010

2009

Int. J. Intell. Inf. Database Syst., 2009

Proceedings of the 10th International Symposium on Pervasive Systems, 2009

2008

Inf. Process. Lett., 2008

A fast and simple algorithm for computing the longest common subsequence of run-length encoded strings.

Inf. Process. Lett., 2008

IEICE Trans. Inf. Syst., 2008

Efficient Sparse Dynamic Programming for the Merged LCS Problem.

Proceedings of the International Conference on Bioinformatics & Computational Biology, 2008

2007

Inf. Process. Lett., 2007

Biosyst., 2007

2006

Tree edge decomposition with an application to minimum ultrametric tree approximation.

J. Comb. Optim., 2006

IEICE Trans. Inf. Syst., 2006

Proceedings of the Seventh International Conference on Parallel and Distributed Computing, 2006

2005

IEEE Trans. Parallel Distributed Syst., 2005

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

2003

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

2002

Proceedings of the International Symposium on Parallel Architectures, 2002

2001

J. Parallel Distributed Comput., 2001

2000

Networks, 2000

Proceedings of the Computing and Combinatorics, 6th Annual International Conference, 2000

1999

J. Inf. Sci. Eng., 1999

1998

Inf. Process. Lett., 1998

Wormhole Routing on the Star Graph Interconnection Network.

Proceedings of Computing: The Fourth Australasian Theory Symposium (CATS'98), 1998

1996

Inf. Process. Lett., 1996

1991

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

1990

IEEE Trans. Computers, 1990

1986

Parallel Comput., 1986