Exact Algorithms for the Longest Common Subsequence Problem for Arc-Annotated Sequences (2002)
| Venue: | Diploma thesis, Universität Tübingen, Fed. Rep. of |
| Citations: | 5 - 2 self |
BibTeX
@INPROCEEDINGS{Guo02exactalgorithms,
author = {Jiong Guo},
title = {Exact Algorithms for the Longest Common Subsequence Problem for Arc-Annotated Sequences},
booktitle = {Diploma thesis, Universität Tübingen, Fed. Rep. of},
year = {2002},
pages = {24--4910},
publisher = {Springer-Verlag}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Contents 1 Introduction 5 2 Biological Motivation 9 2.1 Some Molecular Biology . . . . . . . . . . . . . . . . . . . . . . . 9 2.2 Biological Motivation . . . . . . . . . . . . . . . . . . . . . . . . . 12 3 Some Basic Definitions 13 3.1 LCS and Some Problems from Graph Theory . . . . . . . . . . . 13 3.2 Parameterized Complexity . . . . . . . . . . . . . . . . . . . . . . 15 3.3 Arc Annotation . . . . . . . . . . . . . . . . . . . . . . . . . . . . 20 4 Previous Results 27 4.1 Classical Complexity . . . . . . . . . . . . . . . . . . . . . . . . . 27 4.2 Parameterized Complexity . . . . . . . . . . . . . . . . . . . . . . 29 4.3 Complexity of Arc-Preserving Subsequence Problem . . . . . . . 30 4.4 Overview of This Work . . . . . . . . . . . . . . . . . . . . . . . 31 5 c-fragment, c-diagonal LAPCS 33 5.1 c-fragment<F10
