Kun-Mao Chao
Orcid: 0000-0003-2837-1279Affiliations:
- National Taiwan University, Taipei, Taiwan
According to our database1,
Kun-Mao Chao
authored at least 95 papers
between 1990 and 2022.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on scopus.com
-
on orcid.org
On csauthors.net:
Bibliography
2022
Discret. Appl. Math., 2022
2018
Optimum Communication Spanning Trees.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018
Approximation Algorithms for the Selection of Robust Tag SNPs.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018
2016
A Takagi-Sugeno fuzzy neural network-based algorithm with single-channel EEG signal for the discrimination between light and deep sleep stages.
Proceedings of the IEEE Biomedical Circuits and Systems Conference, 2016
Proceedings of the Algorithmic Aspects in Information and Management, 2016
2015
A Fixed-Parameter Algorithm for Detecting a Singleton Attractor in an AND/OR Boolean Network with Bounded Treewidth.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2015
Proceedings of the WALCOM: Algorithms and Computation - 9th International Workshop, 2015
2014
Proceedings of the Algorithms and Computation - 25th International Symposium, 2014
2013
A linear-time algorithm for finding an edge-partition with max-min ratio at most two.
Discret. Appl. Math., 2013
A Fully Compressed Algorithm for Computing the Edit Distance of Run-Length Encoded Strings.
Algorithmica, 2013
Proceedings of the Combinatorial Algorithms - 24th International Workshop, 2013
Proceedings of the Algorithms and Computation - 24th International Symposium, 2013
Proceedings of the Database Systems for Advanced Applications, 2013
2012
Theor. Comput. Sci., 2012
Proceedings of the Algorithms in Bioinformatics - 12th International Workshop, 2012
Asymptotic Limits of a New Type of Maximization Recurrence with an Application to Bioinformatics.
Proceedings of the Theory and Applications of Models of Computation, 2012
2011
IEEE ACM Trans. Comput. Biol. Bioinform., 2011
SIGMOD Rec., 2011
J. Discrete Algorithms, 2011
J. Comb. Optim., 2011
Proceedings of the Database Systems for Advanced Applications, 2011
2010
Discret. Appl. Math., 2010
Proceedings of the Algorithms and Computation - 21st International Symposium, 2010
Proceedings of the Database and Expert Systems Applications, 21st International Conference, 2010
2009
Computational Biology 7, Springer, ISBN: 978-1-84800-319-4, 2009
Inf. Process. Lett., 2009
Proceedings of the Combinatorial Pattern Matching, 20th Annual Symposium, 2009
Proceedings of the Combinatorial Pattern Matching, 20th Annual Symposium, 2009
2008
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008
Algorithms for finding the weight-constrained k longest paths in a tree and the length-constrained k maximum-sum segments of a sequence.
Theor. Comput. Sci., 2008
J. Biomed. Informatics, 2008
Proceedings of the ECCB'08 Proceedings, 2008
2007
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007
A tight analysis of the Katriel-Bodlaender algorithm for online topological ordering.
Theor. Comput. Sci., 2007
Algorithms for Computing the Length-Constrained Max-Score Segments with Applications to DNA Copy Number Data Analysis.
Proceedings of the Algorithms and Computation, 18th International Symposium, 2007
2006
Theor. Comput. Sci., 2006
2005
J. Comput. Biol., 2005
Inf. Process. Lett., 2005
Optimal algorithms for locating the longest and shortest segments satisfying a sum or an average constraint.
Inf. Process. Lett., 2005
BMC Bioinform., 2005
2004
An Optimal Algorithm for Querying Tree Structures and its Applications in Bioinformatics.
SIGMOD Rec., 2004
Bioinform., 2004
Proceedings of the Algorithms in Bioinformatics, 4th International Workshop, 2004
A Sensitive Sequence Comparison Method.
Proceedings of the 4th IEEE International Workshop on Source Code Analysis and Manipulation (SCAM 2004), 2004
Proceedings of the 4th IEEE International Symposium on BioInformatics and BioEngineering (BIBE 2004), 2004
Spanning trees and optimization problems.
Discrete mathematics and its applications, Chapman & Hall, ISBN: 978-1-58488-436-1, 2004
2003
Constrained Multiple Sequence Alignment Tool Development Andits Application to Rnase Family Alignment.
J. Bioinform. Comput. Biol., 2003
Bioinform., 2003
2002
Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis.
J. Comput. Syst. Sci., 2002
Constrained Multiple Sequence Alignment Tool Development and Its Application to RNase Family Alignment.
Proceedings of the 1st IEEE Computer Society Bioinformatics Conference, 2002
2000
A Polynomial Time Approximation Scheme for Optimal Product-Requirement Communication Spanning Trees.
J. Algorithms, 2000
Discret. Appl. Math., 2000
Discret. Appl. Math., 2000
1999
SIAM J. Comput., 1999
Approximation and Exact Algorithms for Constructing Minimum Ultrametric Trees from Distance Matrices.
J. Comb. Optim., 1999
Inf. Process. Lett., 1999
Proceedings of the STACS 99, 1999
1998
Inf. Process. Lett., 1998
1997
Proceedings of the Computing and Combinatorics, Third Annual International Conference, 1997
1995
Algorithmica, 1995
1994
J. Comput. Biol., 1994
Proceedings of the Combinatorial Pattern Matching, 5th Annual Symposium, 1994
1993
Comput. Appl. Biosci., 1993
1992
1990