Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Inversion Medians Outperform Breakpoint Medians in Phylogeny Reconstruction from Gene-Order Data
WABI '02 Proceedings of the Second International Workshop on Algorithms in Bioinformatics
Mathematics of Evolution and Phylogeny
Mathematics of Evolution and Phylogeny
On the similarity of sets of permutations and its applications to genome comparison
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Genomic distances under deletions and insertions
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Exemplar Longest Common Subsequence
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Comparing Genomes with Duplications: A Computational Complexity Point of View
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Approximability and Fixed-Parameter Tractability for the Exemplar Genomic Distance Problems
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
RECOMB-CG'07 Proceedings of the 2007 international conference on Comparative genomics
On the approximability of comparing genomes with duplicates
WALCOM'08 Proceedings of the 2nd international conference on Algorithms and computation
Genes order and phylogenetic reconstruction: application to γ-proteobacteria
RCG'05 Proceedings of the 2005 international conference on Comparative Genomics
Maximizing synteny blocks to identify ancestral homologs
RCG'05 Proceedings of the 2005 international conference on Comparative Genomics
RCG'05 Proceedings of the 2005 international conference on Comparative Genomics
The approximability of the exemplar breakpoint distance problem
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
Lower bounds on the approximation of the exemplar conserved interval distance problem of genomes
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Inferring positional homologs with common intervals of sequences
RCG'06 Proceedings of the RECOMB 2006 international conference on Comparative Genomics
How pseudo-boolean programming can help genome rearrangement distance computation
RCG'06 Proceedings of the RECOMB 2006 international conference on Comparative Genomics
Inferring gene orders from gene maps using the breakpoint distance
RCG'06 Proceedings of the RECOMB 2006 international conference on Comparative Genomics
Genomes containing duplicates are hard to compare
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part II
Non-breaking similarity of genomes with gene repetitions
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
| Hi-index | 0.00 |
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.