UB Paderborn / Katalog / Suche / in CDI

Graph Algorithms and Graph Theory-Symmetry Special Issue

Symmetry (Basel), 2022-08, Vol.14 (8), p.1748

Lafond, Manuel

2022

Volltextzugriff (PDF)

Comparing copy-number profiles under multi-copy amplifications and deletions

BMC genomics, 2020-04, Vol.21 (Suppl 2), p.198-12, Article 198

2020

Volltextzugriff (PDF)

Reconstruction of time-consistent species trees

Algorithms for molecular biology, 2020-08, Vol.15 (1), p.16-16, Article 16

2020

Volltextzugriff (PDF)

A generalized Robinson-Foulds distance for labeled trees

BMC genomics, 2020-11, Vol.21 (Suppl 10), p.779-779, Article 779

2020

Volltextzugriff (PDF)

Predicting horizontal gene transfers with perfect transfer networks

Algorithms for molecular biology, 2024-02, Vol.19 (1), p.6-6, Article 6

2024

Volltextzugriff (PDF)

Rearrangement moves on rooted phylogenetic networks

PLoS computational biology, 2017-08, Vol.13 (8), p.e1005611-e1005611

2017

Volltextzugriff (PDF)

Efficient Gene Tree Correction Guided by Genome Evolution

PloS one, 2016-08, Vol.11 (8), p.e0159559-e0159559

2016

Volltextzugriff (PDF)

Further results on Hendry's Conjecture

Discrete mathematics and theoretical computer science, 2022-08, Vol.24, no 2 (Graph Theory)

2022

Volltextzugriff (PDF)

Improved kernelization and fixed-parameter algorithms for bicluster editing

Journal of combinatorial optimization, 2024-07, Vol.47 (5), Article 90

Lafond, Manuel

2024

Volltextzugriff (PDF)

Reconciling multiple genes trees via segmental duplications and losses

Algorithms for molecular biology, 2019-03, Vol.14 (1), p.7-19, Article 7

2019

Volltextzugriff (PDF)

Recognizing k-Leaf Powers in Polynomial Time, for Constant k

ACM transactions on algorithms, 2023-09, Vol.19 (4), p.1-35, Article 35

Lafond, Manuel

2023

Volltextzugriff (PDF)

Relative timing information and orthology in evolutionary scenarios

Algorithms for molecular biology, 2023-11, Vol.18 (1), p.1-16, Article 16

2023

Volltextzugriff (PDF)

Evolution through segmental duplications and losses: a Super-Reconciliation approach

Algorithms for molecular biology, 2020-05, Vol.15 (1), p.1-12, Article 12

2020

Volltextzugriff (PDF)

The distance and median problems in the single-cut-or-join model with single-gene duplications

Algorithms for molecular biology, 2020-05, Vol.15 (1), p.8-8, Article 8

2020

Volltextzugriff (PDF)

On the Weighted Quartet Consensus problem

Theoretical computer science, 2019-05, Vol.769, p.1-17

2019

Volltextzugriff (PDF)

Preprocessing complexity for some graph problems parameterized by structural parameters

Procedia computer science, 2023, Vol.223, p.130-139

2023

Volltextzugriff (PDF)

A lightweight semi-centralized strategy for the massive parallelization of branching algorithms

Parallel computing, 2023-07, Vol.116, p.103024, Article 103024

2023

Volltextzugriff (PDF)

Orthology and paralogy constraints: satisfiability and consistency

BMC genomics, 2014-10, Vol.15 Suppl 6 (S6), p.S12-S12, Article S12

2014

Volltextzugriff (PDF)

A Fixed-Parameter Tractable Algorithm for Finding Agreement Cherry-Reduced Subnetworks in Level-1 Orchard Networks

Journal of computational biology, 2024-04, Vol.31 (4), p.360

2024

Volltextzugriff (PDF)

Median and small parsimony problems on RNA trees

Bioinformatics (Oxford, England), 2024-06, Vol.40 (Supplement_1), p.i237-i246

2024

Volltextzugriff (PDF)

On the Tractability of Covering a Graph with 2-Clubs

Algorithmica, 2023-04, Vol.85 (4), p.992-1028

2023

Volltextzugriff (PDF)

Computing the Tandem Duplication Distance is NP-Hard

SIAM journal on discrete mathematics, 2022-01, Vol.36 (1), p.64-91

2022

Volltextzugriff (PDF)

Accurate prediction of orthologs in the presence of divergence after duplication

Bioinformatics, 2018-07, Vol.34 (13), p.i366-i375

2018

Volltextzugriff (PDF)

On the Tractability of Covering a Graph with 2-Clubs

Fundamentals of Computation Theory, p.243-257

Volltextzugriff (PDF)

Efficient assembly consensus algorithms for divergent contig sets

Computational biology and chemistry, 2021-08, Vol.93, p.107516-107516, Article 107516

2021

Volltextzugriff (PDF)

Menü

Weitere Dienste

Einstellungen

Graph Algorithms and Graph Theory-Symmetry Special Issue

Comparing copy-number profiles under multi-copy amplifications and deletions

Reconstruction of time-consistent species trees

A generalized Robinson-Foulds distance for labeled trees

Predicting horizontal gene transfers with perfect transfer networks

Rearrangement moves on rooted phylogenetic networks

Efficient Gene Tree Correction Guided by Genome Evolution

Further results on Hendry's Conjecture

Improved kernelization and fixed-parameter algorithms for bicluster editing

Reconciling multiple genes trees via segmental duplications and losses

Recognizing k-Leaf Powers in Polynomial Time, for Constant k

Relative timing information and orthology in evolutionary scenarios

Evolution through segmental duplications and losses: a Super-Reconciliation approach

The distance and median problems in the single-cut-or-join model with single-gene duplications

On the Weighted Quartet Consensus problem

Preprocessing complexity for some graph problems parameterized by structural parameters

A lightweight semi-centralized strategy for the massive parallelization of branching algorithms

Orthology and paralogy constraints: satisfiability and consistency

A Fixed-Parameter Tractable Algorithm for Finding Agreement Cherry-Reduced Subnetworks in Level-1 Orchard Networks

Median and small parsimony problems on RNA trees

On the Tractability of Covering a Graph with 2-Clubs

Computing the Tandem Duplication Distance is NP-Hard

Accurate prediction of orthologs in the presence of divergence after duplication

On the Tractability of Covering a Graph with 2-Clubs

Efficient assembly consensus algorithms for divergent contig sets

Suchergebnisse filtern