Kun-Mao Chao

Orcid: 0000-0003-2837-1279

Affiliations:
  • National Taiwan University, Taipei, Taiwan


According to our database1, Kun-Mao Chao authored at least 96 papers between 1990 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Lower Bounds for the Minimum Spanning Tree Cycle Intersection Problem.
CoRR, 2024

2022
Proof of a Conjecture About Minimum Spanning Tree Cycle Intersection.
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
Maximum-Sum Segments.
Encyclopedia of Algorithms, 2016

Maximum-Average Segments.
Encyclopedia of Algorithms, 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

Computing the Line-Constrained k-center in the Plane for Small k.
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

Forming Plurality at Minimum Cost.
Proceedings of the WALCOM: Algorithms and Computation - 9th International Workshop, 2015

2014
Algorithms and Computation (ISAAC 2012).
Theor. Comput. Sci., 2014

Locating Valid SLCAs for XML Keyword Search with NOT Semantics.
SIGMOD Rec., 2014

A fault-tolerant method for HLA typing with PacBio data.
BMC Bioinform., 2014

Preface Algorithms and Computation (ISAAC 2012).
Algorithmica, 2014

The Generalized Popular Condensation Problem.
Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

2013
Guest Editors' Foreword.
Int. J. Comput. Geom. Appl., 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

An Optimal Algorithm for the Popular Condensation Problem.
Proceedings of the Combinatorial Algorithms - 24th International Workshop, 2013

Computing Plurality Points and Condorcet Points in Euclidean Space.
Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

A Compact and Efficient Labeling Scheme for XML Documents.
Proceedings of the Database Systems for Advanced Applications, 2013

2012
Efficient retrieval of approximate palindromes in a run-length encoded string.
Theor. Comput. Sci., 2012

Efficient algorithms for local ranking.
Inf. Process. Lett., 2012

Preserving Inversion Phylogeny Reconstruction.
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
Linear-Time Algorithms for the Multiple Gene Duplication Problems.
IEEE ACM Trans. Comput. Biol. Bioinform., 2011

Improving the performance of identifying contributors for XML keyword search.
SIGMOD Rec., 2011

Finding all sorting tandem duplication random loss operations.
J. Discrete Algorithms, 2011

On the generalized constrained longest common subsequence problems.
J. Comb. Optim., 2011

Minkowski Sum Selection and Finding.
Int. J. Comput. Geom. Appl., 2011

Identifying Relevant Matches with NOT Semantics over XML Documents.
Proceedings of the Database Systems for Advanced Applications, 2011

2010
Hardness of comparing two run-length encoded strings.
J. Complex., 2010

Finding All Approximate Gapped Palindromes.
Int. J. Found. Comput. Sci., 2010

A tight bound on the min-ratio edge-partitioning problem of a tree.
Discret. Appl. Math., 2010

Identifying Approximate Palindromes in Run-Length Encoded Strings.
Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

Faster Algorithms for Searching Relevant Matches in XML Databases.
Proceedings of the Database and Expert Systems Applications, 21st International Conference, 2010

2009
Sequence Comparison - Theory and Methods
Computational Biology 7, Springer, ISBN: 978-1-84800-319-4, 2009

The backup 2-center and backup 2-median problems on trees.
Networks, 2009

Optimal algorithms for the average-constrained maximum-sum segment problem.
Inf. Process. Lett., 2009

On Locating Disjoint Segments with Maximum Sum of Densities.
Algorithmica, 2009

Approximate Matching for Run-Length Encoded Strings Is 3sum-Hard.
Proceedings of the Combinatorial Pattern Matching, 20th Annual Symposium, 2009

Finding All Sorting Tandem Duplication Random Loss Operations.
Proceedings of the Combinatorial Pattern Matching, 20th Annual Symposium, 2009

2008
Maximum-scoring Segment with Length Restrictions.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Maximum-Density Segment.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

The 2-radius and 2-radiian problems on trees.
Theor. Comput. Sci., 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

A new framework for the selection of tag SNPs by multimarker haplotypes.
J. Biomed. Informatics, 2008

Algorithms for Locating Constrained Optimal Intervals
CoRR, 2008

An Õ(n<sup>2.5</sup>)-Time Algorithm for Online Topological Ordering
CoRR, 2008

CNVDetector: locating copy number variations using array CGH data.
Bioinform., 2008

The Swap Edges of a Multiple-Sources Routing Tree.
Algorithmica, 2008

PhosphoPOINT: a comprehensive human kinase interactome and phospho-protein database.
Proceedings of the ECCB'08 Proceedings, 2008

2007
Approximation Algorithms for the Selection of Robust Tag SNPs.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

Optimum Communication Spanning Trees.
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

On the uniform edge-partition of a tree.
Discret. Appl. Math., 2007

On the range maximum-sum segment query problem.
Discret. Appl. Math., 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
Improved algorithms for the <i>k</i> maximum-sums problems.
Theor. Comput. Sci., 2006

A greedier approach for finding tag SNPs.
Bioinform., 2006

2005
Finding a Length-Constrained Maximum-Density Path in a Tree.
J. Comb. Optim., 2005

An Approximation Algorithm for Haplotype Inference by Maximum Parsimony.
J. Comput. Biol., 2005

A fast algorithm for computing a longest common increasing subsequence.
Inf. Process. Lett., 2005

Optimal algorithms for locating the longest and shortest segments satisfying a sum or an average constraint.
Inf. Process. Lett., 2005

Selecting additional tag SNPs for tolerating missing data in genotyping.
BMC Bioinform., 2005

2004
An Optimal Algorithm for Querying Tree Structures and its Applications in Bioinformatics.
SIGMOD Rec., 2004

Efficient combination of multiple word models for improved sequence comparison.
Bioinform., 2004

Approximation Algorithms for the Selection of Robust Tag SNPs.
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

Efficient Methods for Generating Optimal Single and Multiple Spaced Seeds.
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

MAVG: locating non-overlapping maximum average segments in a given sequence.
Bioinform., 2003

A generalized global alignment algorithm.
Bioinform., 2003

2002
Light graphs with small routing cost.
Networks, 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

Approximation algorithms for some optimum communication spanning tree problems.
Discret. Appl. Math., 2000

Approximation algorithms for the shortest total path length spanning tree problem.
Discret. Appl. Math., 2000

1999
A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees.
SIAM J. Comput., 1999

Approximation and Exact Algorithms for Constructing Minimum Ultrametric Trees from Distance Matrices.
J. Comb. Optim., 1999

An Efficient Algorithm for the Length-Constrained Heaviest Path Problem on a Tree.
Inf. Process. Lett., 1999

Calign: aligning sequences with restricted affine gap penalties.
Bioinform., 1999

Constructing Light Spanning Trees with Small Routing Cost.
Proceedings of the STACS 99, 1999

1998
On Computing all Supoptimal Alignments.
Inf. Sci., 1998

The NPO-Completeness of the Longest Hamiltonian Cycle Problem.
Inf. Process. Lett., 1998

1997
A tool for aligning very similar DNA sequences.
Comput. Appl. Biosci., 1997

Fast Algorithms for Aligning Sequences with Restricted Affine Gap Penalties.
Proceedings of the Computing and Combinatorics, Third Annual International Conference, 1997

1995
A local alignment tool for very long DNA sequences.
Comput. Appl. Biosci., 1995

Linear-Space Algorithms that Build Local Alignments from Fragments.
Algorithmica, 1995

1994
Recent Developments in Linear-Space Alignment Methods: A Survey.
J. Comput. Biol., 1994

Computing all Suboptimal Alignments in Linear Space.
Proceedings of the Combinatorial Pattern Matching, 5th Annual Symposium, 1994

1993
Locating well-conserved regions within a pairwise alignment.
Comput. Appl. Biosci., 1993

1992
Aligning two sequences within a specified diagonal band.
Comput. Appl. Biosci., 1992

1990
Parallel Operator-Precedence Parsing.
J. Inf. Sci. Eng., 1990


  Loading...