The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Kun-Mao Chao: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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. [Citation Graph (0, 0)][DBLP]
    BIBE, 2004, pp:411-418 [Conf]
  2. Kun-Mao Chao
    Fast Algorithms for Aligning Sequences with Restricted Affine Gap Penalties. [Citation Graph (0, 0)][DBLP]
    COCOON, 1997, pp:264-273 [Conf]
  3. Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang
    Approximation and Exact Algorithms for Constructing Minimum Ultrametric Trees from Distance Matrices. [Citation Graph (0, 0)][DBLP]
    COCOON, 1998, pp:299-308 [Conf]
  4. Kun-Mao Chao
    Computing all Suboptimal Alignments in Linear Space. [Citation Graph (0, 0)][DBLP]
    CPM, 1994, pp:31-42 [Conf]
  5. 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. [Citation Graph (0, 0)][DBLP]
    CSB, 2002, pp:127-137 [Conf]
  6. Kuan-Yu Chen, Kun-Mao Chao
    On the Range Maximum-Sum Segment Query Problem. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:294-305 [Conf]
  7. Chih-Huai Cheng, Kuan-Yu Chen, Wen-Chin Tien, Kun-Mao Chao
    Improved Algorithms for the k Maximum-Sums Problems. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2005, pp:799-808 [Conf]
  8. Rung-Ren Lin, Wen-Hsiung Kuo, Kun-Mao Chao
    Finding a Length-Constrained Maximum-Density Path in a Tree. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2003, pp:78-87 [Conf]
  9. Hsiao-Fei Liu, Kun-Mao Chao
    On Locating Disjoint Segments with Maximum Sum of Densities. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2006, pp:300-307 [Conf]
  10. Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang
    Approximation Algorithms for Some Optimum Communication Spanning Tree Problems. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1998, pp:407-416 [Conf]
  11. Yaw-Ling Lin, Tao Jiang, Kun-Mao Chao
    Efficient Algorithms for Locating the Length-Constrained Heaviest Segments, with Applications to Biomolecular Sequence Analysis. [Citation Graph (0, 0)][DBLP]
    MFCS, 2002, pp:459-470 [Conf]
  12. Yao-Ting Huang, Kun-Mao Chao, Ting Chen
    An approximation algorithm for haplotype inference by maximum parsimony. [Citation Graph (0, 0)][DBLP]
    SAC, 2005, pp:146-150 [Conf]
  13. Xiaoqiu Huang, Liang Ye, I-Hsuan Yang, Kun-Mao Chao
    A Sensitive Sequence Comparison Method. [Citation Graph (0, 0)][DBLP]
    SNPD, 2004, pp:77-80 [Conf]
  14. 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. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:21-32 [Conf]
  15. Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang
    Constructing Light Spanning Trees with Small Routing Cost. [Citation Graph (0, 0)][DBLP]
    STACS, 1999, pp:334-344 [Conf]
  16. Yao-Ting Huang, Kui Zhang, Ting Chen, Kun-Mao Chao
    Approximation Algorithms for the Selection of Robust Tag SNPs. [Citation Graph (0, 0)][DBLP]
    WABI, 2004, pp:278-289 [Conf]
  17. Kun-Mao Chao, Webb Miller
    Linear-Space Algorithms that Build Local Alignments from Fragments. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1995, v:13, n:1/2, pp:106-134 [Journal]
  18. Chia-Jung Chang, Yao-Ting Huang, Kun-Mao Chao
    A greedier approach for finding tag SNPs. [Citation Graph (0, 0)][DBLP]
    Bioinformatics, 2006, v:22, n:6, pp:685-691 [Journal]
  19. Kun-Mao Chao
    Calign: aligning sequences with restricted affine gap penalties. [Citation Graph (0, 0)][DBLP]
    Bioinformatics, 1999, v:15, n:4, pp:298-304 [Journal]
  20. Kun-Mao Chao, Ross C. Hardison, Webb Miller
    Locating well-conserved regions within a pairwise alignment. [Citation Graph (0, 0)][DBLP]
    Computer Applications in the Biosciences, 1993, v:9, n:4, pp:387-396 [Journal]
  21. Kun-Mao Chao, William R. Pearson, Webb Miller
    Aligning two sequences within a specified diagonal band. [Citation Graph (0, 0)][DBLP]
    Computer Applications in the Biosciences, 1992, v:8, n:5, pp:481-487 [Journal]
  22. Kun-Mao Chao, Jinghui Zhang, James Ostell, Webb Miller
    A local alignment tool for very long DNA sequences. [Citation Graph (0, 0)][DBLP]
    Computer Applications in the Biosciences, 1995, v:11, n:2, pp:147-153 [Journal]
  23. Kun-Mao Chao, Jinghui Zhang, James Ostell, Webb Miller
    A tool for aligning very similar DNA sequences. [Citation Graph (0, 0)][DBLP]
    Computer Applications in the Biosciences, 1997, v:13, n:1, pp:75-80 [Journal]
  24. Xiaoqiu Huang, Kun-Mao Chao
    A generalized global alignment algorithm. [Citation Graph (0, 0)][DBLP]
    Bioinformatics, 2003, v:19, n:2, pp:228-233 [Journal]
  25. Xiaoqiu Huang, Liang Ye, Hui-Hsien Chou, I-Hsuan Yang, Kun-Mao Chao
    Efficient combination of multiple word models for improved sequence comparison. [Citation Graph (0, 0)][DBLP]
    Bioinformatics, 2004, v:20, n:16, pp:2529-2533 [Journal]
  26. Yaw-Ling Lin, Xiaoqiu Huang, Tao Jiang, Kun-Mao Chao
    MAVG: locating non-overlapping maximum average segments in a given sequence. [Citation Graph (0, 0)][DBLP]
    Bioinformatics, 2003, v:19, n:1, pp:151-152 [Journal]
  27. Yao-Ting Huang, Kui Zhang, Ting Chen, Kun-Mao Chao
    Selecting additional tag SNPs for tolerating missing data in genotyping. [Citation Graph (0, 0)][DBLP]
    BMC Bioinformatics, 2005, v:6, n:, pp:263- [Journal]
  28. Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang
    Approximation algorithms for the shortest total path length spanning tree problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:105, n:1-3, pp:273-289 [Journal]
  29. Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang
    Approximation algorithms for some optimum communication spanning tree problems. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:102, n:3, pp:245-266 [Journal]
  30. Bang Ye Wu, Hung-Lung Wang, Shih Ta Kuan, Kun-Mao Chao
    On the uniform edge-partition of a tree. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:10, pp:1213-1223 [Journal]
  31. Kuan-Yu Chen, Kun-Mao Chao
    Optimal algorithms for locating the longest and shortest segments satisfying a sum or an average constraint. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2005, v:96, n:6, pp:197-201 [Journal]
  32. Q. S. Wu, Kun-Mao Chao, Richard C. T. Lee
    The NPO-Completeness of the Longest Hamiltonian Cycle Problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1998, v:65, n:3, pp:119-123 [Journal]
  33. Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang
    An Efficient Algorithm for the Length-Constrained Heaviest Path Problem on a Tree. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1999, v:69, n:2, pp:63-67 [Journal]
  34. I-Hsuan Yang, Chien-Pin Huang, Kun-Mao Chao
    A fast algorithm for computing a longest common increasing subsequence. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2005, v:93, n:5, pp:249-253 [Journal]
  35. Kun-Mao Chao
    On Computing all Supoptimal Alignments. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 1998, v:105, n:1-4, pp:189-207 [Journal]
  36. Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang
    A Polynomial Time Approximation Scheme for Optimal Product-Requirement Communication Spanning Trees. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2000, v:36, n:2, pp:182-204 [Journal]
  37. 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. [Citation Graph (0, 0)][DBLP]
    J. Bioinformatics and Computational Biology, 2003, v:1, n:2, pp:267-288 [Journal]
  38. Kun-Mao Chao, Ross C. Hardison, Webb Miller
    Recent Developments in Linear-Space Alignment Methods: A Survey. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 1994, v:1, n:4, pp:271-292 [Journal]
  39. Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang
    Approximation and Exact Algorithms for Constructing Minimum Ultrametric Trees from Distance Matrices. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 1999, v:3, n:2-3, pp:199-211 [Journal]
  40. Rung-Ren Lin, Wen-Hsiung Kuo, Kun-Mao Chao
    Finding a Length-Constrained Maximum-Density Path in a Tree. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2005, v:9, n:2, pp:147-156 [Journal]
  41. Yaw-Ling Lin, Tao Jiang, Kun-Mao Chao
    Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2002, v:65, n:3, pp:570-586 [Journal]
  42. Ruei-Chuan Chang, Kun-Mao Chao
    Parallel Operator-Precedence Parsing. [Citation Graph (0, 0)][DBLP]
    J. Inf. Sci. Eng., 1990, v:6, n:1, pp:51-61 [Journal]
  43. Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang
    Light graphs with small routing cost. [Citation Graph (0, 0)][DBLP]
    Networks, 2002, v:39, n:3, pp:130-138 [Journal]
  44. 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. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:29, n:3, pp:761-778 [Journal]
  45. Hsiao-Fei Liu, Ya-Hui Chang, Kun-Mao Chao
    An Optimal Algorithm for Querying Tree Structures and its Applications in Bioinformatics. [Citation Graph (0, 0)][DBLP]
    SIGMOD Record, 2004, v:33, n:2, pp:21-26 [Journal]
  46. Chih-Huai Cheng, Kuan-Yu Chen, Wen-Chin Tien, Kun-Mao Chao
    Improved algorithms for the k maximum-sums problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:362, n:1-3, pp:162-170 [Journal]
  47. Kuan-Yu Chen, Kun-Mao Chao
    On the range maximum-sum segment query problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:16, pp:2043-2052 [Journal]

  48. Finding All Sorting Tandem Duplication Random Loss Operations. [Citation Graph (, )][DBLP]


  49. Approximate Matching for Run-Length Encoded Strings Is 3sum-Hard. [Citation Graph (, )][DBLP]


  50. Faster Algorithms for Searching Relevant Matches in XML Databases. [Citation Graph (, )][DBLP]


  51. PhosphoPOINT: a comprehensive human kinase interactome and phospho-protein database. [Citation Graph (, )][DBLP]


  52. A Fully Compressed Algorithm for Computing the Edit Distance of Run-Length Encoded Strings. [Citation Graph (, )][DBLP]


  53. Minkowski Sum Selection and Finding. [Citation Graph (, )][DBLP]


  54. Algorithms for Computing the Length-Constrained Max-Score Segments with Applications to DNA Copy Number Data Analysis. [Citation Graph (, )][DBLP]


  55. Finding All Approximate Gapped Palindromes. [Citation Graph (, )][DBLP]


  56. The Swap Edges of a Multiple-Sources Routing Tree. [Citation Graph (, )][DBLP]


  57. On Locating Disjoint Segments with Maximum Sum of Densities. [Citation Graph (, )][DBLP]


  58. CNVDetector: locating copy number variations using array CGH data. [Citation Graph (, )][DBLP]


  59. An Õ(n2.5)-Time Algorithm for Online Topological Ordering [Citation Graph (, )][DBLP]


  60. Algorithms for Locating Constrained Optimal Intervals [Citation Graph (, )][DBLP]


  61. Minkowski Sum Selection and Finding [Citation Graph (, )][DBLP]


  62. A tight bound on the min-ratio edge-partitioning problem of a tree. [Citation Graph (, )][DBLP]


Search in 0.006secs, Finished in 0.009secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002