%PDF-1.4 % 5 0 obj << /S /GoTo /D (chapter.1) >> endobj 8 0 obj (1 Introduction) endobj 9 0 obj << /S /GoTo /D (section.2) >> endobj 12 0 obj (1.1 Modeling Gene Order) endobj 13 0 obj << /S /GoTo /D (subsection.4) >> endobj 16 0 obj (1.1.1 Homology Assignment) endobj 17 0 obj << /S /GoTo /D (subsection.5) >> endobj 20 0 obj (1.1.2 Basic Models) endobj 21 0 obj << /S /GoTo /D (subsection.8) >> endobj 24 0 obj (1.1.3 Model Variants) endobj 25 0 obj << /S /GoTo /D (section.12) >> endobj 28 0 obj (1.2 Comparative Genomics) endobj 29 0 obj << /S /GoTo /D (section.13) >> endobj 32 0 obj (1.3 Phylogeny) endobj 33 0 obj << /S /GoTo /D (section.16) >> endobj 36 0 obj (1.4 Overview of the Thesis) endobj 37 0 obj << /S /GoTo /D (section.18) >> endobj 40 0 obj (1.5 Acknowledgements) endobj 41 0 obj << /S /GoTo /D (chapter.19) >> endobj 44 0 obj (2 Labeling a Phylogenetic Tree with Sets of Gene Clusters) endobj 45 0 obj << /S /GoTo /D (section.20) >> endobj 48 0 obj (2.1 Abstract Gene Cluster Model) endobj 49 0 obj << /S /GoTo /D (section.23) >> endobj 52 0 obj (2.2 Labelings and Their Properties) endobj 53 0 obj << /S /GoTo /D (subsection.25) >> endobj 56 0 obj (2.2.1 Consistency) endobj 57 0 obj << /S /GoTo /D (subsection.32) >> endobj 60 0 obj (2.2.2 Parsimony) endobj 61 0 obj << /S /GoTo /D (section.39) >> endobj 64 0 obj (2.3 The Labeling Problem) endobj 65 0 obj << /S /GoTo /D (chapter.65) >> endobj 68 0 obj (3 An Algorithmical Framework to Find an Optimal Labeling) endobj 69 0 obj << /S /GoTo /D (section.66) >> endobj 72 0 obj (3.1 Fitch and Hartigan) endobj 73 0 obj << /S /GoTo /D (section.72) >> endobj 76 0 obj (3.2 Finding Conflicts) endobj 77 0 obj << /S /GoTo /D (subsection.83) >> endobj 80 0 obj (3.2.1 Practical Enhancements) endobj 81 0 obj << /S /GoTo /D (section.96) >> endobj 84 0 obj (3.3 Branch-And-Bound Search) endobj 85 0 obj << /S /GoTo /D (section.111) >> endobj 88 0 obj (3.4 Two-Phase Approach) endobj 89 0 obj << /S /GoTo /D (section.114) >> endobj 92 0 obj (3.5 Complexity) endobj 93 0 obj << /S /GoTo /D (chapter.115) >> endobj 96 0 obj (4 Permutation-based Gene Cluster Models) endobj 97 0 obj << /S /GoTo /D (section.116) >> endobj 100 0 obj (4.1 Adjacencies on Permutations) endobj 101 0 obj << /S /GoTo /D (subsection.118) >> endobj 104 0 obj (4.1.1 Efficient Filtering) endobj 105 0 obj << /S /GoTo /D (subsection.126) >> endobj 108 0 obj (4.1.2 Model Variants) endobj 109 0 obj << /S /GoTo /D (section.134) >> endobj 112 0 obj (4.2 Common Intervals on Permutations) endobj 113 0 obj << /S /GoTo /D (subsection.136) >> endobj 116 0 obj (4.2.1 Efficient Filtering with PQ Trees) endobj 117 0 obj << /S /GoTo /D (subsection.146) >> endobj 120 0 obj (4.2.2 Generalized Models) endobj 121 0 obj << /S /GoTo /D (section.147) >> endobj 124 0 obj (4.3 Framed Common Intervals on Permutations) endobj 125 0 obj << /S /GoTo /D (section.153) >> endobj 128 0 obj (4.4 Nested Common Intervals on Permutations) endobj 129 0 obj << /S /GoTo /D (subsection.158) >> endobj 132 0 obj (4.4.1 Modified Preprocessing) endobj 133 0 obj << /S /GoTo /D (section.163) >> endobj 136 0 obj (4.5 Evaluation on Simulated Data) endobj 137 0 obj << /S /GoTo /D (subsection.164) >> endobj 140 0 obj (4.5.1 Simulation Setup) endobj 141 0 obj << /S /GoTo /D (subsection.167) >> endobj 144 0 obj (4.5.2 Results) endobj 145 0 obj << /S /GoTo /D (chapter.183) >> endobj 148 0 obj (5 Sequence-based Gene Cluster Models) endobj 149 0 obj << /S /GoTo /D (section.184) >> endobj 152 0 obj (5.1 Consistency on Sequences) endobj 153 0 obj << /S /GoTo /D (subsection.186) >> endobj 156 0 obj (5.1.1 Restricting the Multiplicity of Genes) endobj 157 0 obj << /S /GoTo /D (subsection.195) >> endobj 160 0 obj (5.1.2 Sequences without Duplications) endobj 161 0 obj << /S /GoTo /D (section.196) >> endobj 164 0 obj (5.2 Adjacencies on Sequences) endobj 165 0 obj << /S /GoTo /D (subsection.199) >> endobj 168 0 obj (5.2.1 The Gene Order Graph) endobj 169 0 obj << /S /GoTo /D (subsection.214) >> endobj 172 0 obj (5.2.2 Evaluation on Simulated Data) endobj 173 0 obj << /S /GoTo /D (section.224) >> endobj 176 0 obj (5.3 Common Intervals on Sequences) endobj 177 0 obj << /S /GoTo /D (section.229) >> endobj 180 0 obj (5.4 Variants of Common Intervals on Sequences) endobj 181 0 obj << /S /GoTo /D (chapter.242) >> endobj 184 0 obj (6 The Evolution of the Corynebacterium Genome) endobj 185 0 obj << /S /GoTo /D (section.243) >> endobj 188 0 obj (6.1 Data Preparation and General Results) endobj 189 0 obj << /S /GoTo /D (subsection.246) >> endobj 192 0 obj (6.1.1 Homology Assignment and Further Preprocessing) endobj 193 0 obj << /S /GoTo /D (subsection.252) >> endobj 196 0 obj (6.1.2 Reconstruction Results) endobj 197 0 obj << /S /GoTo /D (section.255) >> endobj 200 0 obj (6.2 Cell Wall Biosynthesis Block) endobj 201 0 obj << /S /GoTo /D (section.258) >> endobj 204 0 obj (6.3 Central Metabolism) endobj 205 0 obj << /S /GoTo /D (section.266) >> endobj 208 0 obj (6.4 DNA Synthesis) endobj 209 0 obj << /S /GoTo /D (chapter.269) >> endobj 212 0 obj (7 Conclusion and Outlook) endobj 213 0 obj << /S /GoTo /D (section*.272) >> endobj 216 0 obj ( Bibliography) endobj 217 0 obj << /S /GoTo /D (chapter.273) >> endobj 220 0 obj (A NP-Completeness Proofs) endobj 221 0 obj << /S /GoTo /D (section.274) >> endobj 224 0 obj (A.1 The 3-Bipartite Hamiltonian Cycle Problem) endobj 225 0 obj << /S /GoTo /D (section.280) >> endobj 228 0 obj (A.2 Consistency Problem for Common Intervals on Sequences) endobj 229 0 obj << /S /GoTo /D (section.295) >> endobj 232 0 obj (A.3 Consistency Problem for Framed Common Intervals on Sequences) endobj 233 0 obj << /S /GoTo /D (section.298) >> endobj 236 0 obj (A.4 Consistency Problem for Nested Common Intervals on Sequences) endobj 237 0 obj << /S /GoTo /D [238 0 R /Fit ] >> endobj 242 0 obj << /Length 602 /Filter /FlateDecode >> stream xڝT[o0~c"c;x k#tR=DZ@U;6鉌3 58zu<~8_|QQҀq⟑$-Q` pZ-K8Sֱ "`aU̯sٶkƸy!͖oo,{uutq& jk M &x{\os١7˹Ū]#8s`ﺺ=iq]"ݏƀ0We 8(.&/rYW[Z!(tG(A8X#ĸ_i"sԧeX