Return to search

A Survey of the Longest Common Subsequence Problem and Its Related Problems

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.

Identiferoai:union.ndltd.org:NSYSU/oai:NSYSU:etd-0912105-124156
Date12 September 2005
CreatorsChen, Jian-bein
ContributorsChang-biau Yang, none, Yue-li Wang, Chia-ning Yang, Wu-chih Hu
PublisherNSYSU
Source SetsNSYSU Electronic Thesis and Dissertation Archive
LanguageEnglish
Detected LanguageEnglish
Typetext
Formatapplication/pdf
Sourcehttp://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0912105-124156
Rightsoff_campus_withheld, Copyright information available at source archive

Page generated in 0.0023 seconds