Nicolas Wieseke

According to our database1, Nicolas Wieseke authored at least 26 papers between 2010 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Relative timing information and orthology in evolutionary scenarios.
Algorithms Mol. Biol., December, 2023

2022
Complete edge-colored permutation graphs.
Adv. Appl. Math., 2022

2020
Indirect Identification of Horizontal Gene Transfer.
CoRR, 2020

Cograph editing: Merging modules is equivalent to editing P_4s.
Art Discret. Appl. Math., 2020

2018
Genome Rearrangement with ILP.
IEEE ACM Trans. Comput. Biol. Bioinform., 2018

On tree representations of relations and graphs: symbolic ultrametrics and cograph edge decompositions.
J. Comb. Optim., 2018

Time-consistent reconciliation maps and forbidden time travel.
Algorithms Mol. Biol., 2018

Partial Homology Relations - Satisfiability in Terms of Di-Cographs.
Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

2017
From Homologous Genes to Phylogenetic Species Trees: On Tree Representations of Binary Relations
PhD thesis, 2017

Phylogenomics with Paralogs.
CoRR, 2017

Reconstructing Gene Trees From Fitch's Xenology Relation.
CoRR, 2017

Partial Orthology, Paralogy and Xenology Relations - Satisfiability in terms of Di-Cographs.
CoRR, 2017

Merging Modules is equivalent to Editing P4's.
CoRR, 2017

Forbidden Time Travel: Characterization of Time-Consistent Tree Reconciliation Maps.
Proceedings of the 17th International Workshop on Algorithms in Bioinformatics, 2017

2016
Construction of Gene and Species Trees from Sequence Data incl. Orthologs, Paralogs, and Xenologs.
CoRR, 2016

The Mathematics of Xenology: Di-cographs, Symbolic Ultrametrics, 2-structures and Tree-representable Systems of Binary Relations.
CoRR, 2016

The paralog-to-contig assignment problem: high quality gene models from fragmented assemblies.
Algorithms Mol. Biol., 2016

2015
Cophylogenetic Reconciliation with ILP.
IEEE ACM Trans. Comput. Biol. Bioinform., 2015

Techniques for the Cograph Editing Problem: Module Merge is equivalent to Editing P4s.
CoRR, 2015

On Symbolic Ultrametrics, Cotree Representations, and Cograph Edge Decompositions and Partitions.
Proceedings of the Computing and Combinatorics - 21st International Conference, 2015

2014
Simulation of gene family histories.
BMC Bioinform., 2014

2013
Unifying Parsimonious Tree Reconciliation.
Proceedings of the Algorithms in Bioinformatics - 13th International Workshop, 2013

POMAGO: Multiple Genome-Wide Alignment Tool for Bacteria.
Proceedings of the Bioinformatics Research and Applications, 9th International Symposium, 2013

On Weighting Schemes for Gene Order Analysis.
Proceedings of the German Conference on Bioinformatics 2013, 2013

2012
From event-labeled gene trees to species trees.
BMC Bioinform., 2012

2010
A parameter-adaptive dynamic programming approach for inferring cophylogenies.
BMC Bioinform., 2010


  Loading...