Who Should Have a Place on the Ark? Parameterized algorithms for the maximization of the Phylogenetic Diversity

First and foremost, I humbly thank my redeemer, Jesus Christ, through whom the foundations of the heavens and the earth were created (Colossians 1:16, John 1:3) and who died on the cross as I deserve (Romans 6:23) so that I may live as He deserves (2 Corinthians 5:21). Jesus not only became my God b...

Descripción completa

Guardado en:  
Detalles Bibliográficos
Autor principal: Schestag, Jannik 1995- (Autor)
Autor Corporativo: Friedrich-Schiller-Universität Jena. Grad-verleihende Institution (Institución que otorga título)
Otros Autores: Komusiewicz, Christian ; Iersel, Leo J. J. van ; Weller, Mathias
Tipo de documento: Electrónico Libro
Lenguaje:Inglés
Alemán
Verificar disponibilidad: HBZ Gateway
WorldCat: WorldCat
Interlibrary Loan:Interlibrary Loan for the Fachinformationsdienste (Specialized Information Services in Germany)
Publicado: Jena [2025?]
En:Año: 2025
Clasificaciones IxTheo:HA Biblia
HB Antiguo Testamento
Otras palabras clave:B Parametrisierte Komplexität
B Algoritmo
B Publicación universitaria
Acceso en línea: Volltext (kostenfrei)
Volltext (kostenfrei)
Volltext (kostenfrei)
Volltext (kostenfrei)
Rights Information:CC BY 4.0

MARC

LEADER 00000cam a2200000 c 4500
001 1915777763
003 DE-627
005 20250630095822.0
007 cr uuu---uuuuu
008 250128s2025 gw |||||om 00| ||eng c
024 7 |a urn:nbn:de:gbv:27-dbt-64515-6  |2 urn 
024 7 |a 10.22032/dbt.64515  |2 doi 
035 |a (DE-627)1915777763 
035 |a (DE-599)KXP1915777763 
035 |a (OCoLC)1492139854 
040 |a DE-627  |b ger  |c DE-627  |e rda 
041 |a eng  |a ger 
044 |c XA-DE-TH 
082 0 4 |a 222.1  |q DE-101 
082 0 4 |a 220  |q DE-101 
084 |a 42.11  |2 bkl 
100 1 |e VerfasserIn  |0 (DE-588)1347688455  |0 (DE-627)1907997245  |4 aut  |a Schestag, Jannik  |d 1995- 
109 |a Schestag, Jannik 1995-  |a Schestag, Jannik Theodor 1995-  |a Schestag, J. 1995- 
245 1 0 |a Who Should Have a Place on the Ark? Parameterized algorithms for the maximization of the Phylogenetic Diversity  |c by Jannik "Theodor" Schestag, M.Sc. 
264 1 |a Jena  |c [2025?] 
300 |a 1 Online-Ressource (219 Seiten)  |b Illustrationen, Diagramme 
336 |a Text  |b txt  |2 rdacontent 
337 |a Computermedien  |b c  |2 rdamedia 
338 |a Online-Ressource  |b cr  |2 rdacarrier 
500 |a Tag der Verteidigung: 17.01.2025 
502 |b Dissertation  |c Friedrich-Schiller-Universität Jena  |d 2025 
506 0 |q DE-27  |a Open Access  |e Controlled Vocabulary for Access Rights  |u http://purl.org/coar/access_right/c_abf2 
520 |a First and foremost, I humbly thank my redeemer, Jesus Christ, through whom the foundations of the heavens and the earth were created (Colossians 1:16, John 1:3) and who died on the cross as I deserve (Romans 6:23) so that I may live as He deserves (2 Corinthians 5:21). Jesus not only became my God but also my best friend. All the strength, concentration, and willpower I needed to accomplish every part of this work were surely given by Him (Philippians 2:13). All glory, honor, and power be unto Him forever and ever (Revelation 4:11). Amen! Academically, I express my deepest gratitude to my supervisor, Christian Komusiewicz, for his multitude of great ideas and quick answers to my questions. Additionally, I thank him for the endless hours spent writing applications and for always staying supportive, even in situations where many other professors would have opted out. Though officially he is just a co-author, I want to thank Mark Jones as a ‘minor’ supervisor. His knowledge, humor, and way of working during the cooperative time left a very positive feeling with me and deőnitively improved my working spirit. Furthermore, I am grateful to Niels Grüttemeier and Frank Sommer, who initially supervised my Bachelor’s and Master’s degrees and later became colleagues. Also, I thank my other colleagues Alexander Bille, Jaroslav Garvardt, Nils Morawietz, Luca Staus, and the Master’s student Anton Herrmann, for creating a pleasant working atmosphere, sharing one or the other joke in times, and providing deep talks. I further want to thank all of my co-authors, listed in lexicographic order: Matthias Bentert, Jaroslav Garvardt, Niels Grüttemeier, Leo van Iersel, Mark Jones, Christian Komusiewicz, Simone Linz, Ber Lorke, Nils Morawietz, Malte Renken, Frank Sommer, Celine Scornavacca, and Mathias Weller. Gratefully, I received a őnancial support by the Deutscher Akademischer Austauschdienst (DAADÐGerman Academic Exchange Service), project 57556279, from April to September 2023. I thank the TU Delft and especially Leo van Iersel, Mark Jones, and their colleagues for hosting me during this period. Last but not least, for their unwavering support throughout my life, I want to express my sincerest thanks to my mother, Kerstin Schestag, and my sister, Mona Felina Schestag. Surely, I would have not come to where I am without them. While it is impossible to list all the important people in my life, I explicitly want to express thanks to my grandmother Edeltraud Schestag, Klaus Pieper, Holger & Regine Hellmich, Ricarda Schwarz, the Slembeck family, the Köhler family, Niklas Vogt, Jan Mischon, my late father Joachim Schestag, my late grandfather Ulrich Hellmich, and everyone who supportively prayed for me! 
540 |q DE-27  |a Namensnennung 4.0 International  |f CC BY 4.0  |2 cc  |u https://creativecommons.org/licenses/by/4.0/ 
546 |a Zusammenfassungen in deutscher und englischer Sprache 
583 1 |a Archivierung/Langzeitarchivierung gewährleistet  |x XA-DE-TH  |2 pdager  |5 DE-27 
601 |a Phylogenetik 
650 0 7 |0 (DE-588)4818897-9  |0 (DE-627)481883304  |0 (DE-576)216703727  |a Parametrisierte Komplexität  |2 gnd 
650 0 7 |0 (DE-588)4001183-5  |0 (DE-627)106398164  |0 (DE-576)20884161X  |a Algorithmus  |2 gnd 
650 0 7 |0 (DE-588)4818897-9  |0 (DE-627)481883304  |0 (DE-576)216703727  |a Parametrisierte Komplexität  |2 gnd 
650 0 7 |0 (DE-588)4001183-5  |0 (DE-627)106398164  |0 (DE-576)20884161X  |a Algorithmus  |2 gnd 
652 |a HA:HB  |b DDCoderRVK 
655 7 |a Hochschulschrift  |0 (DE-588)4113937-9  |0 (DE-627)105825778  |0 (DE-576)209480580  |2 gnd-content 
700 1 |e AkademischeR BetreuerIn  |0 (DE-588)1319115241  |0 (DE-627)1880590190  |4 dgs  |a Komusiewicz, Christian 
700 1 |a Iersel, Leo J. J. van  |e AkademischeR BetreuerIn  |4 dgs 
700 1 |e AkademischeR BetreuerIn  |0 (DE-588)1043396470  |0 (DE-627)770506259  |0 (DE-576)394764331  |4 dgs  |a Weller, Mathias 
710 2 |e Grad-verleihende Institution  |0 (DE-588)36164-1  |0 (DE-627)100833012  |0 (DE-576)190344695  |4 dgg  |a Friedrich-Schiller-Universität Jena 
751 |a Jena  |0 (DE-588)4028557-1  |0 (DE-627)104814411  |0 (DE-576)208977872  |4 uvp 
856 4 0 |u https://doi.org/10.22032/dbt.64515  |x Langzeitarchivierung  |x Resolving-System  |z kostenfrei  |7 0 
856 4 0 |u https://nbn-resolving.org/urn:nbn:de:gbv:27-dbt-64515-6  |x Resolving-System  |z kostenfrei  |7 0 
856 4 0 |u https://d-nb.info/1354762932/34  |x Langzeitarchivierung Nationalbibliothek  |z kostenfrei  |7 0 
856 4 0 |u https://www.db-thueringen.de/receive/dbt_mods_00064515  |q application/pdf  |x Verlag  |z kostenfrei  |7 0 
912 |a GBV-ODiss 
935 |a mteo 
936 b k |a 42.11  |j Biomathematik  |j Biokybernetik  |q SEPA  |0 (DE-627)106421425 
951 |a BO 
ELC |a 1 
LOK |0 000 xxxxxcx a22 zn 4500 
LOK |0 001 4664086385 
LOK |0 003 DE-627 
LOK |0 004 1915777763 
LOK |0 005 20250213231235 
LOK |0 008 250213||||||||||||||||ger||||||| 
LOK |0 040   |a DE-Tue135  |c DE-627  |d DE-Tue135 
LOK |0 092   |o n 
LOK |0 852   |a DE-Tue135 
LOK |0 852 1  |9 00 
LOK |0 935   |a ixbt 
LOK |0 939   |a 07-02-25  |b l01 
OAS |a 1 
ORI |a SA-MARC-ixtheoa001.raw 
REF |a Komplexität von Algorithmen 
STA 0 0 |a Algorithms,Computer algorithms 
STB 0 0 |a Algorithme 
STC 0 0 |a Algoritmo,Algoritmos computacionales 
STD 0 0 |a Algoritmo 
STF 0 0 |a 算法 
STG 0 0 |a Algoritmo 
STH 0 0 |a Алгоритм 
STI 0 0 |a Αλγόριθμος 
SYE 0 0 |a Parametrisierte Komplexitätstheorie,Parametrische Komplexität,Parameterized Complexity,Parametrized Complexity,Parametrische Komplexitätstheorie , Algorithmen , Parametrisierte Komplexitätstheorie,Parametrische Komplexität,Parameterized Complexity,Parametrized Complexity,Parametrische Komplexitätstheorie , Algorithmen