activity
20172021
most citedRecognizing k-leaf powers in polynomial time, for constant k

1 citations · 1 across the 3 of their papers we have counts for

collaborators

12 papers

cs.DS20211 cited

Recognizing k-leaf powers in polynomial time, for constant k

Manuel Lafond

A graph is a -leaf power if there exists a tree whose leaf set is , and such that if and only if the distance between and in is at most $…

q-bio.PE2020

Indirect Identification of Horizontal Gene Transfer

David Schaller, Manuel Lafond, Peter F. Stadler +2

Several implicit methods to infer Horizontal Gene Transfer (HGT) focus on pairs of genes that have diverged only after the divergence of the two species in which the genes reside.…

q-bio.GN2020

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

Garance Cordonnier, Manuel Lafond

During cancer progression, malignant cells accumulate somatic mutations that can lead to genetic aberrations. In particular, evolutionary events akin to segmental duplications or d…

cs.DS2020

Genomic Problems Involving Copy Number Profiles: Complexity and Algorithms

Manuel Lafond, Binhai Zhu, Peng Zou

Recently, due to the genomic sequence analysis in several types of cancer, the genomic data based on {\em copy number profiles} ({\em CNP} for short) are getting more and more popu…

cs.DM2019

Reconstruction of time-consistent species trees

Manuel Lafond, Marc Hellmuth

The history of gene families -- which are equivalent to event-labeled gene trees -- can to some extent be reconstructed from empirically estimated evolutionary event-relations cont…

cs.DS2019

The Tandem Duplication Distance is NP-hard

Manuel Lafond, Binhai Zhu, Peng Zou

In computational biology, tandem duplication is an important biological phenomenon which can occur either at the genome or at the DNA level. A tandem duplication takes a copy of a…