§Ú¦XµÛªº®Ñ¡G

[1] »P¤ý§µº³µ¥¦XµÛ(1997, 1998, 2000, 2002 & 2003)¡u­pºâ¾÷·§½×¡v¡AªFµØ®Ñ§½¡C(ISBN 957-483-143-4) [¥»®Ñ²Ä¤»ª© (2004¦~)¡A§ï¥ÑùÖ峯¥Xª©ªÀµo¦æ¡C] (¹ê°È¾Þ§@¡F¾P°â¸U¥»)

[2] Wu, B.Y. and Chao, K.-M. (2004) ¡§Spanning Trees and Optimization Problems,¡¨  Chapman & Hall/CRC Press, USA. (200 pages; ISBN 1-58488-436-3) (¥»®Ñwebsite) (¥þ²y¼Æ¦Ê®a¹Ï®ÑÀ]¦¬ÂÃ)

[3] »¯©[­Z ±i¶®´f ¶ÀÄ_¸© ¦XµÛ (2004¡A2005¡A2006¡A2008) ¡u­pºâ¾÷·§½×¡v¡A¥þµØ¬ì§Þ¹Ï®Ñ¤½¥q¥Xª© (¥»®Ñwebsite) (¸ê°T¤uµ{¾É½×¡F­×­q¤Tª©©ó2008¦~6¤ë¤W¥«¡F¾P°â¸U¥»)

[4] Chao, K.-M. and Zhang, L. (2008) ¡§Sequence Comparison: Theory and Methods,¡¨ Springer. (210 pages; ISBN 978-1848003194)

§Ú°Ñ»P¼¶¼gªº³¹¸`¡G

[1] Chao, K.-M. (2004) ¡§Dynamic-Programming Strategies for Biomolecular Sequence Analysis ,¡¨ Chapter 1 of the book ¡§Selected Topics in Post-Genome Knowledge Discovery,¡¨ edited by L. Wong and L. Zhang, IMS Lecture Notes Series, Imperial College Press, UK. (ISBN 981-238-780-3)

[2] Wu, B.Y., Tang C.Y., and Chao, K.-M. (2007) ¡§Optimum Communication Spanning Trees,¡¨ Chapter 59 of the book ¡§Handbook of Approximation Algorithms and Metaheuristics,¡¨ edited by Teofilo F. Gonzalez, Chapman & Hall/CRC Press, USA. (ISBN 1-58488-550-5)

[3] Huang, Y.-T., Zhang, K., Chen, T., and Chao, K. -M. (2007) ¡§Approximation Algorithms for the Selection of Robust Tag SNPs,¡¨ Chapter 77 of the book ¡§Handbook of Approximation Algorithms and Metaheuristics,¡¨ edited by Teofilo F. Gonzalez, Chapman & Hall/CRC Press, USA. (ISBN 1-58488-550-5)

[4] Chao, K.-M. (2007) ¡§Genomic Sequence Analysis: A Case Study in Constrained Heaviest Segments,¡¨ Chapter 4 of the book ¡§Computational Genomics: Current Methods," edited by Nikola Stojanovic,  Horizon Press, UK. (ISBN 978-1-904933-30-4)

§Ú½Ķªº®Ñ¡G

[1] »¯©[­Z¤Î®]åi¸tĶ(1987)¡uPC AT¨Ï¥Î¤â¥U¡v¡AªQ±^®Ñ§½¡C(¾P°â¸U¥»)

[2] ³¯¨ØµØ¤Î»¯©[­ZĶ(1989)¡u­pºâ¾÷·§½×¡v¡AªQ±^®Ñ§½¡C(¾P°â¸U¥»)

[3] »¯©[­ZĶ(1989)¡u§@·~¨t²Î¾É½×¡v¡AªQ±^®Ñ§½¡C(¾P°â¸U¥»)