ABSTRACT
The longest common subsequence (LCS) problem is a classical problem both in com-
binational optimization and computational biology. During the past few decades,
a considerable number of studies have been focused on LCS and its related prob-
lems. In this thesis, we shall present a complete survey on LCS and its related
problems, and review some e¡Ócient algorithms for solving these problems. We shall
also give the de¡Ânition to each problem, present some theorems, and illustrate time
complexity and space complexity of the algorithms for solving these problems.
| Identifer | oai:union.ndltd.org:NSYSU/oai:NSYSU:etd-0912105-124156 |
| Date | 12 September 2005 |
| Creators | Chen, Jian-bein |
| Contributors | Chang-biau Yang, none, Yue-li Wang, Chia-ning Yang, Wu-chih Hu |
| Publisher | NSYSU |
| Source Sets | NSYSU Electronic Thesis and Dissertation Archive |
| Language | English |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0912105-124156 |
| Rights | off_campus_withheld, Copyright information available at source archive |
Page generated in 0.0022 seconds