default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Kun-Mao Chao
@article{DBLP:journals/corr/abs-2404-17428,
author = {Manuel Dubinsky and
Kun{-}Mao Chao and
C{\'{e}}sar Massri and
Gabriel Taubin},
title = {Lower Bounds for the Minimum Spanning Tree Cycle Intersection Problem},
journal = {CoRR},
volume = {abs/2404.17428},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2404.17428},
doi = {10.48550/ARXIV.2404.17428},
eprinttype = {arXiv},
eprint = {2404.17428},
timestamp = {Mon, 03 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2404-17428.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ChenC22a,
author = {Min{-}Jen Chen and
Kun{-}Mao Chao},
title = {Proof of a Conjecture About Minimum Spanning Tree Cycle Intersection},
journal = {Discret. Appl. Math.},
volume = {321},
pages = {19--23},
year = {2022},
url = {https://doi.org/10.1016/j.dam.2022.06.030},
doi = {10.1016/J.DAM.2022.06.030},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/ChenC22a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/tf/18/HuangZCC18,
author = {Yao{-}Ting Huang and
Kui Zhang and
Ting Chen and
Kun{-}Mao Chao},
editor = {Teofilo F. Gonzalez},
title = {Approximation Algorithms for the Selection of Robust Tag SNPs},
booktitle = {Handbook of Approximation Algorithms and Metaheuristics, Second Edition,
Volume 2: Contemporary and Emerging Applications},
publisher = {Chapman and Hall/CRC},
year = {2018},
timestamp = {Mon, 28 Oct 2019 16:49:19 +0100},
biburl = {https://dblp.org/rec/books/tf/18/HuangZCC18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/tf/18/WuTC18,
author = {Bang Ye Wu and
Chuan Yi Tang and
Kun{-}Mao Chao},
editor = {Teofilo F. Gonzalez},
title = {Optimum Communication Spanning Trees},
booktitle = {Handbook of Approximation Algorithms and Metaheuristics, Second Edition,
Volume 2: Contemporary and Emerging Applications},
publisher = {Chapman and Hall/CRC},
year = {2018},
timestamp = {Fri, 25 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/books/tf/18/WuTC18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaim/HuangWC16,
author = {Albert Jhih{-}Heng Huang and
Hung{-}Lung Wang and
Kun{-}Mao Chao},
editor = {Riccardo Dondi and
Guillaume Fertin and
Giancarlo Mauri},
title = {Computing the Line-Constrained k-center in the Plane for Small k},
booktitle = {Algorithmic Aspects in Information and Management - 11th International
Conference, {AAIM} 2016, Bergamo, Italy, July 18-20, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9778},
pages = {197--208},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-41168-2\_17},
doi = {10.1007/978-3-319-41168-2\_17},
timestamp = {Sun, 02 Oct 2022 15:53:30 +0200},
biburl = {https://dblp.org/rec/conf/aaim/HuangWC16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/biocas/TsaiKC16,
author = {Tsung{-}Han Tsai and
Lih{-}Jen Kau and
Kun{-}Mao Chao},
title = {A Takagi-Sugeno fuzzy neural network-based algorithm with single-channel
{EEG} signal for the discrimination between light and deep sleep stages},
booktitle = {{IEEE} Biomedical Circuits and Systems Conference, BioCAS 2016, Shanghai,
China, October 17-19, 2016},
pages = {532--535},
publisher = {{IEEE}},
year = {2016},
url = {https://doi.org/10.1109/BioCAS.2016.7833849},
doi = {10.1109/BIOCAS.2016.7833849},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/biocas/TsaiKC16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/Chao16,
author = {Kun{-}Mao Chao},
title = {Maximum-Average Segments},
booktitle = {Encyclopedia of Algorithms},
pages = {1241--1242},
year = {2016},
url = {https://doi.org/10.1007/978-1-4939-2864-4\_224},
doi = {10.1007/978-1-4939-2864-4\_224},
timestamp = {Wed, 12 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/reference/algo/Chao16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/Chao16a,
author = {Kun{-}Mao Chao},
title = {Maximum-Sum Segments},
booktitle = {Encyclopedia of Algorithms},
pages = {1242--1244},
year = {2016},
url = {https://doi.org/10.1007/978-1-4939-2864-4\_226},
doi = {10.1007/978-1-4939-2864-4\_226},
timestamp = {Wed, 12 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/reference/algo/Chao16a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ieicet/ChangTCA15,
author = {Chia{-}Jung Chang and
Takeyuki Tamura and
Kun{-}Mao Chao and
Tatsuya Akutsu},
title = {A Fixed-Parameter Algorithm for Detecting a Singleton Attractor in
an {AND/OR} Boolean Network with Bounded Treewidth},
journal = {{IEICE} Trans. Fundam. Electron. Commun. Comput. Sci.},
volume = {98-A},
number = {1},
pages = {384--390},
year = {2015},
url = {https://doi.org/10.1587/transfun.E98.A.384},
doi = {10.1587/TRANSFUN.E98.A.384},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ieicet/ChangTCA15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/LinWWC15,
author = {Wei{-}Yin Lin and
Yen{-}Wei Wu and
Hung{-}Lung Wang and
Kun{-}Mao Chao},
editor = {M. Sohel Rahman and
Etsuji Tomita},
title = {Forming Plurality at Minimum Cost},
booktitle = {{WALCOM:} Algorithms and Computation - 9th International Workshop,
{WALCOM} 2015, Dhaka, Bangladesh, February 26-28, 2015. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8973},
pages = {77--88},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-15612-5\_8},
doi = {10.1007/978-3-319-15612-5\_8},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/walcom/LinWWC15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChaoHL14,
author = {Kun{-}Mao Chao and
Tsan{-}sheng Hsu and
D. T. Lee},
title = {Preface Algorithms and Computation {(ISAAC} 2012)},
journal = {Algorithmica},
volume = {70},
number = {4},
pages = {694--695},
year = {2014},
url = {https://doi.org/10.1007/s00453-014-9933-1},
doi = {10.1007/S00453-014-9933-1},
timestamp = {Tue, 26 Jun 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ChaoHL14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bmcbi/ChangCYC14,
author = {Chia{-}Jung Chang and
Pei{-}Lung Chen and
Wei{-}Shiung Yang and
Kun{-}Mao Chao},
title = {A fault-tolerant method for {HLA} typing with PacBio data},
journal = {{BMC} Bioinform.},
volume = {15},
pages = {296},
year = {2014},
url = {https://doi.org/10.1186/1471-2105-15-296},
doi = {10.1186/1471-2105-15-296},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/bmcbi/ChangCYC14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigmod/LinCC14,
author = {Rung{-}Ren Lin and
Ya{-}Hui Chang and
Kun{-}Mao Chao},
title = {Locating Valid SLCAs for {XML} Keyword Search with {NOT} Semantics},
journal = {{SIGMOD} Rec.},
volume = {43},
number = {2},
pages = {29--34},
year = {2014},
url = {https://doi.org/10.1145/2694413.2694419},
doi = {10.1145/2694413.2694419},
timestamp = {Fri, 06 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/sigmod/LinCC14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChaoHL14,
author = {Kun{-}Mao Chao and
Tsan{-}sheng Hsu and
D. T. Lee},
title = {Algorithms and Computation {(ISAAC} 2012)},
journal = {Theor. Comput. Sci.},
volume = {544},
pages = {1--2},
year = {2014},
url = {https://doi.org/10.1016/j.tcs.2014.06.034},
doi = {10.1016/J.TCS.2014.06.034},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ChaoHL14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/WuLWC14,
author = {Yen{-}Wei Wu and
Wei{-}Yin Lin and
Hung{-}Lung Wang and
Kun{-}Mao Chao},
editor = {Hee{-}Kap Ahn and
Chan{-}Su Shin},
title = {The Generalized Popular Condensation Problem},
booktitle = {Algorithms and Computation - 25th International Symposium, {ISAAC}
2014, Jeonju, Korea, December 15-17, 2014, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8889},
pages = {606--617},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-13075-0\_48},
doi = {10.1007/978-3-319-13075-0\_48},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/WuLWC14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChenC13,
author = {Kuan{-}Yu Chen and
Kun{-}Mao Chao},
title = {A Fully Compressed Algorithm for Computing the Edit Distance of Run-Length
Encoded Strings},
journal = {Algorithmica},
volume = {65},
number = {2},
pages = {354--370},
year = {2013},
url = {https://doi.org/10.1007/s00453-011-9592-4},
doi = {10.1007/S00453-011-9592-4},
timestamp = {Mon, 05 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ChenC13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ChuWC13,
author = {An{-}Chiang Chu and
Bang Ye Wu and
Kun{-}Mao Chao},
title = {A linear-time algorithm for finding an edge-partition with max-min
ratio at most two},
journal = {Discret. Appl. Math.},
volume = {161},
number = {7-8},
pages = {932--943},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.11.009},
doi = {10.1016/J.DAM.2012.11.009},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/ChuWC13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijcga/ChaoHL13,
author = {Kun{-}Mao Chao and
Tsan{-}sheng Hsu and
Der{-}Tsai Lee},
title = {Guest Editors' Foreword},
journal = {Int. J. Comput. Geom. Appl.},
volume = {23},
number = {6},
pages = {425--426},
year = {2013},
url = {https://doi.org/10.1142/S0218195913020032},
doi = {10.1142/S0218195913020032},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijcga/ChaoHL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dasfaa/LinCC13,
author = {Rung{-}Ren Lin and
Ya{-}Hui Chang and
Kun{-}Mao Chao},
editor = {Weiyi Meng and
Ling Feng and
St{\'{e}}phane Bressan and
Werner Winiwarter and
Wei Song},
title = {A Compact and Efficient Labeling Scheme for {XML} Documents},
booktitle = {Database Systems for Advanced Applications, 18th International Conference,
{DASFAA} 2013, Wuhan, China, April 22-25, 2013. Proceedings, Part
{I}},
series = {Lecture Notes in Computer Science},
volume = {7825},
pages = {269--283},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-37487-6\_22},
doi = {10.1007/978-3-642-37487-6\_22},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/dasfaa/LinCC13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/WuLWC13,
author = {Yen{-}Wei Wu and
Wei{-}Yin Lin and
Hung{-}Lung Wang and
Kun{-}Mao Chao},
editor = {Leizhen Cai and
Siu{-}Wing Cheng and
Tak Wah Lam},
title = {Computing Plurality Points and Condorcet Points in Euclidean Space},
booktitle = {Algorithms and Computation - 24th International Symposium, {ISAAC}
2013, Hong Kong, China, December 16-18, 2013, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8283},
pages = {688--698},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-45030-3\_64},
doi = {10.1007/978-3-642-45030-3\_64},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/WuLWC13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/WuLWC13,
author = {Yen{-}Wei Wu and
Wei{-}Yin Lin and
Hung{-}Lung Wang and
Kun{-}Mao Chao},
editor = {Thierry Lecroq and
Laurent Mouchard},
title = {An Optimal Algorithm for the Popular Condensation Problem},
booktitle = {Combinatorial Algorithms - 24th International Workshop, {IWOCA} 2013,
Rouen, France, July 10-12, 2013, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {8288},
pages = {412--422},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-45278-9\_35},
doi = {10.1007/978-3-642-45278-9\_35},
timestamp = {Wed, 25 Sep 2019 18:08:04 +0200},
biburl = {https://dblp.org/rec/conf/iwoca/WuLWC13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChangC12,
author = {Chia{-}Jung Chang and
Kun{-}Mao Chao},
title = {Efficient algorithms for local ranking},
journal = {Inf. Process. Lett.},
volume = {112},
number = {13},
pages = {517--522},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2012.03.011},
doi = {10.1016/J.IPL.2012.03.011},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChangC12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChenHC12,
author = {Kuan{-}Yu Chen and
Ping{-}Hui Hsu and
Kun{-}Mao Chao},
title = {Efficient retrieval of approximate palindromes in a run-length encoded
string},
journal = {Theor. Comput. Sci.},
volume = {432},
pages = {28--37},
year = {2012},
url = {https://doi.org/10.1016/j.tcs.2012.01.023},
doi = {10.1016/J.TCS.2012.01.023},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ChenHC12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tamc/ChaoCJLM12,
author = {Kun{-}Mao Chao and
An{-}Chiang Chu and
Jesper Jansson and
Richard S. Lemence and
Alban Mancheron},
editor = {Manindra Agrawal and
S. Barry Cooper and
Angsheng Li},
title = {Asymptotic Limits of a New Type of Maximization Recurrence with an
Application to Bioinformatics},
booktitle = {Theory and Applications of Models of Computation - 9th Annual Conference,
{TAMC} 2012, Beijing, China, May 16-21, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7287},
pages = {177--188},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-29952-0\_21},
doi = {10.1007/978-3-642-29952-0\_21},
timestamp = {Tue, 17 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/tamc/ChaoCJLM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wabi/BerntCKMT12,
author = {Matthias Bernt and
Kun{-}Mao Chao and
Jyun{-}Wei Kao and
Martin Middendorf and
Eric Tannier},
editor = {Benjamin J. Raphael and
Jijun Tang},
title = {Preserving Inversion Phylogeny Reconstruction},
booktitle = {Algorithms in Bioinformatics - 12th International Workshop, {WABI}
2012, Ljubljana, Slovenia, September 10-12, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7534},
pages = {1--13},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-33122-0\_1},
doi = {10.1007/978-3-642-33122-0\_1},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wabi/BerntCKMT12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/isaac/2012,
editor = {Kun{-}Mao Chao and
Tsan{-}sheng Hsu and
Der{-}Tsai Lee},
title = {Algorithms and Computation - 23rd International Symposium, {ISAAC}
2012, Taipei, Taiwan, December 19-21, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7676},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-35261-4},
doi = {10.1007/978-3-642-35261-4},
isbn = {978-3-642-35260-7},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/2012.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijcga/LuoLCC11,
author = {Cheng{-}Wei Luo and
Hsiao{-}Fei Liu and
Peng{-}An Chen and
Kun{-}Mao Chao},
title = {Minkowski Sum Selection and Finding},
journal = {Int. J. Comput. Geom. Appl.},
volume = {21},
number = {3},
pages = {283--311},
year = {2011},
url = {https://doi.org/10.1142/S0218195911003664},
doi = {10.1142/S0218195911003664},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijcga/LuoLCC11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/ChenC11,
author = {Yi{-}Ching Chen and
Kun{-}Mao Chao},
title = {On the generalized constrained longest common subsequence problems},
journal = {J. Comb. Optim.},
volume = {21},
number = {3},
pages = {383--392},
year = {2011},
url = {https://doi.org/10.1007/s10878-009-9262-5},
doi = {10.1007/S10878-009-9262-5},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/ChenC11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BerntCCCMWCM11,
author = {Matthias Bernt and
Kuan{-}Yu Chen and
Ming{-}Chiang Chen and
An{-}Chiang Chu and
Daniel Merkle and
Hung{-}Lung Wang and
Kun{-}Mao Chao and
Martin Middendorf},
title = {Finding all sorting tandem duplication random loss operations},
journal = {J. Discrete Algorithms},
volume = {9},
number = {1},
pages = {32--48},
year = {2011},
url = {https://doi.org/10.1016/j.jda.2010.09.006},
doi = {10.1016/J.JDA.2010.09.006},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BerntCCCMWCM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigmod/LinCC11,
author = {Rung{-}Ren Lin and
Ya{-}Hui Chang and
Kun{-}Mao Chao},
title = {Improving the performance of identifying contributors for {XML} keyword
search},
journal = {{SIGMOD} Rec.},
volume = {40},
number = {1},
pages = {5--10},
year = {2011},
url = {https://doi.org/10.1145/2007206.2007208},
doi = {10.1145/2007206.2007208},
timestamp = {Fri, 06 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/sigmod/LinCC11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcbb/LuoCCYLC11,
author = {Cheng{-}Wei Luo and
Ming{-}Chiang Chen and
Yi{-}Ching Chen and
Roger W. L. Yang and
Hsiao{-}Fei Liu and
Kun{-}Mao Chao},
title = {Linear-Time Algorithms for the Multiple Gene Duplication Problems},
journal = {{IEEE} {ACM} Trans. Comput. Biol. Bioinform.},
volume = {8},
number = {1},
pages = {260--265},
year = {2011},
url = {https://doi.org/10.1109/TCBB.2009.52},
doi = {10.1109/TCBB.2009.52},
timestamp = {Mon, 03 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcbb/LuoCCYLC11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dasfaa/LinCC11,
author = {Rung{-}Ren Lin and
Ya{-}Hui Chang and
Kun{-}Mao Chao},
editor = {Jeffrey Xu Yu and
Myoung{-}Ho Kim and
Rainer Unland},
title = {Identifying Relevant Matches with {NOT} Semantics over {XML} Documents},
booktitle = {Database Systems for Advanced Applications - 16th International Conference,
{DASFAA} 2011, Hong Kong, China, April 22-25, 2011, Proceedings, Part
{I}},
series = {Lecture Notes in Computer Science},
volume = {6587},
pages = {466--480},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-20149-3\_34},
doi = {10.1007/978-3-642-20149-3\_34},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/dasfaa/LinCC11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ChuWWC10,
author = {An{-}Chiang Chu and
Bang Ye Wu and
Hung{-}Lung Wang and
Kun{-}Mao Chao},
title = {A tight bound on the min-ratio edge-partitioning problem of a tree},
journal = {Discret. Appl. Math.},
volume = {158},
number = {14},
pages = {1471--1478},
year = {2010},
url = {https://doi.org/10.1016/j.dam.2010.05.014},
doi = {10.1016/J.DAM.2010.05.014},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/ChuWWC10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/HsuCC10,
author = {Ping{-}Hui Hsu and
Kuan{-}Yu Chen and
Kun{-}Mao Chao},
title = {Finding All Approximate Gapped Palindromes},
journal = {Int. J. Found. Comput. Sci.},
volume = {21},
number = {6},
pages = {925--939},
year = {2010},
url = {https://doi.org/10.1142/S0129054110007647},
doi = {10.1142/S0129054110007647},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/HsuCC10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jc/ChenHC10,
author = {Kuan{-}Yu Chen and
Ping{-}Hui Hsu and
Kun{-}Mao Chao},
title = {Hardness of comparing two run-length encoded strings},
journal = {J. Complex.},
volume = {26},
number = {4},
pages = {364--374},
year = {2010},
url = {https://doi.org/10.1016/j.jco.2010.03.003},
doi = {10.1016/J.JCO.2010.03.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jc/ChenHC10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dexa/LinCC10,
author = {Rung{-}Ren Lin and
Ya{-}Hui Chang and
Kun{-}Mao Chao},
editor = {Pablo Garc{\'{\i}}a Bringas and
Abdelkader Hameurlain and
Gerald Quirchmayr},
title = {Faster Algorithms for Searching Relevant Matches in {XML} Databases},
booktitle = {Database and Expert Systems Applications, 21st International Conference,
{DEXA} 2010, Bilbao, Spain, August 30 - September 3, 2010, Proceedings,
Part {I}},
series = {Lecture Notes in Computer Science},
volume = {6261},
pages = {290--297},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-15364-8\_23},
doi = {10.1007/978-3-642-15364-8\_23},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/dexa/LinCC10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/ChenC10,
author = {Kuan{-}Yu Chen and
Kun{-}Mao Chao},
editor = {Mark de Berg and
Ulrich Meyer},
title = {A Fully Compressed Algorithm for Computing the Edit Distance of Run-Length
Encoded Strings},
booktitle = {Algorithms - {ESA} 2010, 18th Annual European Symposium, Liverpool,
UK, September 6-8, 2010. Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {6346},
pages = {415--426},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-15775-2\_36},
doi = {10.1007/978-3-642-15775-2\_36},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/ChenC10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/ChenHC10,
author = {Kuan{-}Yu Chen and
Ping{-}Hui Hsu and
Kun{-}Mao Chao},
editor = {Otfried Cheong and
Kyung{-}Yong Chwa and
Kunsoo Park},
title = {Identifying Approximate Palindromes in Run-Length Encoded Strings},
booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC}
2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part
{II}},
series = {Lecture Notes in Computer Science},
volume = {6507},
pages = {339--350},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-17514-5\_29},
doi = {10.1007/978-3-642-17514-5\_29},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/ChenHC10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@book{DBLP:series/cb/ChaoZ09,
author = {Kun{-}Mao Chao and
Louxin Zhang},
title = {Sequence Comparison - Theory and Methods},
series = {Computational Biology},
volume = {7},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-1-84800-320-0},
doi = {10.1007/978-1-84800-320-0},
isbn = {978-1-84800-319-4},
timestamp = {Tue, 16 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/series/cb/ChaoZ09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/LiuC09,
author = {Hsiao{-}Fei Liu and
Kun{-}Mao Chao},
title = {On Locating Disjoint Segments with Maximum Sum of Densities},
journal = {Algorithmica},
volume = {54},
number = {1},
pages = {107--117},
year = {2009},
url = {https://doi.org/10.1007/s00453-007-9122-6},
doi = {10.1007/S00453-007-9122-6},
timestamp = {Mon, 05 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/LiuC09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChengLC09,
author = {Chih{-}Huai Cheng and
Hsiao{-}Fei Liu and
Kun{-}Mao Chao},
title = {Optimal algorithms for the average-constrained maximum-sum segment
problem},
journal = {Inf. Process. Lett.},
volume = {109},
number = {3},
pages = {171--174},
year = {2009},
url = {https://doi.org/10.1016/j.ipl.2008.09.024},
doi = {10.1016/J.IPL.2008.09.024},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChengLC09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/WangWC09,
author = {Hung{-}Lung Wang and
Bang Ye Wu and
Kun{-}Mao Chao},
title = {The backup 2-center and backup 2-median problems on trees},
journal = {Networks},
volume = {53},
number = {1},
pages = {39--49},
year = {2009},
url = {https://doi.org/10.1002/net.20261},
doi = {10.1002/NET.20261},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/WangWC09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/ChenHC09,
author = {Kuan{-}Yu Chen and
Ping{-}Hui Hsu and
Kun{-}Mao Chao},
editor = {Gregory Kucherov and
Esko Ukkonen},
title = {Approximate Matching for Run-Length Encoded Strings Is 3sum-Hard},
booktitle = {Combinatorial Pattern Matching, 20th Annual Symposium, {CPM} 2009,
Lille, France, June 22-24, 2009, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5577},
pages = {168--179},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-02441-2\_15},
doi = {10.1007/978-3-642-02441-2\_15},
timestamp = {Tue, 14 May 2019 10:00:38 +0200},
biburl = {https://dblp.org/rec/conf/cpm/ChenHC09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/BerntCMWCM09,
author = {Matthias Bernt and
Ming{-}Chiang Chen and
Daniel Merkle and
Hung{-}Lung Wang and
Kun{-}Mao Chao and
Martin Middendorf},
editor = {Gregory Kucherov and
Esko Ukkonen},
title = {Finding All Sorting Tandem Duplication Random Loss Operations},
booktitle = {Combinatorial Pattern Matching, 20th Annual Symposium, {CPM} 2009,
Lille, France, June 22-24, 2009, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5577},
pages = {301--313},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-02441-2\_27},
doi = {10.1007/978-3-642-02441-2\_27},
timestamp = {Fri, 02 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/BerntCMWCM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/HsuCC09,
author = {Ping{-}Hui Hsu and
Kuan{-}Yu Chen and
Kun{-}Mao Chao},
editor = {Yingfei Dong and
Ding{-}Zhu Du and
Oscar H. Ibarra},
title = {Finding All Approximate Gapped Palindromes},
booktitle = {Algorithms and Computation, 20th International Symposium, {ISAAC}
2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5878},
pages = {1084--1093},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-10631-6\_109},
doi = {10.1007/978-3-642-10631-6\_109},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/HsuCC09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/WuHC08,
author = {Bang Ye Wu and
Chih{-}Yuan Hsiao and
Kun{-}Mao Chao},
title = {The Swap Edges of a Multiple-Sources Routing Tree},
journal = {Algorithmica},
volume = {50},
number = {3},
pages = {299--311},
year = {2008},
url = {https://doi.org/10.1007/s00453-007-9080-z},
doi = {10.1007/S00453-007-9080-Z},
timestamp = {Mon, 05 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/WuHC08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bioinformatics/ChenLC08,
author = {Peng{-}An Chen and
Hsiao{-}Fei Liu and
Kun{-}Mao Chao},
title = {CNVDetector: locating copy number variations using array {CGH} data},
journal = {Bioinform.},
volume = {24},
number = {23},
pages = {2773--2775},
year = {2008},
url = {https://doi.org/10.1093/bioinformatics/btn517},
doi = {10.1093/BIOINFORMATICS/BTN517},
timestamp = {Mon, 02 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/bioinformatics/ChenLC08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jbi/HuangC08,
author = {Yao{-}Ting Huang and
Kun{-}Mao Chao},
title = {A new framework for the selection of tag SNPs by multimarker haplotypes},
journal = {J. Biomed. Informatics},
volume = {41},
number = {6},
pages = {953--961},
year = {2008},
url = {https://doi.org/10.1016/j.jbi.2008.04.003},
doi = {10.1016/J.JBI.2008.04.003},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jbi/HuangC08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LiuC08,
author = {Hsiao{-}Fei Liu and
Kun{-}Mao Chao},
title = {Algorithms for finding the weight-constrained k longest paths in a
tree and the length-constrained k maximum-sum segments of a sequence},
journal = {Theor. Comput. Sci.},
volume = {407},
number = {1-3},
pages = {349--358},
year = {2008},
url = {https://doi.org/10.1016/j.tcs.2008.06.052},
doi = {10.1016/J.TCS.2008.06.052},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/LiuC08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/WangC08,
author = {Hung{-}Lung Wang and
Kun{-}Mao Chao},
title = {The 2-radius and 2-radiian problems on trees},
journal = {Theor. Comput. Sci.},
volume = {407},
number = {1-3},
pages = {524--531},
year = {2008},
url = {https://doi.org/10.1016/j.tcs.2008.08.022},
doi = {10.1016/J.TCS.2008.08.022},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/WangC08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/eccb/YangCYLLYYLHTCH08,
author = {Chia{-}Ying Yang and
Chao{-}Hui Chang and
Ya{-}Ling Yu and
Tsu{-}Chun Emma Lin and
Sheng{-}An Lee and
Chueh{-}Chuan Yen and
Jinn{-}Moon Yang and
Jin{-}Mei Lai and
Yi{-}Ren Hong and
Tzu{-}Ling Tseng and
Kun{-}Mao Chao and
Chi{-}Ying F. Huang},
title = {PhosphoPOINT: a comprehensive human kinase interactome and phospho-protein
database},
booktitle = {ECCB'08 Proceedings, Seventh European Conference on Computational
Biology, 22-26 September 2008, Cagliari, Italy},
pages = {14--20},
year = {2008},
url = {https://doi.org/10.1093/bioinformatics/btn297},
doi = {10.1093/BIOINFORMATICS/BTN297},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/eccb/YangCYLLYYLHTCH08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/LuoLCC08,
author = {Cheng{-}Wei Luo and
Hsiao{-}Fei Liu and
Peng{-}An Chen and
Kun{-}Mao Chao},
editor = {Seok{-}Hee Hong and
Hiroshi Nagamochi and
Takuro Fukunaga},
title = {Minkowski Sum Selection and Finding},
booktitle = {Algorithms and Computation, 19th International Symposium, {ISAAC}
2008, Gold Coast, Australia, December 15-17, 2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5369},
pages = {460--471},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-92182-0\_42},
doi = {10.1007/978-3-540-92182-0\_42},
timestamp = {Thu, 27 Apr 2023 14:57:19 +0200},
biburl = {https://dblp.org/rec/conf/isaac/LuoLCC08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/Chao08,
author = {Kun{-}Mao Chao},
editor = {Ming{-}Yang Kao},
title = {Maximum-Density Segment},
booktitle = {Encyclopedia of Algorithms - 2008 Edition},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-0-387-30162-4\_224},
doi = {10.1007/978-0-387-30162-4\_224},
timestamp = {Thu, 27 Jun 2019 16:25:31 +0200},
biburl = {https://dblp.org/rec/reference/algo/Chao08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/Chao08a,
author = {Kun{-}Mao Chao},
editor = {Ming{-}Yang Kao},
title = {Maximum-scoring Segment with Length Restrictions},
booktitle = {Encyclopedia of Algorithms - 2008 Edition},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-0-387-30162-4\_226},
doi = {10.1007/978-0-387-30162-4\_226},
timestamp = {Wed, 12 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/reference/algo/Chao08a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0804-3860,
author = {Hsiao{-}Fei Liu and
Kun{-}Mao Chao},
title = {An {\~{O}}(n\({}^{\mbox{2.5}}\))-Time Algorithm for Online Topological
Ordering},
journal = {CoRR},
volume = {abs/0804.3860},
year = {2008},
url = {http://arxiv.org/abs/0804.3860},
eprinttype = {arXiv},
eprint = {0804.3860},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0804-3860.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0809-1171,
author = {Cheng{-}Wei Luo and
Hsiao{-}Fei Liu and
Peng{-}An Chen and
Kun{-}Mao Chao},
title = {Minkowski Sum Selection and Finding},
journal = {CoRR},
volume = {abs/0809.1171},
year = {2008},
url = {http://arxiv.org/abs/0809.1171},
eprinttype = {arXiv},
eprint = {0809.1171},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0809-1171.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0809-2097,
author = {Hsiao{-}Fei Liu and
Peng{-}An Chen and
Kun{-}Mao Chao},
title = {Algorithms for Locating Constrained Optimal Intervals},
journal = {CoRR},
volume = {abs/0809.2097},
year = {2008},
url = {http://arxiv.org/abs/0809.2097},
eprinttype = {arXiv},
eprint = {0809.2097},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0809-2097.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/WuWKC07,
author = {Bang Ye Wu and
Hung{-}Lung Wang and
Shih Ta Kuan and
Kun{-}Mao Chao},
title = {On the uniform edge-partition of a tree},
journal = {Discret. Appl. Math.},
volume = {155},
number = {10},
pages = {1213--1223},
year = {2007},
url = {https://doi.org/10.1016/j.dam.2006.10.012},
doi = {10.1016/J.DAM.2006.10.012},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/WuWKC07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ChenC07,
author = {Kuan{-}Yu Chen and
Kun{-}Mao Chao},
title = {On the range maximum-sum segment query problem},
journal = {Discret. Appl. Math.},
volume = {155},
number = {16},
pages = {2043--2052},
year = {2007},
url = {https://doi.org/10.1016/j.dam.2007.05.018},
doi = {10.1016/J.DAM.2007.05.018},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/ChenC07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LiuC07,
author = {Hsiao{-}Fei Liu and
Kun{-}Mao Chao},
title = {A tight analysis of the Katriel-Bodlaender algorithm for online topological
ordering},
journal = {Theor. Comput. Sci.},
volume = {389},
number = {1-2},
pages = {182--189},
year = {2007},
url = {https://doi.org/10.1016/j.tcs.2007.08.009},
doi = {10.1016/J.TCS.2007.08.009},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/LiuC07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/LiuCC07,
author = {Hsiao{-}Fei Liu and
Peng{-}An Chen and
Kun{-}Mao Chao},
editor = {Takeshi Tokuyama},
title = {Algorithms for Computing the Length-Constrained Max-Score Segments
with Applications to {DNA} Copy Number Data Analysis},
booktitle = {Algorithms and Computation, 18th International Symposium, {ISAAC}
2007, Sendai, Japan, December 17-19, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4835},
pages = {834--845},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-77120-3\_72},
doi = {10.1007/978-3-540-77120-3\_72},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/LiuCC07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/crc/TangCW07,
author = {Chuan Yi Tang and
Kun{-}Mao Chao and
Bang Ye Wu},
editor = {Teofilo F. Gonzalez},
title = {Optimum Communication Spanning Trees},
booktitle = {Handbook of Approximation Algorithms and Metaheuristics},
publisher = {Chapman and Hall/CRC},
year = {2007},
url = {https://doi.org/10.1201/9781420010749.ch59},
doi = {10.1201/9781420010749.CH59},
timestamp = {Wed, 12 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/reference/crc/TangCW07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/crc/ZhangCHC07,
author = {Kui Zhang and
Kun{-}Mao Chao and
Yao{-}Ting Huang and
Ting Chen},
editor = {Teofilo F. Gonzalez},
title = {Approximation Algorithms for the Selection of Robust Tag SNPs},
booktitle = {Handbook of Approximation Algorithms and Metaheuristics},
publisher = {Chapman and Hall/CRC},
year = {2007},
url = {https://doi.org/10.1201/9781420010749.ch77},
doi = {10.1201/9781420010749.CH77},
timestamp = {Thu, 24 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/reference/crc/ZhangCHC07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bioinformatics/ChangHC06,
author = {Chia{-}Jung Chang and
Yao{-}Ting Huang and
Kun{-}Mao Chao},
title = {A greedier approach for finding tag SNPs},
journal = {Bioinform.},
volume = {22},
number = {6},
pages = {685--691},
year = {2006},
url = {https://doi.org/10.1093/bioinformatics/btk035},
doi = {10.1093/BIOINFORMATICS/BTK035},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bioinformatics/ChangHC06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChengCTC06,
author = {Chih{-}Huai Cheng and
Kuan{-}Yu Chen and
Wen{-}Chin Tien and
Kun{-}Mao Chao},
title = {Improved algorithms for the \emph{k} maximum-sums problems},
journal = {Theor. Comput. Sci.},
volume = {362},
number = {1-3},
pages = {162--170},
year = {2006},
url = {https://doi.org/10.1016/j.tcs.2006.06.007},
doi = {10.1016/J.TCS.2006.06.007},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ChengCTC06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/LiuC06,
author = {Hsiao{-}Fei Liu and
Kun{-}Mao Chao},
editor = {Tetsuo Asano},
title = {On Locating Disjoint Segments with Maximum Sum of Densities},
booktitle = {Algorithms and Computation, 17th International Symposium, {ISAAC}
2006, Kolkata, India, December 18-20, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4288},
pages = {300--307},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11940128\_31},
doi = {10.1007/11940128\_31},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/LiuC06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bmcbi/HuangZCC05,
author = {Yao{-}Ting Huang and
Kui Zhang and
Ting Chen and
Kun{-}Mao Chao},
title = {Selecting additional tag SNPs for tolerating missing data in genotyping},
journal = {{BMC} Bioinform.},
volume = {6},
pages = {263},
year = {2005},
url = {https://doi.org/10.1186/1471-2105-6-263},
doi = {10.1186/1471-2105-6-263},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bmcbi/HuangZCC05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/YangHC05,
author = {I{-}Hsuan Yang and
Chien{-}Pin Huang and
Kun{-}Mao Chao},
title = {A fast algorithm for computing a longest common increasing subsequence},
journal = {Inf. Process. Lett.},
volume = {93},
number = {5},
pages = {249--253},
year = {2005},
url = {https://doi.org/10.1016/j.ipl.2004.10.014},
doi = {10.1016/J.IPL.2004.10.014},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/YangHC05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ChenC05,
author = {Kuan{-}Yu Chen and
Kun{-}Mao Chao},
title = {Optimal algorithms for locating the longest and shortest segments
satisfying a sum or an average constraint},
journal = {Inf. Process. Lett.},
volume = {96},
number = {6},
pages = {197--201},
year = {2005},
url = {https://doi.org/10.1016/j.ipl.2005.08.006},
doi = {10.1016/J.IPL.2005.08.006},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ChenC05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcb/HuangCC05,
author = {Yao{-}Ting Huang and
Kun{-}Mao Chao and
Ting Chen},
title = {An Approximation Algorithm for Haplotype Inference by Maximum Parsimony},
journal = {J. Comput. Biol.},
volume = {12},
number = {10},
pages = {1261--1274},
year = {2005},
url = {https://doi.org/10.1089/cmb.2005.12.1261},
doi = {10.1089/CMB.2005.12.1261},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcb/HuangCC05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/LinKC05,
author = {Rung{-}Ren Lin and
Wen{-}Hsiung Kuo and
Kun{-}Mao Chao},
title = {Finding a Length-Constrained Maximum-Density Path in a Tree},
journal = {J. Comb. Optim.},
volume = {9},
number = {2},
pages = {147--156},
year = {2005},
url = {https://doi.org/10.1007/s10878-005-6853-7},
doi = {10.1007/S10878-005-6853-7},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/LinKC05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/ChengCTC05,
author = {Chih{-}Huai Cheng and
Kuan{-}Yu Chen and
Wen{-}Chin Tien and
Kun{-}Mao Chao},
editor = {Xiaotie Deng and
Ding{-}Zhu Du},
title = {Improved Algorithms for the \emph{k} Maximum-Sums Problems},
booktitle = {Algorithms and Computation, 16th International Symposium, {ISAAC}
2005, Sanya, Hainan, China, December 19-21, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3827},
pages = {799--808},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11602613\_80},
doi = {10.1007/11602613\_80},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/ChengCTC05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sac/HuangCC05,
author = {Yao{-}Ting Huang and
Kun{-}Mao Chao and
Ting Chen},
editor = {Hisham Haddad and
Lorie M. Liebrock and
Andrea Omicini and
Roger L. Wainwright},
title = {An approximation algorithm for haplotype inference by maximum parsimony},
booktitle = {Proceedings of the 2005 {ACM} Symposium on Applied Computing (SAC),
Santa Fe, New Mexico, USA, March 13-17, 2005},
pages = {146--150},
publisher = {{ACM}},
year = {2005},
url = {https://doi.org/10.1145/1066677.1066714},
doi = {10.1145/1066677.1066714},
timestamp = {Thu, 24 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sac/HuangCC05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@book{DBLP:books/daglib/0010278,
author = {Bang Ye Wu and
Kun{-}Mao Chao},
title = {Spanning trees and optimization problems},
series = {Discrete mathematics and its applications},
publisher = {Chapman {\&} Hall},
year = {2004},
isbn = {978-1-58488-436-1},
timestamp = {Mon, 15 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/books/daglib/0010278.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bioinformatics/HuangYCYC04,
author = {Xiaoqiu Huang and
Liang Ye and
Hui{-}Hsien Chou and
I{-}Hsuan Yang and
Kun{-}Mao Chao},
title = {Efficient combination of multiple word models for improved sequence
comparison},
journal = {Bioinform.},
volume = {20},
number = {16},
pages = {2529--2533},
year = {2004},
url = {https://doi.org/10.1093/bioinformatics/bth279},
doi = {10.1093/BIOINFORMATICS/BTH279},
timestamp = {Mon, 02 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/bioinformatics/HuangYCYC04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigmod/LiuCC04,
author = {Hsiao{-}Fei Liu and
Ya{-}Hui Chang and
Kun{-}Mao Chao},
title = {An Optimal Algorithm for Querying Tree Structures and its Applications
in Bioinformatics},
journal = {{SIGMOD} Rec.},
volume = {33},
number = {2},
pages = {21--26},
year = {2004},
url = {https://doi.org/10.1145/1024694.1024698},
doi = {10.1145/1024694.1024698},
timestamp = {Fri, 06 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/sigmod/LiuCC04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/bibe/YangWCHYHC04,
author = {I{-}Hsuan Yang and
Sheng{-}Ho Wang and
Yang{-}Ho Chen and
Pao{-}Hsian Huang and
Liang Ye and
Xiaoqiu Huang and
Kun{-}Mao Chao},
title = {Efficient Methods for Generating Optimal Single and Multiple Spaced
Seeds},
booktitle = {4th {IEEE} International Symposium on BioInformatics and BioEngineering
{(BIBE} 2004), 19-21 March 2004, Taichung, Taiwan},
pages = {411--418},
publisher = {{IEEE} Computer Society},
year = {2004},
url = {https://doi.org/10.1109/BIBE.2004.1317372},
doi = {10.1109/BIBE.2004.1317372},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/bibe/YangWCHYHC04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/ChenC04a,
author = {Kuan{-}Yu Chen and
Kun{-}Mao Chao},
editor = {Rudolf Fleischer and
Gerhard Trippen},
title = {On the Range Maximum-Sum Segment Query Problem},
booktitle = {Algorithms and Computation, 15th International Symposium, {ISAAC}
2004, Hong Kong, China, December 20-22, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3341},
pages = {294--305},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-30551-4\_27},
doi = {10.1007/978-3-540-30551-4\_27},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/ChenC04a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/snpd/HuangYYC04,
author = {Xiaoqiu Huang and
Liang Ye and
I{-}Hsuan Yang and
Kun{-}Mao Chao},
title = {A Sensitive Sequence Comparison Method},
booktitle = {4th {IEEE} International Workshop on Source Code Analysis and Manipulation
{(SCAM} 2004), 15-16 September 2004, Chicago, IL, {USA}},
pages = {77--80},
publisher = {{IEEE} Computer Society},
year = {2004},
timestamp = {Wed, 16 Oct 2019 14:14:55 +0200},
biburl = {https://dblp.org/rec/conf/snpd/HuangYYC04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wabi/HuangZCC04,
author = {Yao{-}Ting Huang and
Kui Zhang and
Ting Chen and
Kun{-}Mao Chao},
editor = {Inge Jonassen and
Junhyong Kim},
title = {Approximation Algorithms for the Selection of Robust Tag SNPs},
booktitle = {Algorithms in Bioinformatics, 4th International Workshop, {WABI} 2004,
Bergen, Norway, September 17-21, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3240},
pages = {278--289},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-30219-3\_24},
doi = {10.1007/978-3-540-30219-3\_24},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wabi/HuangZCC04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bioinformatics/LinHJC03,
author = {Yaw{-}Ling Lin and
Xiaoqiu Huang and
Tao Jiang and
Kun{-}Mao Chao},
title = {{MAVG:} locating non-overlapping maximum average segments in a given
sequence},
journal = {Bioinform.},
volume = {19},
number = {1},
pages = {151--152},
year = {2003},
url = {https://doi.org/10.1093/bioinformatics/19.1.151},
doi = {10.1093/BIOINFORMATICS/19.1.151},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bioinformatics/LinHJC03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bioinformatics/HuangC03,
author = {Xiaoqiu Huang and
Kun{-}Mao Chao},
title = {A generalized global alignment algorithm},
journal = {Bioinform.},
volume = {19},
number = {2},
pages = {228--233},
year = {2003},
url = {https://doi.org/10.1093/bioinformatics/19.2.228},
doi = {10.1093/BIOINFORMATICS/19.2.228},
timestamp = {Mon, 02 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/bioinformatics/HuangC03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jbcb/TangLCTSCCCWCC03,
author = {Chuan Yi Tang and
Chin Lung Lu and
Margaret Dah{-}Tsyr Chang and
Yin{-}Te Tsai and
Yuh{-}Ju Sun and
Kun{-}Mao Chao and
Jia{-}Ming Chang and
Yu{-}Han Chiou and
Chia{-}Mao Wu and
Hao{-}Teng Chang and
Wei{-}I Chou},
title = {Constrained Multiple Sequence Alignment Tool Development Andits Application
to Rnase Family Alignment},
journal = {J. Bioinform. Comput. Biol.},
volume = {1},
number = {2},
pages = {267--288},
year = {2003},
url = {https://doi.org/10.1142/S0219720003000095},
doi = {10.1142/S0219720003000095},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jbcb/TangLCTSCCCWCC03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/LinKC03,
author = {Rung{-}Ren Lin and
Wen{-}Hsiung Kuo and
Kun{-}Mao Chao},
editor = {Toshihide Ibaraki and
Naoki Katoh and
Hirotaka Ono},
title = {Finding a Length-Constrained Maximum-Density Path in a Tree},
booktitle = {Algorithms and Computation, 14th International Symposium, {ISAAC}
2003, Kyoto, Japan, December 15-17, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2906},
pages = {78--87},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-24587-2\_10},
doi = {10.1007/978-3-540-24587-2\_10},
timestamp = {Fri, 29 Dec 2023 12:40:31 +0100},
biburl = {https://dblp.org/rec/conf/isaac/LinKC03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/LinJC02,
author = {Yaw{-}Ling Lin and
Tao Jiang and
Kun{-}Mao Chao},
title = {Efficient algorithms for locating the length-constrained heaviest
segments with applications to biomolecular sequence analysis},
journal = {J. Comput. Syst. Sci.},
volume = {65},
number = {3},
pages = {570--586},
year = {2002},
url = {https://doi.org/10.1016/S0022-0000(02)00010-7},
doi = {10.1016/S0022-0000(02)00010-7},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/LinJC02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/WuCT02,
author = {Bang Ye Wu and
Kun{-}Mao Chao and
Chuan Yi Tang},
title = {Light graphs with small routing cost},
journal = {Networks},
volume = {39},
number = {3},
pages = {130--138},
year = {2002},
url = {https://doi.org/10.1002/net.10019},
doi = {10.1002/NET.10019},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/WuCT02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csb/TangLCTSCCCWCC02,
author = {Chuan Yi Tang and
Chin Lung Lu and
Margaret Dah{-}Tsyr Chang and
Yin{-}Te Tsai and
Yuh{-}Ju Sun and
Kun{-}Mao Chao and
Jia{-}Ming Chang and
Yu{-}Han Chiou and
Chia{-}Mao Wu and
Hao{-}Teng Chang and
Wei{-}I Chou},
title = {Constrained Multiple Sequence Alignment Tool Development and Its Application
to RNase Family Alignment},
booktitle = {1st {IEEE} Computer Society Bioinformatics Conference, {CSB} 2002,
Stanford, CA, USA, August 14-16, 2002},
pages = {127--137},
publisher = {{IEEE} Computer Society},
year = {2002},
url = {https://doi.org/10.1109/CSB.2002.1039336},
doi = {10.1109/CSB.2002.1039336},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/csb/TangLCTSCCCWCC02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/LinJC02,
author = {Yaw{-}Ling Lin and
Tao Jiang and
Kun{-}Mao Chao},
editor = {Krzysztof Diks and
Wojciech Rytter},
title = {Efficient Algorithms for Locating the Length-Constrained Heaviest
Segments, with Applications to Biomolecular Sequence Analysis},
booktitle = {Mathematical Foundations of Computer Science 2002, 27th International
Symposium, {MFCS} 2002, Warsaw, Poland, August 26-30, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2420},
pages = {459--470},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45687-2\_38},
doi = {10.1007/3-540-45687-2\_38},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/LinJC02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/WuCT00a,
author = {Bang Ye Wu and
Kun{-}Mao Chao and
Chuan Yi Tang},
title = {Approximation algorithms for some optimum communication spanning tree
problems},
journal = {Discret. Appl. Math.},
volume = {102},
number = {3},
pages = {245--266},
year = {2000},
url = {https://doi.org/10.1016/S0166-218X(99)00212-7},
doi = {10.1016/S0166-218X(99)00212-7},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/WuCT00a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/WuCT00,
author = {Bang Ye Wu and
Kun{-}Mao Chao and
Chuan Yi Tang},
title = {Approximation algorithms for the shortest total path length spanning
tree problem},
journal = {Discret. Appl. Math.},
volume = {105},
number = {1-3},
pages = {273--289},
year = {2000},
url = {https://doi.org/10.1016/S0166-218X(00)00185-2},
doi = {10.1016/S0166-218X(00)00185-2},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/WuCT00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/WuCT00,
author = {Bang Ye Wu and
Kun{-}Mao Chao and
Chuan Yi Tang},
title = {A Polynomial Time Approximation Scheme for Optimal Product-Requirement
Communication Spanning Trees},
journal = {J. Algorithms},
volume = {36},
number = {2},
pages = {182--204},
year = {2000},
url = {https://doi.org/10.1006/jagm.2000.1088},
doi = {10.1006/JAGM.2000.1088},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/WuCT00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bioinformatics/Chao99,
author = {Kun{-}Mao Chao},
title = {Calign: aligning sequences with restricted affine gap penalties},
journal = {Bioinform.},
volume = {15},
number = {4},
pages = {298--304},
year = {1999},
url = {https://doi.org/10.1093/bioinformatics/15.4.298},
doi = {10.1093/BIOINFORMATICS/15.4.298},
timestamp = {Mon, 02 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/bioinformatics/Chao99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/WuCT99,
author = {Bang Ye Wu and
Kun{-}Mao Chao and
Chuan Yi Tang},
title = {An Efficient Algorithm for the Length-Constrained Heaviest Path Problem
on a Tree},
journal = {Inf. Process. Lett.},
volume = {69},
number = {2},
pages = {63--67},
year = {1999},
url = {https://doi.org/10.1016/S0020-0190(98)00194-X},
doi = {10.1016/S0020-0190(98)00194-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/WuCT99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/WuCT99,
author = {Bang Ye Wu and
Kun{-}Mao Chao and
Chuan Yi Tang},
title = {Approximation and Exact Algorithms for Constructing Minimum Ultrametric
Trees from Distance Matrices},
journal = {J. Comb. Optim.},
volume = {3},
number = {2-3},
pages = {199--211},
year = {1999},
url = {https://doi.org/10.1023/A:1009885610075},
doi = {10.1023/A:1009885610075},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/WuCT99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/WuLBCRT99,
author = {Bang Ye Wu and
Giuseppe Lancia and
Vineet Bafna and
Kun{-}Mao Chao and
R. Ravi and
Chuan Yi Tang},
title = {A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning
Trees},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {3},
pages = {761--778},
year = {1999},
url = {https://doi.org/10.1137/S009753979732253X},
doi = {10.1137/S009753979732253X},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/WuLBCRT99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/WuCT99,
author = {Bang Ye Wu and
Kun{-}Mao Chao and
Chuan Yi Tang},
editor = {Christoph Meinel and
Sophie Tison},
title = {Constructing Light Spanning Trees with Small Routing Cost},
booktitle = {{STACS} 99, 16th Annual Symposium on Theoretical Aspects of Computer
Science, Trier, Germany, March 4-6, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1563},
pages = {334--344},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-49116-3\_31},
doi = {10.1007/3-540-49116-3\_31},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/stacs/WuCT99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/WuCL98,
author = {Q. S. Wu and
Kun{-}Mao Chao and
Richard C. T. Lee},
title = {The NPO-Completeness of the Longest Hamiltonian Cycle Problem},
journal = {Inf. Process. Lett.},
volume = {65},
number = {3},
pages = {119--123},
year = {1998},
url = {https://doi.org/10.1016/S0020-0190(98)00003-9},
doi = {10.1016/S0020-0190(98)00003-9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/WuCL98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/isci/Chao98,
author = {Kun{-}Mao Chao},
title = {On Computing all Supoptimal Alignments},
journal = {Inf. Sci.},
volume = {105},
number = {1-4},
pages = {189--207},
year = {1998},
url = {https://doi.org/10.1016/S0020-0255(97)10032-9},
doi = {10.1016/S0020-0255(97)10032-9},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/isci/Chao98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/WuCT98,
author = {Bang Ye Wu and
Kun{-}Mao Chao and
Chuan Yi Tang},
editor = {Wen{-}Lian Hsu and
Ming{-}Yang Kao},
title = {Approximation and Exact Algorithms for Constructing Minimum Ultrametric
Trees from Distance Matrices},
booktitle = {Computing and Combinatorics, 4th Annual International Conference,
{COCOON} '98, Taipei, Taiwan, R.o.C., August 12-14, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1449},
pages = {299--308},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/3-540-68535-9\_34},
doi = {10.1007/3-540-68535-9\_34},
timestamp = {Tue, 14 May 2019 10:00:35 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/WuCT98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/WuCT98,
author = {Bang Ye Wu and
Kun{-}Mao Chao and
Chuan Yi Tang},
editor = {Kyung{-}Yong Chwa and
Oscar H. Ibarra},
title = {Approximation Algorithms for Some Optimum Communication Spanning Tree
Problems},
booktitle = {Algorithms and Computation, 9th International Symposium, {ISAAC} '98,
Taejon, Korea, December 14-16, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1533},
pages = {407--416},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/3-540-49381-6\_43},
doi = {10.1007/3-540-49381-6\_43},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/WuCT98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/WuLBCRT98,
author = {Bang Ye Wu and
Giuseppe Lancia and
Vineet Bafna and
Kun{-}Mao Chao and
R. Ravi and
Chuan Yi Tang},
editor = {Howard J. Karloff},
title = {A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning
Trees},
booktitle = {Proceedings of the Ninth Annual {ACM-SIAM} Symposium on Discrete Algorithms,
25-27 January 1998, San Francisco, California, {USA}},
pages = {21--32},
publisher = {{ACM/SIAM}},
year = {1998},
url = {http://dl.acm.org/citation.cfm?id=314613.314628},
timestamp = {Thu, 05 Jul 2018 07:29:49 +0200},
biburl = {https://dblp.org/rec/conf/soda/WuLBCRT98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bioinformatics/ChaoZOM97,
author = {Kun{-}Mao Chao and
Jinghui Zhang and
James Ostell and
Webb Miller},
title = {A tool for aligning very similar {DNA} sequences},
journal = {Comput. Appl. Biosci.},
volume = {13},
number = {1},
pages = {75--80},
year = {1997},
url = {https://doi.org/10.1093/bioinformatics/13.1.75},
doi = {10.1093/BIOINFORMATICS/13.1.75},
timestamp = {Fri, 15 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bioinformatics/ChaoZOM97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/Chao97,
author = {Kun{-}Mao Chao},
editor = {Tao Jiang and
D. T. Lee},
title = {Fast Algorithms for Aligning Sequences with Restricted Affine Gap
Penalties},
booktitle = {Computing and Combinatorics, Third Annual International Conference,
{COCOON} '97, Shanghai, China, August 20-22, 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1276},
pages = {264--273},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/BFb0045093},
doi = {10.1007/BFB0045093},
timestamp = {Tue, 14 May 2019 10:00:35 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/Chao97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChaoM95,
author = {Kun{-}Mao Chao and
Webb Miller},
title = {Linear-Space Algorithms that Build Local Alignments from Fragments},
journal = {Algorithmica},
volume = {13},
number = {1/2},
pages = {106--134},
year = {1995},
url = {https://doi.org/10.1007/BF01188583},
doi = {10.1007/BF01188583},
timestamp = {Mon, 05 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ChaoM95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bioinformatics/ChaoZOM95,
author = {Kun{-}Mao Chao and
Jinghui Zhang and
James Ostell and
Webb Miller},
title = {A local alignment tool for very long {DNA} sequences},
journal = {Comput. Appl. Biosci.},
volume = {11},
number = {2},
pages = {147--153},
year = {1995},
url = {https://doi.org/10.1093/bioinformatics/11.2.147},
doi = {10.1093/BIOINFORMATICS/11.2.147},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bioinformatics/ChaoZOM95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcb/ChaoHM94,
author = {Kun{-}Mao Chao and
Ross C. Hardison and
Webb Miller},
title = {Recent Developments in Linear-Space Alignment Methods: {A} Survey},
journal = {J. Comput. Biol.},
volume = {1},
number = {4},
pages = {271--291},
year = {1994},
url = {https://doi.org/10.1089/cmb.1994.1.271},
doi = {10.1089/CMB.1994.1.271},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcb/ChaoHM94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/Chao94,
author = {Kun{-}Mao Chao},
editor = {Maxime Crochemore and
Dan Gusfield},
title = {Computing all Suboptimal Alignments in Linear Space},
booktitle = {Combinatorial Pattern Matching, 5th Annual Symposium, {CPM} 94, Asilomar,
California, USA, June 5-8, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {807},
pages = {31--42},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-58094-8\_3},
doi = {10.1007/3-540-58094-8\_3},
timestamp = {Tue, 14 May 2019 10:00:38 +0200},
biburl = {https://dblp.org/rec/conf/cpm/Chao94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bioinformatics/ChaoHM93,
author = {Kun{-}Mao Chao and
Ross C. Hardison and
Webb Miller},
title = {Locating well-conserved regions within a pairwise alignment},
journal = {Comput. Appl. Biosci.},
volume = {9},
number = {4},
pages = {387--396},
year = {1993},
url = {https://doi.org/10.1093/bioinformatics/9.4.387},
doi = {10.1093/BIOINFORMATICS/9.4.387},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bioinformatics/ChaoHM93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bioinformatics/ChaoPM92,
author = {Kun{-}Mao Chao and
William R. Pearson and
Webb Miller},
title = {Aligning two sequences within a specified diagonal band},
journal = {Comput. Appl. Biosci.},
volume = {8},
number = {5},
pages = {481--487},
year = {1992},
url = {https://doi.org/10.1093/bioinformatics/8.5.481},
doi = {10.1093/BIOINFORMATICS/8.5.481},
timestamp = {Fri, 15 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bioinformatics/ChaoPM92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jise/ChangC90,
author = {Ruei{-}Chuan Chang and
Kun{-}Mao Chao},
title = {Parallel Operator-Precedence Parsing},
journal = {J. Inf. Sci. Eng.},
volume = {6},
number = {1},
pages = {51--61},
year = {1990},
url = {http://www.iis.sinica.edu.tw/page/jise/1990/199003\_04.html},
timestamp = {Fri, 16 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jise/ChangC90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-08-05 21:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
