1 citations · 2 across the 5 of their papers we have counts for
7 papers · 1 filter
An FTP Algorithm for Temporal Graph Untangling
Riccardo Dondi, Manuel Lafond
Several classical combinatorial problems have been considered and analysed on temporal graphs. Recently, a variant of Vertex Cover on temporal graphs, called MinTimelineCover, has…
Finding agreement cherry-reduced subnetworks in level-1 networks
Kaari Landry, Olivier Tremblay-Savard, Manuel Lafond
Phylogenetic networks are increasingly being considered as better suited to represent the complexity of the evolutionary relationships between species. One class of phylogenetic ne…
The Longest Subsequence-Repeated Subsequence Problem
Manuel Lafond, Wenfeng Lai, Adiesha Liyanage +1
Motivated by computing duplication patterns in sequences, a new fundamental problem called the longest subsequence-repeated subsequence (LSRS) is proposed. Given a sequence of…
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 $…
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…
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…