Kun-Mao Chao

Discret. Appl. Math., 2022

2018

Optimum Communication Spanning Trees.

[BibT_eX]

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018

Approximation Algorithms for the Selection of Robust Tag SNPs.

[BibT_eX]

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018

2016

Maximum-Sum Segments.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Maximum-Average Segments.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Tsung-Han Tsai

Lih-Jen Kau

Proceedings of the IEEE Biomedical Circuits and Systems Conference, 2016

Computing the Line-Constrained k-center in the Plane for Small k.

[BibT_eX]

[DOI]

Albert Jhih-Heng Huang

Hung-Lung Wang

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.

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2015

Forming Plurality at Minimum Cost.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation - 9th International Workshop, 2015

2014

Algorithms and Computation (ISAAC 2012).

[BibT_eX]

[DOI]

Tsan-sheng Hsu

D. T. Lee

Theor. Comput. Sci., 2014

Locating Valid SLCAs for XML Keyword Search with NOT Semantics.

[BibT_eX]

[DOI]

SIGMOD Rec., 2014

A fault-tolerant method for HLA typing with PacBio data.

[BibT_eX]

[DOI]

BMC Bioinform., 2014

Preface Algorithms and Computation (ISAAC 2012).

[BibT_eX]

[DOI]

Tsan-sheng Hsu

D. T. Lee

Algorithmica, 2014

The Generalized Popular Condensation Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

2013

Guest Editors' Foreword.

[BibT_eX]

[DOI]

Tsan-sheng Hsu

Der-Tsai Lee

Int. J. Comput. Geom. Appl., 2013

A linear-time algorithm for finding an edge-partition with max-min ratio at most two.

[BibT_eX]

[DOI]

An-Chiang Chu

Discret. Appl. Math., 2013

An Optimal Algorithm for the Popular Condensation Problem.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 24th International Workshop, 2013

Computing Plurality Points and Condorcet Points in Euclidean Space.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

A Compact and Efficient Labeling Scheme for XML Documents.

[BibT_eX]

[DOI]

Proceedings of the Database Systems for Advanced Applications, 2013

2012

Efficient retrieval of approximate palindromes in a run-length encoded string.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

Efficient algorithms for local ranking.

[BibT_eX]

[DOI]

Chia-Jung Chang

Inf. Process. Lett., 2012

Preserving Inversion Phylogeny Reconstruction.

[BibT_eX]

[DOI]

Proceedings of the Algorithms in Bioinformatics - 12th International Workshop, 2012

Asymptotic Limits of a New Type of Maximization Recurrence with an Application to Bioinformatics.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2012

2011

Linear-Time Algorithms for the Multiple Gene Duplication Problems.

[BibT_eX]

[DOI]

IEEE ACM Trans. Comput. Biol. Bioinform., 2011

Improving the performance of identifying contributors for XML keyword search.

[BibT_eX]

[DOI]

SIGMOD Rec., 2011

Finding all sorting tandem duplication random loss operations.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2011

On the generalized constrained longest common subsequence problems.

[BibT_eX]

[DOI]

Yi-Ching Chen

J. Comb. Optim., 2011

Identifying Relevant Matches with NOT Semantics over XML Documents.

[BibT_eX]

[DOI]

Proceedings of the Database Systems for Advanced Applications, 2011

2010

Hardness of comparing two run-length encoded strings.

[BibT_eX]

[DOI]

J. Complex., 2010

A tight bound on the min-ratio edge-partitioning problem of a tree.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2010

Identifying Approximate Palindromes in Run-Length Encoded Strings.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

A Fully Compressed Algorithm for Computing the Edit Distance of Run-Length Encoded Strings.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2010

Faster Algorithms for Searching Relevant Matches in XML Databases.

[BibT_eX]

[DOI]

Proceedings of the Database and Expert Systems Applications, 21st International Conference, 2010

2009

Sequence Comparison - Theory and Methods

[BibT_eX]

[DOI]

Louxin Zhang

Computational Biology 7, Springer, ISBN: 978-1-84800-319-4, 2009

The backup 2-center and backup 2-median problems on trees.

[BibT_eX]

[DOI]

Hung-Lung Wang

Networks, 2009

Optimal algorithms for the average-constrained maximum-sum segment problem.

[BibT_eX]

[DOI]

Chih-Huai Cheng

Inf. Process. Lett., 2009

Finding All Approximate Gapped Palindromes.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

Approximate Matching for Run-Length Encoded Strings Is 3sum-Hard.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 20th Annual Symposium, 2009

Finding All Sorting Tandem Duplication Random Loss Operations.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 20th Annual Symposium, 2009

2008

Maximum-scoring Segment with Length Restrictions.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Maximum-Density Segment.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

The 2-radius and 2-radiian problems on trees.

[BibT_eX]

[DOI]

Hung-Lung Wang

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.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

A new framework for the selection of tag SNPs by multimarker haplotypes.

[BibT_eX]

[DOI]

Yao-Ting Huang

J. Biomed. Informatics, 2008

Algorithms for Locating Constrained Optimal Intervals

[BibT_eX]

[DOI]

Peng-An Chen

CoRR, 2008

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

[BibT_eX]

[DOI]

CoRR, 2008

CNVDetector: locating copy number variations using array CGH data.

[BibT_eX]

[DOI]

Peng-An Chen

Bioinform., 2008

The Swap Edges of a Multiple-Sources Routing Tree.

[BibT_eX]

[DOI]

Chih-Yuan Hsiao

Algorithmica, 2008

Minkowski Sum Selection and Finding.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

PhosphoPOINT: a comprehensive human kinase interactome and phospho-protein database.

[BibT_eX]

[DOI]

Proceedings of the ECCB'08 Proceedings, 2008

2007

Approximation Algorithms for the Selection of Robust Tag SNPs.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

Optimum Communication Spanning Trees.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

A tight analysis of the Katriel-Bodlaender algorithm for online topological ordering.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

On the uniform edge-partition of a tree.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2007

Algorithms for Computing the Length-Constrained Max-Score Segments with Applications to DNA Copy Number Data Analysis.

[BibT_eX]

[DOI]

Peng-An Chen

Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

2006

A greedier approach for finding tag SNPs.

[BibT_eX]

[DOI]

Chia-Jung Chang

Yao-Ting Huang

Bioinform., 2006

On Locating Disjoint Segments with Maximum Sum of Densities.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 17th International Symposium, 2006

2005

A fast algorithm for computing a longest common increasing subsequence.

[BibT_eX]

[DOI]

I-Hsuan Yang

Chien-Pin Huang

Inf. Process. Lett., 2005

Optimal algorithms for locating the longest and shortest segments satisfying a sum or an average constraint.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2005

Selecting additional tag SNPs for tolerating missing data in genotyping.

[BibT_eX]

[DOI]

BMC Bioinform., 2005

An approximation algorithm for haplotype inference by maximum parsimony.

[BibT_eX]

[DOI]

Yao-Ting Huang

Ting Chen

Proceedings of the 2005 ACM Symposium on Applied Computing (SAC), 2005

Improved Algorithms for the <i>k</i> Maximum-Sums Problems.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

2004

An Optimal Algorithm for Querying Tree Structures and its Applications in Bioinformatics.

[BibT_eX]

[DOI]

SIGMOD Rec., 2004

Efficient combination of multiple word models for improved sequence comparison.

[BibT_eX]

[DOI]

Bioinform., 2004

Approximation Algorithms for the Selection of Robust Tag SNPs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms in Bioinformatics, 4th International Workshop, 2004

A Sensitive Sequence Comparison Method.

[BibT_eX]

Proceedings of the 4th IEEE International Workshop on Source Code Analysis and Manipulation (SCAM 2004), 2004

On the Range Maximum-Sum Segment Query Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 15th International Symposium, 2004

Efficient Methods for Generating Optimal Single and Multiple Spaced Seeds.

[BibT_eX]

[DOI]

Proceedings of the 4th IEEE International Symposium on BioInformatics and BioEngineering (BIBE 2004), 2004

Spanning trees and optimization problems.

[BibT_eX]

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.

[BibT_eX]

[DOI]

Chin Lung Lu

Margaret Dah-Tsyr Chang

J. Bioinform. Comput. Biol., 2003

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

[BibT_eX]

[DOI]

Bioinform., 2003

A generalized global alignment algorithm.

[BibT_eX]

[DOI]

Xiaoqiu Huang

Bioinform., 2003

Finding a Length-Constrained Maximum-Density Path in a Tree.

[BibT_eX]

[DOI]

Wen-Hsiung Kuo

Proceedings of the Algorithms and Computation, 14th International Symposium, 2003

2002

Light graphs with small routing cost.

[BibT_eX]

[DOI]

Networks, 2002

Efficient Algorithms for Locating the Length-Constrained Heaviest Segments, with Applications to Biomolecular Sequence Analysis.

[BibT_eX]

[DOI]

Yaw-Ling Lin

Tao Jiang

Proceedings of the Mathematical Foundations of Computer Science 2002, 2002

Constrained Multiple Sequence Alignment Tool Development and Its Application to RNase Family Alignment.

[BibT_eX]

[DOI]

Chin Lung Lu

Margaret Dah-Tsyr Chang

Proceedings of the 1st IEEE Computer Society Bioinformatics Conference, 2002

2000

A Polynomial Time Approximation Scheme for Optimal Product-Requirement Communication Spanning Trees.

[BibT_eX]

[DOI]

J. Algorithms, 2000

Approximation algorithms for the shortest total path length spanning tree problem.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2000

1999

An Efficient Algorithm for the Length-Constrained Heaviest Path Problem on a Tree.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1999

Calign: aligning sequences with restricted affine gap penalties.

[BibT_eX]

[DOI]

Bioinform., 1999

Constructing Light Spanning Trees with Small Routing Cost.

[BibT_eX]

[DOI]

Proceedings of the STACS 99, 1999

1998

On Computing all Supoptimal Alignments.

[BibT_eX]

[DOI]

Inf. Sci., 1998

The NPO-Completeness of the Longest Hamiltonian Cycle Problem.

[BibT_eX]

[DOI]

Q. S. Wu

Richard C. T. Lee

Inf. Process. Lett., 1998

A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning Trees.

[BibT_eX]

[DOI]

Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998

Approximation Algorithms for Some Optimum Communication Spanning Tree Problems.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 9th International Symposium, 1998

Approximation and Exact Algorithms for Constructing Minimum Ultrametric Trees from Distance Matrices.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 4th Annual International Conference, 1998

1997

A tool for aligning very similar DNA sequences.

[BibT_eX]

[DOI]

Comput. Appl. Biosci., 1997

Fast Algorithms for Aligning Sequences with Restricted Affine Gap Penalties.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, Third Annual International Conference, 1997

1995

A local alignment tool for very long DNA sequences.

[BibT_eX]

[DOI]

Comput. Appl. Biosci., 1995

Linear-Space Algorithms that Build Local Alignments from Fragments.

[BibT_eX]

[DOI]

Algorithmica, 1995

1994

Recent Developments in Linear-Space Alignment Methods: A Survey.

[BibT_eX]

[DOI]

Ross C. Hardison

J. Comput. Biol., 1994

Computing all Suboptimal Alignments in Linear Space.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 5th Annual Symposium, 1994

1993

Locating well-conserved regions within a pairwise alignment.

[BibT_eX]

[DOI]

Ross C. Hardison

Comput. Appl. Biosci., 1993

1992

Aligning two sequences within a specified diagonal band.

[BibT_eX]

[DOI]

William R. Pearson

Comput. Appl. Biosci., 1992

1990

Parallel Operator-Precedence Parsing.

[BibT_eX]

[DOI]

Ruei-Chuan Chang