Explore over 5,214,755 papers,
46,254 were added last week.
Author
|
Conference
|
Journal
|
Year
Look for results that meet for the following criteria:
Later than
Equal to
Earlier than
Papers
Authors
Conferences
Journals
View Top Co-Authors In
Visual Explorer
Kun-mao Chao
Top Co-Authors:
Bang Ye Wu (24)
Chuan Yi Tang (13)
Webb C. Miller (11)
Hsiao-fei Liu (11)
Ross C. Hardison (7)
Kuan-yu Chen (7)
Yao-ting Huang (7)
Hung-lung Wang (6)
R. Ravi (5)
Xiaoqiu Huang (5)
I-hsuan Yang (5)
Tao Jiang (4)
Vineet Bafna (4)
Ting Chen (4)
Giuseppe Lancia (4)
Yaw-ling Lin (4)
Nikola Stojanovic (4)
Peng-an Chen (4)
Chih-huai Cheng (4)
Scott J. Schwartz (3)
ObjectID : Author/134019
Kun-mao Chao
(
Publications: 94
)
(
Citation Count: 399
)
(
G-Index: 16
)
(
H-Index: 11
)
HomePage
USA
Dept. of C.S. and Inform. Manag., Providence University, Shalu, Taiwan, R.O.C.
Permanent Link:
http://academic.research.microsoft.com/Author/134019.aspx
Order by:
Year
|
Citation
|
Rank
The rank of a paper is calculated by considering the authors, the published conference or journal, and its citation graph. The highest ranking result will appear first.
Learn more
Papers
Citations
Year 2009
Matthias Bernt
,
Ming-chiang Chen
,
Daniel Merkle
,
Hung-lung Wang
,
Kun-mao Chao
,
Martin Middendorf
:
Finding All Sorting Tandem Duplication Random Loss Operations
,
CPM
, 2009
Chih-huai Cheng
,
Hsiao-fei Liu
,
Kun-mao Chao
:
Optimal algorithms for the average-constrained maximum-sum segment problem
,
IPL
, 2009
Kuan-yu Chen
,
Ping-hui Hsu
,
Kun-mao Chao
:
Approximate Matching for Run-Length Encoded Strings Is 3sum-Hard
,
CPM
, 2009
Hung-lung Wang
,
Bang Ye Wu
,
Kun-mao Chao
:
The backup 2-center and backup 2-median problems on trees
,
NETWORKS
, 2009
Ping-hui Hsu
,
Kuan-yu Chen
,
Kun-mao Chao
:
Finding All Approximate Gapped Palindromes
,
ISAAC
, 2009
Hsiao-fei Liu
,
Kun-mao Chao
:
On Locating Disjoint Segments with Maximum Sum of Densities
,
ALGORITHMICA
, 2009
Year 2008
Bang Ye Wu
,
Chih-yuan Hsiao
,
Kun-mao Chao
:
The Swap Edges of a Multiple-Sources Routing Tree
,
ALGORITHMICA
, 2008
(
Citations: 1
)
Peng-an Chen
,
Hsiao-fei Liu
,
Kun-mao Chao
:
CNVDetector: locating copy number variations using array CGH data
,
BIOINFORMATICS
, 2008
(
Citations: 1
)
Hsiao-fei Liu
,
Kun-mao Chao
:
Algorithms for finding the weight-constrained k longest paths in a tree and the length-constrained k maximum-sum segments of a sequence
,
TCS
, 2008
(
Citations: 1
)
Chia-ying Yang
,
Chao-hui Chang
,
Ya-ling Yu
,
Tsu-chun Emma Lin
,
Sheng-an Lee
,
Chueh-chuan Yen
,
Jinn-moon Yang
,
Jin-mei Lai
,
Yi-ren Hong
,
Tzu-ling Tseng
,
Kun-mao Chao
,
Chi-ying F. Huang
:
PhosphoPOINT: a comprehensive human kinase interactome and phospho-protein database
,
European Conference on Computational Biology
, 2008
Cheng-wei Luo
,
Hsiao-fei Liu
,
Peng-an Chen
,
Kun-mao Chao
:
Minkowski Sum Selection and Finding
,
ISAAC
, 2008
Hsiao-fei Liu
,
Peng-an Chen
,
Kun-mao Chao
:
Algorithms for Locating Constrained Optimal Intervals
,
CORR
, 2008
Hung-lung Wang
,
Kun-mao Chao
:
The 2-radius and 2-radiian problems on trees
,
TCS
, 2008
Hsiao-fei Liu
,
Kun-mao Chao
:
An Õ(n2.5)-Time Algorithm for Online Topological Ordering
,
CORR
, 2008
Yao-ting Huang
,
Kun-mao Chao
:
A new framework for the selection of tag SNPs by multimarker haplotypes
,
JBI
, 2008
Kun-mao Chao
:
Maximum-scoring Segment with Length Restrictions
, 2008
Kun-mao Chao
:
Maximum-Density Segment
, 2008
Year 2007
Kuan-yu Chen
,
Kun-mao Chao
:
On the range maximum-sum segment query problem
,
DAM
, 2007
(
Citations: 5
)
Bang Ye Wu
,
Hung-lung Wang
,
Shih Ta Kuan
,
Kun-mao Chao
:
On the uniform edge-partition of a tree
,
DAM
, 2007
(
Citations: 3
)
Hsiao-fei Liu
,
Kun-mao Chao
:
A tight analysis of the Katriel-Bodlaender algorithm for online topological ordering
,
TCS
, 2007
(
Citations: 2
)
Hsiao-fei Liu
,
Peng-an Chen
,
Kun-mao Chao
:
Algorithms for Computing the Length-Constrained Max-Score Segments with Applications to DNA Copy Number Data Analysis
,
ISAAC
, 2007
Year 2006
Chih-huai Cheng
,
Kuan-yu Chen
,
Wen-chin Tien
,
Kun-mao Chao
:
Improved algorithms for the k maximum-sums problems
,
TCS
, 2006
(
Citations: 5
)
Chia-jung Chang
,
Yao-ting Huang
,
Kun-mao Chao
:
A greedier approach for finding tag SNPs
,
BIOINFORMATICS
, 2006
(
Citations: 4
)
Hsiao-fei Liu
,
Kun-mao Chao
:
On Locating Disjoint Segments with Maximum Sum of Densities
,
ISAAC
, 2006
(
Citations: 1
)
Year 2005
Yao-ting Huang
,
Kun-mao Chao
,
Ting Chen
:
An approximation algorithm for haplotype inference by maximum parsimony
,
SAC
, 2005
(
Citations: 21
)
Kuan-yu Chen
,
Kun-mao Chao
:
Optimal algorithms for locating the longest and shortest segments satisfying a sum or an average constraint
,
IPL
, 2005
(
Citations: 7
)
I-hsuan Yang
,
Chien-pin Huang
,
Kun-mao Chao
:
A fast algorithm for computing a longest common increasing subsequence
,
IPL
, 2005
(
Citations: 4
)
Yao-ting Huang
,
Kui Zhang
,
Ting Chen
,
Kun-mao Chao
:
Selecting additional tag SNPs for tolerating missing data in genotyping
,
BMC Bioinformatics
, 2005
(
Citations: 4
)
Rung-ren Lin
,
Wen-hsiung Kuo
,
Kun-mao Chao
:
Finding a Length-Constrained Maximum-Density Path in a Tree
,
JCO
, 2005
(
Citations: 3
)
Chih-huai Cheng
,
Kuan-yu Chen
,
Wen-chin Tien
,
Kun-mao Chao
:
Improved Algorithms for the k Maximum-Sums Problems
,
ISAAC
, 2005
(
Citations: 3
)
Year 2004
B. Y. Wu
,
K. M. Chao
:
Spanning trees and optimization prob - lems
, 2004
(
Citations: 15
)
I-hsuan Yang
,
Sheng-ho Wang
,
Yang-ho Chen
,
Pao-hsian Huang
,
Liang Ye
,
Xiaoqiu Huang
,
Kun-mao Chao
:
Efficient Methods for Generating Optimal Single and Multiple Spaced Seeds
,
BIBE
, 2004
(
Citations: 8
)
Kuan-yu Chen
,
Kun-mao Chao
:
On the Range Maximum-Sum Segment Query Problem
,
ISAAC
, 2004
(
Citations: 7
)
Yao-ting Huang
,
Kui Zhang
,
Ting Chen
,
Kun-mao Chao
:
Approximation Algorithms for the Selection of Robust Tag SNPs
,
WABI
, 2004
(
Citations: 4
)
Xiaoqiu Huang
,
Liang Ye
,
Hui-hsien Chou
,
I-hsuan Yang
,
Kun-mao Chao
:
Efficient combination of multiple word models for improved sequence comparison
,
BIOINFORMATICS
, 2004
(
Citations: 2
)
Hsiao-fei Liu
,
Ya-hui Chang
,
Kun-mao Chao
:
An Optimal Algorithm for Querying Tree Structures and its Applications in Bioinformatics
,
SIGMOD Record
, 2004
Xiaoqiu Huang
,
Liang Ye
,
I-hsuan Yang
,
Kun-mao Chao
:
A Sensitive Sequence Comparison Method
,
SNPD
, 2004
Year 2003
Yaw-ling Lin
,
Xiaoqiu Huang
,
Tao Jiang
,
Kun-mao Chao
:
MAVG: locating non-overlapping maximum average segments in a given sequence
,
BIOINFORMATICS
, 2003
(
Citations: 11
)
Chuan Yi Tang
,
Chin Lung Lu
,
Margaret Dah-tsyr Chang
,
Yin-te Tsai
,
Yuh-ju Sun
,
Kun-mao Chao
,
Jia-ming Chang
,
Yu-han Chiou
,
Chia-mao Wu
,
Hao-teng Chang
,
Wei-i Chou
:
Constrained Multiple Sequence Alignment Tool Development Andits Application to Rnase Family Alignment
,
JBCB
, 2003
(
Citations: 7
)
Xiaoqiu Huang
,
Kun-mao Chao
:
A generalized global alignment algorithm
,
BIOINFORMATICS
, 2003
(
Citations: 7
)
Rung-ren Lin
,
Wen-hsiung Kuo
,
Kun-mao Chao
:
Finding a Length-Constrained Maximum-Density Path in a Tree
,
ISAAC
, 2003
Year 2002
Yaw-ling Lin
,
Tao Jiang
,
Kun-mao Chao
:
Efficient Algorithms for Locating the Length-Constrained Heaviest Segments, with Applications to Biomolecular Sequence Analysis
,
MFCS
, 2002
(
Citations: 35
)
Chuan Yi Tang
,
Chin Lung Lu
,
Margaret Dah-tsyr Chang
,
Yin-te Tsai
,
Yuh-ju Sun
,
Kun-mao Chao
,
Jia-ming Chang
,
Yu-han Chiou
,
Chia-mao Wu
,
Hao-teng Chang
,
Wei-i Chou
:
Constrained Multiple Sequence Alignment Tool Development and Its Application to RNase Family Alignment
,
CSB
, 2002
(
Citations: 11
)
Bang Ye Wu
,
Kun-mao Chao
,
Chuan Yi Tang
:
Light graphs with small routing cost
,
NETWORKS
, 2002
(
Citations: 2
)
B. Y. Wu
,
G. Lancia
,
V. Bafna
,
K. M. Chao
,
R. Ravi
,
C. Y. Tang
:
A polynomial time approximation scheme for minimum routing cost spanning trees
, 2002
(
Citations: 1
)
Year 2000
Bang Ye Wu
,
Kun-mao Chao
,
Chuan Yi Tang
:
Approximation algorithms for the shortest total path length spanning tree problem
,
DAM
, 2000
(
Citations: 12
)
Bang Ye Wu
,
Kun-mao Chao
,
Chuan Yi Tang
:
Approximation algorithms for some optimum communication spanning tree problems
,
DAM
, 2000
(
Citations: 10
)
B. Y. Wu
,
G. Lancia
,
V. Bafna
,
K. M. Chao
,
R. Ravi
,
C. Y. Tang
:
A polynomial time approximation scheme for minimum routing cost spanning trees
, 2000
(
Citations: 10
)
Bang Ye Wu
,
Kun-mao Chao
,
Chuan Yi Tang
:
A Polynomial Time Approximation Scheme for Optimal Product-Requirement Communication Spanning Trees
,
JAL
, 2000
(
Citations: 8
)
B. Y. Wu
,
K. M. Chao
,
C. Y. Tang
:
Approximation algorithms for some optimum
, 2000
(
Citations: 1
)
Year 1999
Bang Ye Wu
,
Giuseppe Lancia
,
Vineet Bafna
,
Kun-mao Chao
,
R. Ravi
,
Chuan Yi Tang
:
A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees
,
SIAMCOMP
, 1999
(
Citations: 14
)
Bang Ye Wu
,
Kun-mao Chao
,
Chuan Yi Tang
:
Approximation and Exact Algorithms for Constructing Minimum Ultrametric Trees from Distance Matrices
,
JCO
, 1999
(
Citations: 10
)
Bang Ye Wu
,
Kun-mao Chao
,
Chuan Yi Tang
:
An Efficient Algorithm for the Length-Constrained Heaviest Path Problem on a Tree
,
IPL
, 1999
(
Citations: 6
)
Kun-mao Chao
:
Calign: aligning sequences with restricted affine gap penalties
,
BIOINFORMATICS
, 1999
(
Citations: 2
)
Bang Ye Wu
,
Kun-mao Chao
,
Chuan Yi Tang
:
Constructing Light Spanning Trees with Small Routing Cost
,
STACS
, 1999
(
Citations: 1
)
Year 1998
Bang Ye Wu
,
Giuseppe Lancia
,
Vineet Bafna
,
Kun-mao Chao
,
R. Ravi
,
Chuan Yi Tang
:
A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning Trees
,
SODA
, 1998
(
Citations: 38
)
Kun-mao Chao
:
On Computing all Supoptimal Alignments
,
ISCI
, 1998
(
Citations: 1
)
Bang Ye Wu
,
Kun-mao Chao
,
Chuan Yi Tang
:
Approximation Algorithms for Some Optimum Communication Spanning Tree Problems
,
ISAAC
, 1998
(
Citations: 1
)
Q. S. Wu
,
Kun-mao Chao
,
Richard C. T. Lee
:
The NPO-Completeness of the Longest Hamiltonian Cycle Problem
,
IPL
, 1998
Bang Ye Wu
,
Kun-mao Chao
,
Chuan Yi Tang
:
Approximation and Exact Algorithms for Constructing Minimum Ultrametric Trees from Distance Matrices
,
COCOON
, 1998
Year 1997
Kun-mao Chao
,
Jinghui Zhang
,
James Ostell
,
Webb Miller
:
A tool for aligning very similar DNA sequences
,
BIOINFORMATICS
, 1997
(
Citations: 8
)
R Hardison
,
K M Chao
,
S Schwartz
,
N Stojanovic
,
M Ganetsky
,
W Miller
:
Globin gene server: a prototype e-mail database server featuring extensive multiple alignments and d
, 1997
(
Citations: 1
)
Kun-mao Chao
:
Fast Algorithms for Aligning Sequences with Restricted Affine Gap Penalties
,
COCOON
, 1997
Year 1995
Kun-mao Chao
,
Jinghui Zhang
,
James Ostell
,
Webb Miller
:
A local alignment tool for very long DNA sequences
,
BIOINFORMATICS
, 1995
(
Citations: 11
)
Kun-mao Chao
,
Webb Miller
:
Linear-Space Algorithms that Build Local Alignments from Fragments
,
ALGORITHMICA
, 1995
(
Citations: 13
)
Year 1994
Kun-mao Chao
,
Ross C. Hardison
,
Webb Miller
:
Recent Developments in Linear-Space Alignment Methods: A Survey
,
JCB
, 1994
(
Citations: 21
)
Kun-mao Chao
:
Computing all Suboptimal Alignments in Linear Space
,
CPM
, 1994
(
Citations: 5
)
R. Hardison
,
K. M Chao
,
S. Schwartz
,
N. Stojanov
,
M. Ganetsky
,
W. Miller
:
Globin Gene Server: a prototype e-mail database server fea-MULTI-ALIGNMENT WITH CONSTRAINTS 22 turing extensive multiple alignments and data compilation for electronic ge-netic analysis
, 1994
(
Citations: 2
)
K. M. Chao
,
W. Miller
:
Linear-space algorithms that build local alignments from fragments
, 1994
(
Citations: 4
)
R. Hardison
,
K. M. Chao
,
S. Schwartz
,
N. Stojanovic
,
M. Ganetsky
,
W. Miller
:
Globin gene server: A prototype E-mail database server featuring extensive multiple alignments and d
, 1994
(
Citations: 1
)
K. M. Chao
,
J. Zhang
,
J. Ostell
,
W. Miller
:
A fast local alignment tool for very long DNA sequences
, 1994
(
Citations: 2
)
Year 1993
Kun-mao Chao
,
Ross C. Hardison
,
Webb Miller
:
Locating well-conserved regions within a pairwise alignment
,
BIOINFORMATICS
, 1993
(
Citations: 8
)
R Hardison
,
K. M Chao
,
M Adamkiewicz
,
D Price
,
J Jackson
,
T Zeigler
,
N Stojanovic
,
W. Miller
:
Positive and negative regulatory elements of the rabbit epsilon-globin gene revealed by an improved
, 1993
(
Citations: 1
)
R. C. Ilardison
,
K. M. Chao
,
M. Adamkiewicz
,
D. Price
,
J. Jackson
,
T. Zeigler
,
N. Stojanovic
,
W. Ivliller
:
Positive and negative regulatory elements of the rabbit embryonic e-globin gene revealed by an ixnpr
, 1993
Year 1992
Kun-mao Chao
,
William R. Pearson
,
Webb Miller
:
Aligning two sequences within a specified diagonal band
,
BIOINFORMATICS
, 1992
(
Citations: 29
)
K. M. Chao
,
R. C. Hardison
,
W. Miller
:
Recent developments in linear-space alignment methods: a survey
, 1992
(
Citations: 4
)
Year 1990
Ruei-chuan Chang
,
Kun-mao Chao
:
Parallel Operator-Precedence Parsing
,
JISE
, 1990
Year Unknown
Bang Ye Wu
,
Kun-mao Chao
,
Crc Press
,
Minimum Spanning Trees
:
Spanning Trees and Optimization Problems (Excerpt)
Neet Bafna
,
Kun-mao Chao
,
R. Ravi
:
ACM Symposium on the Theory of Computing (STOC) pages 688ñ693
Multimarker Haplotypes
,
Yao-ting Huang
,
Kun-mao Chao
:
A New Framework for the Selection of Tag SNPs by
Bang Ye Wu
,
Hung-lung Wang
,
Shih Ta Kuan
,
Kun-mao Chao
:
A note on the uniform edge-partition of a tree
Maximum Parsimony
,
Yao-ting Huang
,
Kun-mao Chao
,
Ting Chen
:
An Approximation Algorithm for Haplotype Inference by
I-hsuan Yang
,
Chien-pin Huang
,
Kun-mao Chao
:
A Fast Algorithm for Computing a Longest Common Increasing
Chih Huai Cheng
,
Ching Chian Huang
,
Shu Yu Hu
,
Kun-mao Chao
:
Efficient Algorithms for Some Variants of the Farthest String Problem
Hung-lung Wang
,
Bang Ye Wu
,
Kun-mao Chao
:
A linear time algorithm for the backup 2-center problem on a tree
Yaw-ling Lin
,
Tao Jiang
,
Kun-mao Chao
:
Efficient algorithms for locating the length-constrained heaviest segments withapplications to biomolecular
Yaw-ling Lin
,
Tao Jiang
,
Kun-mao Chao
:
Ecient Algorithms for Locating the Length-Constrained Heaviest Segments with
Bang Ye Wu
,
Chao Kun-mao
:
A note on optimal communication spanning trees
Bang Ye Wu
,
Kun-mao Chao
:
A note on a polynomial time approximation scheme for the MRCT problem
Bang Ye Wu
,
Kun-mao Chao
:
A polynomial time approximation scheme for the MRCT problem
Working Draft
,
Kun-mao Chao
:
Constrained Heaviest Segments in a Number Sequence and Their Applications in Biomolecular Sequence Analysis
Kun-mao Chao
:
A Class Note on Sequence Alignment
Kun-mao Chao
:
Genomic Sequence Analysis: A Case Study in Constrained Heaviest Segments (Working draft)
Kun-mao Chao
:
A Class Note on Basic Algorithmic Techniques