¹êÅç«Çªáµ¶

* ¶P ...

* ¶P «Û½n ½«¯ô ³q¹L³Õ¤h½×¤å¤f¸Õ¡A¨ú±o³Õ¤h¾Ç¦ì¡F¶P §ÓùÚ ÔЧ± «É³Ó ³q¹LºÓ¤h½×¤å¤f¸Õ¡A¨ú±oºÓ¤h¾Ç¦ì¡C (June, 2015)

* ¶P ªK·s»P¤ýÂå®v ¥D¥´½×¤å¡§Mycobacterium Tuberculosis Nucleic Acid Amplification Tests Reduces Nosocomial Tuberculosis Exposure in Intensive Care Units: a Nationwide Cohort Study¡¨Àò Respirology ´Á¥Z¿ý¥Î¡C (June, 2015)

* ¶P «Û½n ½«¯ô ³q¹L±Mªù¾Ç¬ì¼f¬d (³Õ¤h½×¤å­pµe¼f¬d)¡C (January, 2015)

* ¶P ½«¯ô «Û½n ¥°­Û »¯¦Ñ ½×¤å¡§Forming Plurality at Minimum Cost¡¨Àò The 9th International Workshop on Algorithms and Computation (WALCOM 2015)±µ¨ü¡A©ó2015¦~2¤ëµoªí¡C (December, 2014) Lecture Notes in Computer Science

* ¶P ®aºa¡BTamura®v¡BAkutsu®v¡B»¯¦Ñ ½×¤å, ¡§A Fixed-Parameter Algorithm for Detecting a Singleton Attractor in an AND/OR Boolean Network with Bounded Treewidth Date of Evaluation,¡¨Àò IEICE Transactions on Fundamentals ±µ¨üµoªí¡C (Sept., 2014)

* ¶P ªK·s»P¤ýÂå®v ¥D¥´½×¤å¡§Optimal Duration of Anti-tuberculosis Treatment in Diabetic Patients: Nine or Six months?¡¨Àò CHEST ´Á¥Z¿ý¥Î¡C (Sept., 2014)

* ¶P ®aºa¡B³¯Âå®v¡B·¨Âå®v¡B»¯¦Ñ ½×¤å, ¡§A Fault-tolerant Method for HLA Typing with PacBio Data,¡¨Àò BMC Bioinformatics ±µ¨üµoªí¡C (August, 2014)

* ¶P «Û½n ½«¯ô ¥°­Û »¯¦Ñ ½×¤å¡§The Generalized Popular Condensation Problem¡¨Àò The 25th Annual Symposium on Algorithms and Computation (ISAAC 2014)±µ¨ü¡A©ó2014¦~12¤ë¦b Áú°êµoªí¡C (August, 2014) Lecture Notes in Computer Science

* ¶P ®aºa ³q¹L³Õ¤h½×¤å¤f¸Õ¡A¨ú±o³Õ¤h¾Ç¦ì¡F¶P ©ú°¶ °öÞ± ³q¹LºÓ¤h½×¤å¤f¸Õ¡A¨ú±oºÓ¤h¾Ç¦ì¡C (June, 2014)

* ¶P ®e¥ô ¶®´f®v »¯¦Ñ ½×¤å ¡§Locating Valid SLCAs for XML Keyword Search with NOT Semantics¡¨Àò ACM SIGMOD Record ´Á¥Z±µ¨üµoªí¡C (April, 2014)

* ¶P «Û½n ½«¯ô ¥°­Û »¯¦Ñ ½×¤å¡§Computing Plurality Points and Condorcet Points in Euclidean Space¡¨Àò The 24th Annual Symposium on Algorithms and Computation (ISAAC 2013)±µ¨ü¡A©ó2013¦~12¤ë¦b­»´äµoªí¡C (August, 2013) Lecture Notes in Computer Science

Lecture: I  II  III  IV  V  VI  VII  VIII

Leisure: I  II  III  IV  V  VI  VII  VIII  IX  X  XI  XII  XIII  XIV  XV  XVI  XVII  XVIII  XIX

Food: I  II  III  IV  V  VI  VII  VIII  IX  X  XI  XII

Selfie: I  II  III

Misc: I  II  III  IV  VI

* ¶P ªK·s ½×¤å¡§Urinary Tuberculosis Is Associated with the Development of Urothelial Carcinoma but Not Renal Cell Carcinoma: A Nationwide Cohort Study in Taiwan¡¨Àò British Journal of Cancer ´Á¥Z¿ý¥Î¡C (August 14, 2013)

* ¶P ªK·s ³q¹L³Õ¤h½×¤å¤f¸Õ¡A¨ú±o³Õ¤h¾Ç¦ì¡C (July 31, 2013)

* ¶P ¥î¶© ³q¹L³Õ¤h½×¤å¤f¸Õ¡A¨ú±o³Õ¤h¾Ç¦ì¡F¶P Îr±á ©v¼ç ³q¹LºÓ¤h½×¤å¤f¸Õ¡A¨ú±oºÓ¤h¾Ç¦ì¡CI II  III IV (June, 2013)

* ¶P ªK·s ¥D¥´½×¤å¡§Risk Factors for Pulmonary Tuberculosis in Patients with Chronic Obstructive Airway Disease in Taiwan: A Nationwide Cohort Study¡¨Àò BMC Infectious Diseases ´Á¥Z¿ý¥Î¡C (May, 2013) [featured in MDLinx http://www.mdlinx.com/pulmonology/news-article.cfm/4599558]

* ¶P «Û½n ½«¯ô ¥°­Û »¯¦Ñ ½×¤å¡§An Optimal Algorithm for the Popular Condensation Problem¡¨Àò International Workshop on Combinatorial Algorithms (IWOCA 2013) ±µ¨üµoªí¡C (April, 2013) Lecture Notes in Computer Science

* ¶P ¥î¶© ³q¹L±Mªù¾Ç¬ì¼f¬d (³Õ¤h½×¤å­pµe¼f¬d)¡C (January 15, 2013)

* ¶P ªK·s ³q¹L±Mªù¾Ç¬ì¼f¬d (³Õ¤h½×¤å­pµe¼f¬d)¡C (January 9, 2013)

* ¶P ®e¥ô ¶®´f®v »¯¦Ñ ½×¤å¡§A Compact and Efficient Labeling Scheme for XML Documents¡¨Àò The 18th International Conference on Database Systems for Advanced Applications (DASFAA 2013)±µ¨üµoªí¡C (Dec., 2012±µ¨ü; April, 2013µoªí) Lecture Notes in Computer Science

* ¶P ACB ¶êº¡§¹¦¨ ISAAC 2012¡C(Dec., 2012) Lecture Notes in Computer Science

* ¶P ¦w±j ¨¹¤@®v »¯¦Ñ ½×¤å¡§A Linear-time Algorithm for Finding an Edge-partition with Max-min Ratio at Most Two¡¨Àò Discrete Applied Mathematics ´Á¥Z¿ý¥Î¡C (Nov., 2012)

* ¶P ªÃ¸t ³q¹L¸ê°T¤uµ{¨t³Õ¤h¯Z¸ê®æ¦Ò¸Õ¡C(Oct., 2012) I (This party was supported by ªÃ¸t.) II

* ¶P ¥î¶© ¥D¥´½×¤å¡§In-silico Drug Screening and Potential Target Identification for Hepatocellular Carcinoma Using Support Vector Machine Based on Prior Screening Result¡¨Àò The 23rd International Conference on Genome Informatics (GIW 2012) ±µ¨üµoªí¡A¨Ã©óGeneªº¯S¥Z¤¤µn¥X¡C (Oct., 2012)

* ¶P Matthias Bernt, Kun-Mao Chao, Jyun-Wei Kao, Martin Middendorf and Eric Tannier ½×¤å¡§Preserving Inversion Phylogeny Reconstruction¡¨Àò 12th Workshop on Algorithms in Bioinformatics (WABI 2012)±µ¨üµoªí¡C(June, 2012) Lecture Notes in Bioinformatics (a subseries of Lecture Notes in Computer Science)

* ¶P ¦w±j ³q¹L³Õ¤h½×¤å¤f¸Õ¡A¨ú±o³Õ¤h¾Ç¦ì¡F¶P Ú¬¤§ ³q¹LºÓ¤h½×¤å¤f¸Õ¡A¨ú±oºÓ¤h¾Ç¦ì¡F¶P¤»¤ë¥i³ß¥i¶P¤§¨Æ¡C (June, 2012) I  II  III  IV (by ðç»ö & ½«¯ô)

* ¶P 讧g ³q¹L¥ÍÂå¹q¸ê©Ò¸ê®æ¦Ò¸Õ¡C (June, 2012)

* ¶P ªK·s ¥D¥´½×¤å ¡§Pulmonary Tuberculosis and Delay in Anti-tuberculous Treatment are Important Risk Factors for Chronic Obstructive Pulmonary Disease¡¨Àò PLoS ONE ´Á¥Z¿ý¥Î¡C (May, 2012)

* ¶P ¦w±j ¥D¥´½×¤å ¡§Asymptotic Limits of a New Type of Maximization Recurrence with an Application to Bioinformatics¡¨ÀòThe 9th Annual Conference on Theory and Applications of Models of Computation (TAMC 2012) ±µ¨üµoªí¡C (April, 2012) Lecture Notes in Computer Science

* ¶P ®aºa »¯¦Ñ ½×¤å ¡§Efficient Algorithms for Local Ranking¡¨Àò Information Processing Letters ´Á¥Z¿ý¥Î¡C (April, 2012)

* ¶P «a¦t ªÃ¼z »¯¦Ñ ½×¤å ¡§Identifying Approximate Palindromes in Run-Length Encoded Strings¡¨Àò Theoretical Computer Science ´Á¥Z¿ý¥Î¡C (January, 2012)

* ¶P ¦w±j ³q¹L±Mªù¾Ç¬ì¼f¬d (³Õ¤h½×¤å­pµe¼f¬d)¡C (January, 2012)

* ¶P ¥î¶© ¦@¥´½×¤å ¡§Gene Expression-Based Chemical Genomics Identifies Potential Therapeutic Drugs in Hepatocellular Carcinoma¡¨Àò PLoS ONE ´Á¥Z±µ¨üµoªí¡C (October, 2011)

* ¶P «a¦t »¯¦Ñ ½×¤å¡§A Fully Compressed Algorithm for Computing the Edit Distance of Run-Length Encoded Strings¡¨Àò Algorithmica ´Á¥Z±µ¨üµoªí¡C (October, 2011)

* ¶P ªK·s ¥D¥´½×¤å¡§Influence of Pressure Control Levels on the Pulse Pressure Variations¡¨Àò Shock ´Á¥Z±µ¨üµoªí¡C (August, 2011)

* ¶P ®e¥ô ³q¹L³Õ¤h½×¤å¤f¸Õ¡A¨ú±o³Õ¤h¾Ç¦ì¡F®m°¶ ¸tÄ£ ³q¹LºÓ¤h½×¤å¤f¸Õ¡A¨ú±oºÓ¤h¾Ç¦ì¡C (June, 2011)  I  II  III

* ¶P ªK·s ³q¹L¥ÍÂå¹q¸ê©Ò¸ê®æ¦Ò¸Õ¡C (June, 2011)

* ¶P ®e¥ô ¶®´f®v »¯¦Ñ ½×¤å ¡§Improving the Performance of Identifying Contributors for XML Keyword Search¡¨Àò ACM SIGMOD Record ´Á¥Z±µ¨üµoªí¡C (April, 2011)

* ¶P Ä£§Ê ®aºa »¯¦Ñ ½×¤å ¡§The Extent of Linkage Disequilibrium and Computational Challenges of Single Nucleotide Polymorphisms in Genome-Wide Association Studies¡¨Àò Current Drug Metabolism ´Á¥Z±µ¨üµoªí¡C (April, 2011)

* ¶P ®e¥ô ¶®´f®v »¯¦Ñ ½×¤å ¡§Identifying Relevant Matches with NOT Semantics over XML Documents¡¨Àò The 16th International Conference on Database Systems for Advanced Applications (DASFAA 2011)±µ¨üµoªí¡C (April, 2011) Lecture Notes in Computer Science

* ¶P «Û½n ³¯µb ³q¹L³Õ¤h¯Z¸ê®æ¦Ò¸Õ¡C(March, 2011)  I  II  III

* ¶P ®e¥ô ³q¹L±Mªù¾Ç¬ì¼f¬d (³Õ¤h½×¤å­pµe¼f¬d)¡C (Jan, 2011)

* ¶P «a¦t ªÃ¼z ³q¹L³Õ¤h½×¤å¤f¸Õ¡A¨ú±o³Õ¤h¾Ç¦ì¡C (Jan., 2011)

I (by An-Chiang)  ACB Ph.D.'s

* ¶P ®aºa ½«¯ô ³q¹L³Õ¤h¯Z¸ê®æ¦Ò¸Õ¡C(Oct., 2010)

* ¶P ¥¿°¶ ®Ä­¸ Ë¢¦w »¯¦Ñ ½×¤å ¡§Minkowski Sum Selection and Finding¡¨ Àò International Journal of Computational Geometry and Applications ±µ¨ü¡C (An invited paper for the special issue of IJCGA for ISAAC 2008) (Oct., 2010)

* Matthias's Farewell Party (+ Martin & Lani): I  II (Sept., 2010)

* ¶P «a¦t ªÃ¼z »¯¦Ñ ½×¤å ¡§Identifying Approximate Palindromes in Run-Length Encoded Strings¡¨ Àò The 21th Annual Symposium on Algorithms and Computation (ISAAC 2010)±µ¨üµoªí¡C (8/2010±µ¨ü¡F12/2010©óÁú°êµoªí) Lecture Notes in Computer Science

* ¶P ©ÉÀR ©ú¦¿ ¥¿°¶ ³q¹L³Õ¤h½×¤å¤f¸Õ¡A¨ú±o³Õ¤h¾Ç¦ì¡F¬îªå ¸X¿o ³q¹LºÓ¤h½×¤å¤f¸Õ¡A¨ú±oºÓ¤h¾Ç¦ì¡C (July 2010)

I  II  III  Acknowledgements

* ¶P «a¦t ªÃ¼z ³q¹L±Mªù¾Ç¬ì¼f¬d(³Õ¤h½×¤å­pµe¼f¬d)¡C (July, 2010)

* ¶P «a¦t »¯¦Ñ ½×¤å ¡§A Fully Compressed Algorithm for Computing the Edit Distance of Run-Length Encoded Strings¡¨ Àò The 18th Annual European Symposium on Algorithms (ESA 2010)±µ¨üµoªí¡C (6/2010±µ¨ü¡F9/2010©ó­^°êµoªí) Lecture Notes in Computer Science

I  II  III  IV  V  VI  VII  VIII  IX  X  XI  XII  XIII  XIV  XV  XVI  XVII  XVIII  XIX  XX  XXI

* ¶P ®e¥ô ¶®´f®v »¯¦Ñ ½×¤å ¡§Faster Algorithms for Searching Relevant Matches in XML Databases¡¨ Àò The 21st International Conference on Database and Expert Systems Applications (DEXA 2010) ±µ¨üµoªí¡C (5/2010±µ¨ü¡F8/2010©ó¦è¯Z¤úµoªí) Lecture Notes in Computer Science

I  II  III  IV  V  VI  VII  VIII

* ¶P ¦w±j ¨¹¤@®v ¥°­Û »¯¦Ñ ½×¤å ¡§A Tight Bound on the Min-Ratio Edge-Partitioning Problem of a Tree¡¨ Àò Discrete Applied Mathematics´Á¥Z±µ¨üµoªí¡C(May, 2010)

* ¶P ©ÉÀR ½×¤å¡§Algorithms for the Hybrid Constrained Longest Common Subsequence Problem¡¨ ÀòThe 27th Workshop on Combinatorial Math and Computation Theory³Ì¨Î½×¤å¼ú¡C (May 1, 2010)

* ¶P «a¦t ªÃ¼z »¯¦Ñ ½×¤å ¡§Hardness of Comparing Two Run-Length Encoded Strings¡¨ Àò Journal of Complexity´Á¥Z±µ¨üµoªí¡C(March, 2010)

* ¶P ©ú¦¿¡B©ÉÀR¡B¥¿°¶ ³q¹L±Mªù¾Ç¬ì¼f¬d(³Õ¤h½×¤å­pµe¼f¬d)¡C (Jan., 2010)

* ¶P ªÃ¼z «a¦t »¯¦Ñ ½×¤å ¡§Finding All Approximate Gapped Palindromes¡¨ Àò The 20th Annual Symposium on Algorithms and Computation (ISAAC 2009)±µ¨üµoªí¡C (12/2009©ó®L«Â¦iµoªí) Lecture Notes in Computer Science

* Prof Pavel Pevzner's visit (Nov. 8-10, 2009)

* ¶P ¦ö¥ô³q¹L³Õ¤h¯Z¸ê®æ¦Ò¸Õ¡C(2009)

*  ¶P ©ÉÀR »¯¦Ñ ½×¤å ¡§On the Generalized Constrained Longest Common Subsequence Problems¡¨ Àò Journal of Combinatorial Optimization´Á¥Z±µ¨üµoªí¡C (Aug., 2009)

* ¶P ©sÁú ­³ÀM ³q¹LºÓ¤h½×¤å¤f¸Õ¡A¨ú±oºÓ¤h¾Ç¦ì¡C (July 2009)

* ¶P ¥¿°¶ ©ú¦¿ ©ÉÀR ¥î¶© ®Ä­¸ »¯¦Ñ ½×¤å ¡§Linear-Time Algorithms for the Multiple Gene Duplication Problems¡¨ Àò IEEE/ACM Transactions on Computational Biology and Bioinformatics ´Á¥Z±µ¨üµoªí¡C (May 8, 2009)

* ¶P «a¦t ªÃ¼z »¯¦Ñ ½×¤å ¡§Approximate Matching for Run-Length Encoded Strings is 3Sum-Hard¡¨ Àò The 20th Annual Symposium on Combinatorial Pattern Matching (CPM'09)±µ¨üµoªí¡C (3/10/2009³q¹L; 6/22-24/2009©óªk°êµoªí) Lecture Notes in Computer Science

* ¶P Matthias ©ú¦¿ Daniel ¥°­Û »¯¦Ñ Martin®v ½×¤å ¡§Finding All Sorting Tandem Duplication Random Loss Operations¡¨ Àò The 20th Annual Symposium on Combinatorial Pattern Matching (CPM'09)±µ¨üµoªí¡C (3/10/2009³q¹L; 6/22-24/2009©óªk°êµoªí) Lecture Notes in Computer Science

* ¶P ºµ°·®v ©ú¦¿ »¯¦Ñ ½×¤å ¡§Securing Information Display for Multiple Secrets¡¨ Àò Optical Engineering´Á¥Z±µ¨üµoªí¡C(March, 2009)

* Prof Steven Skiena's visit (Dec. 12, 2008)

* ¶P ®e¥ô ¥î¶© ³q¹L³Õ¤h¯Z¸ê®æ¦Ò©Ò¦³¬ì¥Ø¡C (Oct., 2008)  I

* ¶P Ë¢¦w ®Ä­¸ »¯¦Ñ ½×¤å ¡§CNVDetector: locating copy number variations using array CGH data¡¨ Àò Bioinformatics ´Á¥Z±µ¨üµoªí¡C(October 4, 2008)

* ¶P ´¼Ãh ®Ä­¸ »¯¦Ñ ½×¤å ¡§Optimal Algorithms for the Average-Constrained Maximum-Sum Segment Problem¡¨Àò Information Processing Letters ´Á¥Z¿ý¥Î¡C (September 18, 2008)

* ¶P ¥¿°¶ ®Ä­¸ Ë¢¦w »¯¦Ñ ½×¤å ¡§Minkowski Sum Selection and Finding¡¨ Àò The 19th Annual Symposium on Algorithms and Computation (ISAAC 2008)±µ¨üµoªí¡C (8/18/2008³q¹L; 12/15-17/2008©ó¿D¬wµoªí) Lecture Notes in Computer Science

* ¶P ¥°­Û »¯¦Ñ ½×¤å ¡§The 2-radius and 2-radiian Problems on Trees¡¨Àò Theoretical Computer Science ´Á¥Z¿ý¥Î¡C (August 10, 2008)

* ¶P ®Ä­¸ »¯¦Ñ ½×¤å ¡§Algorithms for Finding the Weight-Constrained k Longest Paths in a Tree and the Length-Constrained k Maximum-Sum Segments of a Sequence¡¨Àò Theoretical Computer Science ´Á¥Z¿ý¥Î¡C (June 28, 2008)

* ¶P ´¼ÅM ­³¥õ ·Ô¼Ì ®Ëâü ³q¹LºÓ¤h½×¤å¤f¸Õ¡A¨ú±oºÓ¤h¾Ç¦ì¡C (June 26, 2008)

* ¶P ¥°­Û ³q¹L³Õ¤h½×¤å¤f¸Õ¡A¨ú±o³Õ¤h¾Ç¦ì¡C (June 26, 2008)

* ¶P ¤@°a ±qStanford²¦·~¡C (June 15, 2008) ¤@°a¡B´­©M¥þÂS¥´·Ó

* ¶P ¨Îº· ³q¹L±Mªù¾Ç¬ì¼f¬d(³Õ¤h½×¤å­pµe¼f¬d)¡C (June 10, 2008)

* ¶P Ë¢¦w ³q¹LºÓ¤h½×¤å¤f¸Õ¡A¨ú±oºÓ¤h¾Ç¦ì¡C (May 27, 2008)

* ¶P ®Ä­¸ ³q¹L³Õ¤h½×¤å¤f¸Õ¡A¨ú±o³Õ¤h¾Ç¦ì¡C (May 27, 2008)

* ¶P¨Îº· et al. ½×¤å ¡§PhosphoPOINT: a comprehensive human kinase interactome and phospho-protein database¡¨Àò ECCB ¿ý¥Î¡C(April, 2008)

* ¶P ®Ä­¸¡B¥°­Û¡B¥¿°¶¡B©ÉÀR¡B¤@°a¡BË¢¦w©ó 25th Workshop on Combinatorial Math and Computation Theory (¤¤µØ¤j¾Ç) µoªí¤T½g¬ã¨s½×¤å¡C (April, 2008)   ¤Q¤GºØ¥´À»«º¶Õ  ¤d·³·Ý¨Ó¤F

* ¶P Ä£§Ê »¯¦Ñ ½×¤å¡§A New Framework for the Selection of Tag SNPs by Multimarker Haplotypes¡¨Àò Journal of Biomedical Informatics ´Á¥Z¿ý¥Î¡C (April 4, 2008)

* ¶P¬K©u¯Z «ÓªB ðç»ö ³q¹LºÓ¤h½×¤å¤f¸Õ¡A¨ú±oºÓ¤h¾Ç¦ì ¡C (January 29, 2008)

* ¶P ¥°­Û ³q¹L±Mªù¾Ç¬ì¼f¬d(³Õ¤h½×¤å­pµe¼f¬d)¡C (January 17, 2008)

* ¶P ®Ä­¸ ³q¹L±Mªù¾Ç¬ì¼f¬d(³Õ¤h½×¤å­pµe¼f¬d)¡C (January 2, 2008)

* ¶P ®Ä­¸ »¯¦Ñ ½×¤å ¡§On Locating Disjoint Segments with Maximum Sum of Densities¡¨Àò Algorithmica ´Á¥Z¿ý¥Î ¡C (October 31, 2007)

* ¶P ¨Îº· ºaÀò¡u2007¦~¥xÆW¥Íª«¸ê°T»P¨t²Î¥Íª«¾Ç¬ã°Q·|¡v½×¤åºtÁ¿ÄvÁɨȭx¡A³ø§iÃD¥Ø¬°"PhosphoPOINT: a comprehensive human kinase interactome and phosphoprotein database"¡C(September 4, 2007)

* ¶P ®Ä­¸ »¯¦Ñ ½×¤å ¡§A Tight Analysis of the Katriel-Bodlaender Algorithm for Online Topological Ordering¡¨Àò Theoretical Computer Science ´Á¥Z¿ý¥Î¡C (August 28, 2007)

* ¶P ®Ä­¸ Ë¢¦w »¯¦Ñ ½×¤å ¡§Algorithms for Computing the Length-Constrained Max-Score Segments with Applications to DNA Copy Number Data Analysis¡¨ Àò The 18th Annual Symposium on Algorithms and Computation (ISAAC 2007)±µ¨üµoªí¡C (8/20/2007³q¹L; 12/18-20/2007©ó¤é¥»µoªí) Lecture Notes in Computer Science
            I  II  III  IV  V  VI  VII  VIII  IX  X  XI

* ¶P «Ø§¡ ³q¹LºÓ¤h½×¤å¤f¸Õ¡A¨ú±oºÓ¤h¾Ç¦ì ¡C (June 2007)

* ¶P «a¦t »¯¦Ñ ½×¤å "On the Range Maximum-Sum Segment Query Problem" Àò Discrete Applied Mathematics ´Á¥Z¿ý¥Î¡C (May 15, 2007)

* ¶P ¥°­Û ¨¹¤@®v »¯¦Ñ ½×¤å "A Linear Time Algorithm for the Backup 2-Center Problem on a Tree" ©ó24th Workshop on Combinatorial Math and Computation Theory (º[«n¤j¾Ç) µoªí ¡C (April, 2007)
            I  II  III

* ¶P ©ÉÀR ªÃ¼z ³q¹L³Õ¤h¯Z¸ê®æ¦Ò©Ò¦³¬ì¥Ø¡C (March, 2007)
        Party  I  II  III

* ¶P ¨¹¤@®v ¥°­Û »¯¦Ñ ½×¤å "On the uniform edge-partition of a tree" Àò Discrete Applied Mathematics ´Á¥Z¿ý¥Î¡C (Oct. 2, 2006)

* ¶P ®Ä­¸ »¯¦Ñ ½×¤å "On Locating Disjoint Segments with Maximum Sum of Densities" Àò The 17th Annual Symposium on Algorithms and Computation (ISAAC 2006)±µ¨üµoªí¡C (8/21/2006³q¹L; 12/18-20/2006©ó¦L«×µoªí) Lecture Notes in Computer Science

* ¶P ¨¹¤@®v §Ó亘 »¯¦Ñ ½×¤å "The swap edges of a multiple-sources routing tree" Àò Algorithmica ´Á¥Z¿ý¥Î¡C (June 23, 2006)

* ²¦·~·P¨¥¡B¼y¥\®b¡B¼y¥Í®b (June, 2006)
        Words  Ä£§Ê  ´¼Ãh  ®aºa  Ä£§Ê  ¨Îº·  (»¯¦Ñ 5  4  3)
        Party I  II  III  IV  V  VI  VII  VIII  IX  X  XI
        Ä£§Ê²¦·~¨å§­PÃã  ¤Ó¯«¤F:-)
        Thanks_forever_execution_file_by_czone (Copyright: Ä£§Ê)
        Ä£§Êªº¤@½gºô¸ô¤p»¡ & »¯¦ÑŪ«á·P

* ¶P ´¼Ãh «a¦t ¤åÀA »¯¦Ñ ½×¤å "Improved Algorithms for the k Maximum-Sums Problems" Àò Theoretical Computer Science´Á¥Z¿ý¥Î¡C (June 1, 2006)

* ¶P Ä£§Ê ³q¹L³Õ¤h½×¤å¤f¸Õ¡A¨ú±o³Õ¤h¾Ç¦ì¡C (May 29, 2006)

* ¶P ´¼Ãh ®aºa ³q¹LºÓ¤h½×¤å¤f¸Õ¡A¨ú±oºÓ¤h¾Ç¦ì¡C (May 26, 2006)

* ¶P ¤@°a Àò Stanford¡BCornell¡BUCLA¤ÎYaleµ¥®ÕCSªº¤J¾Ç³\¥i¤Î¦h¶µ¼ú¾Çª÷¡F¶P ¹D¤Í ¯EâW(¶§©úÂå¬ì) ÀòPrinceton ªºMath.³Õ¤h¯Z¥þÃB¼ú¾Çª÷¡C(March, 2006)

* ¶P ©ú¦¿¡B«a¦t³q¹L³Õ¤h¯Z¸ê®æ¦Ò©Ò¦³¬ì¥Ø¡C (March, 2006)
        Party I  II  III  IV

* ¶P ¥¿°¶ ª½§ð³Õ¤h (Feb., 2006) ¥¿°¶ªº³ß°T

* ¶P ®aºa Ä£§Ê »¯¦Ñ ½×¤å "A Greedier Approach for Finding Tag SNPs" Àò Bioinformatics´Á¥Z¿ý¥Î¡C (Dec. 30, 2005) (Not a bad thing to say good bye to 2005 with this. ^_^)

* ¶P Ä£§Ê ³q¹L³Õ¤h½×¤å­pµe¼f¬d¡C (Dec. 27, 2005)

* ¶P Ä£§Ê Kui Zhang®v(U. of Alabama) Tim Ting Chen®v(USC) »¯¦Ñ ½×¤å "Selecting additional tag SNPs for tolerating missing data in genotyping" Àò BMC Bioinformatics´Á¥Z¿ý¥Î¡C (Nov. 1, 2005)

* ¶P ¨Îº·¡B®Ä­¸¡B¥°­Û¡B¥¿°¶³q¹L³Õ¤h¯Z¸ê®æ¦Ò©Ò¦³¬ì¥Ø¡C (Oct., 2005)
        Party I  II  III  IV  V

* ¶P ´¼Ãh «a¦t ¤åÀA »¯¦Ñ ½×¤å "Improved Algorithms for the k Maximum-Sums Problems" Àò The 16th Annual Symposium on Algorithms and Computation (ISAAC 2005)±µ¨üµoªí¡C (8/19/2005³q¹L; 12/19-21/2005©ó®ü«n®qµoªí) Lecture Notes in Computer Science

        ¥þ÷Ò¥´·Ó  ´¼Ãh²Ä¤@¦¸·fªº­¸¾÷  ¥þÅé¦X·Ó  §A¦Y¦×  §Ú¦YÄÑ

        ¥xÆW¦P¦æ¤@+´_¥¹¦¶¦Ñ®v  ¥xÆW¦P¦æ¤G  ¥xÆW¦P¦æ¤T+¾¤±Ú¦P­M

        «a¦t & ´¼Ãh ­»´ä¦Ò¹î    ¤f»¯ (»¯¦Ñ¦h¼L¡H«D¤]¡A¦¹¦r¤D"¼LÄZ"©Î"°Ù"ªº·N«ä)

* ¶P «a¦t »¯¦Ñ ½×¤å "Optimal Algorithms for Locating the Longest and Shortest Segments Satisfying a Sum or an Average Constraint" Àò Information Processing Letters ´Á¥Z¿ý¥Î¡C (7/29/2005)

* ¶P «a¦t §Ó亘 ¤åÀA ³q¹LºÓ¤h½×¤å¤f¸Õ¡A¨ú±oºÓ¤h¾Ç¦ì¡C (June 2005)

* ¶P Ä£§Ê Tim Ting Chen®v(USC) »¯¦Ñ ½×¤å "An Approximation Algorithm for Haplotype Inference by Maximum Parsimony" Àò Journal of Computational Biology ´Á¥Z¿ý¥Î¡C (5/27/2005)

* ¶P¨¹¤@®v §Ó亘 »¯¦Ñ ©ó 22th Workshop on Combinatorial Math and Computation Theory µoªí½×¤å "The swap edges of a multiple source routing tree", ¦¨¤j¡C (5/21/2005)

* ¶P Ä£§Ê Tim Ting Chen®v(USC) »¯¦Ñ ½×¤å "An Approximation Algorithm for Haplotype Inference by Maximum Parsimony" Àò The 20th Annual ACM Symposium on Applied Computing (SAC 2005) ±µ¨üµoªí¡C (10/15/2004³q¹L; 3/17-20, 2005©ó¬ü°ê Santa Feµoªí)

    ¥þ÷Ò¥´·Ó   ¤¤°êÀ¸°|   ³·´º¤@  ³·´º¤G  À\·|¤@  À\·|¤G  ¥©¹J³¢±Ð±Â

* ¶P ®Ä­¸ ¥°­Û ª½§ð³Õ¤h¡C (8/20/2004)

* ¶P ¤@°a «Ø»« »¯¦Ñ ½×¤å "A Fast Algorithm for Computing a Longest Common Increasing Subsequence" Àò Information Processing Letters´Á¥Z¿ý¥Î¡C (8/10/2004)

* ¶P ®e¥ô ¤p¶¯(NTUEE) »¯¦Ñ½×¤å "Finding a Length-Constrained Maximum-Density Path in a Tree" Àò Journal of Combinatorial Optimization´Á¥Z¿ý¥Î¡C (8/3/2004)

* ¶P «a¦t »¯¦Ñ ½×¤å"On the Range Maximum-Sum Segment Query Problem" Àò The 15th Annual Symposium on Algorithms and Computation (ISAAC 2004)±µ¨üµoªí¡C (7/25/2004³q¹L; December 22-24©óHong Kongµoªí) Lecture Notes in Computer Science

        ¥þ÷Ò¥´·Ó   ­»¦¿¸t½Ï¾ð  email¤pÂIºw

* ¶P ®e¥ô ©ø©y ³q¹LºÓ¤h½×¤å¤f¸Õ¡A¨ú±oºÓ¤h¾Ç¦ì (6/23/2004)

        ®e¥ôªº¯d¨¥  ©ø©yªº¯d¨¥

* ¶P Ä£§Ê Kui Zhang®v(U. of Alabama) Tim Ting Chen®v(USC) »¯¦Ñ ½×¤å "Approximation Algorithms for the Selection of Robust Tag SNPs" Àò 4th Workshop on Algorithms in Bioinformatics (WABI 2004)±µ¨üµoªí¡C (June, 2004³q¹L; September 14 - 17, 2004 ©óBergen, Norway µoªí) Lecture Notes in Bioinformatics (a subseries of Lecture Notes in Computer Science)

        ©MJerome, Behshad¦X·Ó
        Oslo_1 & Oslo_2
        Fjord_1 & Fjord_2 & Fjord_3
        Bergen

* ¶P «a¦t »¯¦Ñ  ©ó 21th Workshop on Combinatorial Math and Computation Theory µoªí½×¤å "An Optimal Algorithm for the Range Maximum-Sum Segment Query Problem"¡C (©ó¥x¤¤; 5/22/2004)

* ¶P ´¼Ãh ·q±j ®Ñ·ì »¯¦Ñ  ©ó 21th Workshop on Combinatorial Math and Computation Theory µoªí½×¤å "Efficient Algorithms for Some Variants of the Farthest String Problem"¡C (©ó¥x¤¤; 5/22/2004)

* ¶P Ä£§Ê »¯¦Ñ  ©ó 21th Workshop on Combinatorial Math and Computation Theory µoªí½×¤å "On the Selection of Robust Tag SNPs"¡C (©ó¥x¤¤; 5/22/2004)

* ¶P ¨¹¤@®v(¾ð¼w) ¥°­Û ¥@¹F(¾ð¼w) »¯¦Ñ  ©ó 21th Workshop on Combinatorial Math and Computation Theory µoªí½×¤å "On the uniform edge-partition of a tree"¡C (©ó¥x¤¤; 5/22/2004)

        ¥þ÷Ò¥´·Ó
        (¥ª°_: ´¼Ãh ·q±j ®Ñ·ì »¯¦Ñ ¥°­Û «a¦t)
        («a¦t´¤¿ù®±¤F:-) »¯¦Ñ¥H«e¤]¬O³o¼Ë´¤ªº ^_^)
        (¥i±¤Ä£§Ê §Ó«Å¦³¨Æ¥²¶·¥ý¨«, ¤U¦¸·Ó³á)

* ¶P ¥»¤Z¦P¾ÇÀò CMU ¤§ communication planning and information design program¤J¾Ç³\¥i¡C (May 2004)

* ¶P ¾å¬î®v (Iowa State) Liang Ye (Iowa State) ¼z½å®v (Iowa State) »P¥»¹êÅç«Ç¦P¾Ç ¤@°a »¯¦Ñ½×¤å "Efficient Combination of Multiple Word Models for Improved Sequence Comparison" Àò Bioinformatics ´Á¥Z¿ý¥Î¡C (April 2004)

* ¶P¥»¹êÅç«Ç ´­©M¦P¾Ç ¦Ò¨ú±Ð¨|³¡¤½¶O¯d¦Ò (¥Íª«¸ê°TÃþ§O)¡C (April 2004)

* ¶P¥»¹êÅç«Ç Ä£§Ê¦P¾Ç ³q¹L³Õ¤h¯Z¸ê®æ¦Ò¸Õ¡C (March 2004)

        Ä£§Ê¾Çªø½Ð¤j®a¦YPizza¡A¥L»¡­n¾ð¥ß"¦nªº¨å½d" ^_^

* ¶P¥»¹êÅç«Ç ¨Îº·¦P¾Ç Àò¥þ°ê¤j±M¬×¹B°Ê·|´åªa¤ñÁÉ¥|­±ª÷µP¤@­±»ÈµP (800¤Î1500¦Û¥Ñ¦¡¯}¤j·|)¡C (March 2004)

* ¶P¥»¹êÅç«Ç¹D¤Í ¦¶¬F¹D¦P¾Ç (¥æ¤j¸ê¬ì²¦) Àò Stanford CSªº¤J¾Ç³\¥i¡C (March 2004)

* ¶P¥»¹êÅç«Ç¦P¾Ç ®Ä­¸ ¶®´f®v (®ü¬v) »¯¦Ñ ½×¤å "An Optimal Algorithm for Querying Tree Structures and its Applications in Bioinformatics" Àò ACM SIGMOD Record ´Á¥Z¿ý¥Î¡C (March 2004)  

        ®Ä­¸»¡¥L«C¬K¤]¯d¶Â¤F

* ¶P¥»¹êÅç«Ç¦P¾Ç ¤@°a ²±¥Ý ´­©M Ä_¸©  Liang Ye (Iowa State) ¾å¬î®v (Iowa State) »¯¦Ñ ©ó IEEE BIBE 2004 µoªí½×¤å "Efficient Methods for Generating Optimal Single and Multiple Spaced Seeds"¡C (©ó¥x¤¤, 5/19-21, 2004)

        It's show time!
        ´­©M ¤@°a ¥þ÷Ò¥´¤ý¤W³õÅo~~~
        ©MLaurent Noe, ±i¬¥ªY¦X·Ó
        ¥»¹êÅç«ÇªºBody Logo
        (¥ª°_: »¯¦Ñ ´­©M ¤@°a Ä_¸©)
        (Ä_¸©¤]´¤¹ï³á, ¤y¹ö¤£ÅýŽ¬Ü!´­©M¥ÎÅb®±¥´°Ú?!)
        ¥©¹J°ê¤º±À¼s¥Íª«¸ê°T³Ì¤Oªº·¨¥Ã¥¿ (¤@°a, ¬Ý¿ù¬Û¾÷¤F ^_^)
        §Ú­ÌªºemailÂIºw

* ¶P¥»¹êÅç«Ç¦P¾Ç ®e¥ô »¯¦Ñ ½×¤å "Efficient Heuristic Algorithms for the Maximum Subarray" ÀòBulletin of College Engineering ´Á¥Z¿ý¥Î¡C (Feb. 2004)

* ¶P¥»¹êÅç«Ç¦P¾Ç ®e¥ô ¤p¶¯(NTUEE) »¯¦Ñ ©ó The 14th Annual International Symposium on Algorithms and Computation (ISAAC 2003) µoªí½×¤å "Finding a Length-Constrained Maximum-Density Path in a Tree"¡C (©ó¤é¥»¨Ê³£, 12/15/2003) Lecture Notes in Computer Science

	Right-Skew Decompositionªº³Ð©lªÌ ªL«¸»¯ (Oops!©ñ¿ù·Ó¤ù¤F!)
	Right-Skew Decompositionªº³Ð©lªÌ ªL«¸»¯ (³o±i¬O¯uªº¤F! more)
	ªL»¯«¸ªL (®e¥ô¡A¦¿¤s¥N¦³¤~¤H¥X¡I)
	®e¥ô»P»¯¦Ñ¡C 
	®e¥ôªº²Ä¤@¦¸­^»y³ø§i¡A¤@¯Å´Î¡C
	¥þ÷Ò¥´¡I»¯¦Ñ³o¦¸´¤¹ï®±¤F¡C
	¨Ê³£ªº¥j¨å(more and more (by YL))»P·s¼é¡C
	¯«¤á´ä¤f»PÀO­i®i¡C
	»¯¦Ñ»PÃÀ§²¡C

* ¶P¥»¹êÅç«Ç¦P¾Ç ¤@°a «Ø»« »¯¦Ñ ©ó 20th Workshop on Combinatorial Math and Computation Theory µoªí½×¤å "A Fast Algorithm for Computing a Longest Common Increasing Subsequence"¡C (©ó¤¤¥¿¤j¾Ç, 8/29/2003)

	³Ì«á½Ä¨ë¡A¤@«Ø·d©w
	¤@¥Ø¤@¹õ¡A°a»«¹ÜµN
	¤W­±¹ï°_¨Ó¥¿¦n¬O¤@°a©M«Ø»«
	ı±o¦Û¤v½s±oÁÙ¦³ÂI¯«
	¥þ÷Ò¥´¡I»¯¦Ñ¤S´¤¿ù®±¤F¡C

* ¶P¥»¹êÅç«Ç¦P¾Ç Ä_¸© ©M¦P¾Ç²Õ¹Î°Ñ¥[2003¦~IEEE²Ä¥|©¡¹q¸£µ{¦¡³]­pÄvÁÉ(IEEE CSIDC)¡Aªí²{Àu²§¡A©ó¥þ²y300¶¤¿E¯PÄvª§ªÌ¤¤²æ¿o¦Ó¥X¡A«i¹Ü¨MÁÉÁ`«a­x¡A¹Î¶¤¨ÃÀò±o¡uMicrosoft Multimedia Award¡v®íºa¡C(7/2/2003)

* ¶P¥»¹êÅç«Ç¦P¾Ç ¤@°a ²±¥Ý ´­©M Ä_¸© °Ñ¥["²Ä¤Q¤G©¡¥x¤j¤uµ{¬ì§Þ±MÃD½×¤å¤ñÁÉ"ºaÀò¸ê°T²Õ²Ä¤@¦W¡C(3/15/2003)

	Way to go
	Homerun