\documentclass{article}
\usepackage{xeCJK} %使用xeLatex打中文必備，會自動載入fontspec，並讓讓中英文字體分開設置
\setCJKmainfont[AutoFakeBold=6,AutoFakeSlant=.4]{新細明體} %設定中文為系統上的字型，而英文不去更動
%加了這二行後，就可以隨意的打中文，接下來的跟一般的LeTeX都一樣
%AutoFakeBold設定粗體字要多粗
%AutoFakeSlant設定斜體字要多斜，範圍-0.999到0.999，負值為往左斜
%註：檔案一定要存在UTF-8的編碼格式才行
%以下四行非必要，但蠻好用的。
\defaultCJKfontfeatures{AutoFakeBold=6,AutoFakeSlant=.4} %以後不用再設定粗斜
\newCJKfontfamily\Kai{標楷體}
\newCJKfontfamily\Hei{微軟正黑體}
\newCJKfontfamily\NewMing{新細明體}
%更詳細的參數請參考 http://goo.gl/C8eld
\usepackage{amsmath,amsfonts,amsthm}
\title{2014 Symposium for Young Combinatorialists}
\author{Junyi Guo 無名氏\\
Department of Applied Mathematics 應用數學系\\
National Chiaotung University 交通大學\\
E-mail: junyiguo@gmail.com}
\date{} %不要日期
\begin{document}
\maketitle
\begin{center}
Advisor: David Guo 鍾文版
\end{center}
There are two general approaches to the longest common subsequence
problem. The dynamic programming approach takes quadratic time but
linear space, while the non-dynamic-programming approach takes
less time but more space. We propose a new implementation of the
latter approach which seems to get the best for both time and
space for the DNA application.
Mutations in DNA arise naturally in an evolution process. These
mutations include substitutions, insertions and deletions of
nucleotides, leading to ``editing" of DNA texts. A sequence
comparison of two DNA sequences attempts to align the two
sequences to minimize a function of these mutations. The most
commonly used function is the so-called edit distance first
introduced by Levenshtein which simply counts the
number of mutations. If substitutions are not allowed, then the
alignment minimizing the edit distance will produce a longest
common subsequence (LCS) of the two sequences. Note that the LCS
problem had been studied by mathematicians for general sequences
long before the edit distance was introduced for DNA sequences.
\textbf{Keywords}: LCS, Longest Common Subsequence,
dynamic programming, DNA sequencing.
\end{document}