Recently, several studies taking into account the ability for a gene to be absent or to have some copies in genomes have been proposed, as the examplar distance [6,11] or the gene matching computation between two genomes [3,10]. In this paper, we study the time complexity of the conserved interval distance computation considering duplicated genes using both those two strategies
Rubert D, Feijão P, Dias Vieira Braga M, Stoye J, Martinez FHV. A Linear Time Approximation Algorith...
International audienceComputing genomic distances between whole genomes is a fundamental problem in ...
In this paper, we are interested in the computational complexity of computing (dis) similarity measu...
International audienceRecently, several studies taking into account the ability for a gene to be abs...
The comparison of genomes with the same gene content relies on our ability to compare permutations,...
Abstract. In this paper, we are interested in the algorithmic complexity of computing (dis)similarit...
International audienceIn this paper, we are interested in the algorithmic complexity of computing (d...
In this paper, we are interested in the algorithmic complexity of computing (dis)similarity measures...
Bergeron A, Stoye J. On the similarity of sets of permutations and its applications to genome compar...
Comparative genomics consists in studying similarities/dissimilarities between genomes, and can be u...
A fundamental problem in comparative genomics is to compute the distance between two genomes in term...
AbstractIn this paper, we address two different problems related to conserved regions in K⩾2 genomes...
International audienceIn this paper, we address two different problems related to conserved regions ...
International audienceComparing genomes of different species has become a crucial problem in compara...
A central problem in comparative genomics consists in computing a (dis-)similarity measure between t...
Rubert D, Feijão P, Dias Vieira Braga M, Stoye J, Martinez FHV. A Linear Time Approximation Algorith...
International audienceComputing genomic distances between whole genomes is a fundamental problem in ...
In this paper, we are interested in the computational complexity of computing (dis) similarity measu...
International audienceRecently, several studies taking into account the ability for a gene to be abs...
The comparison of genomes with the same gene content relies on our ability to compare permutations,...
Abstract. In this paper, we are interested in the algorithmic complexity of computing (dis)similarit...
International audienceIn this paper, we are interested in the algorithmic complexity of computing (d...
In this paper, we are interested in the algorithmic complexity of computing (dis)similarity measures...
Bergeron A, Stoye J. On the similarity of sets of permutations and its applications to genome compar...
Comparative genomics consists in studying similarities/dissimilarities between genomes, and can be u...
A fundamental problem in comparative genomics is to compute the distance between two genomes in term...
AbstractIn this paper, we address two different problems related to conserved regions in K⩾2 genomes...
International audienceIn this paper, we address two different problems related to conserved regions ...
International audienceComparing genomes of different species has become a crucial problem in compara...
A central problem in comparative genomics consists in computing a (dis-)similarity measure between t...
Rubert D, Feijão P, Dias Vieira Braga M, Stoye J, Martinez FHV. A Linear Time Approximation Algorith...
International audienceComputing genomic distances between whole genomes is a fundamental problem in ...
In this paper, we are interested in the computational complexity of computing (dis) similarity measu...
DOI
Add to ORKG